Results 11 to 20 of about 468,745 (232)
On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2023 Let H = (V, E) be a hypergraph, where V is a set of vertices and E is a set of non-empty subsets of V called edges. If all edges of H have the same cardinality r, then H is an r-uniform hypergraph; if E consists of all r-subsets of V, then H is a ...
Tian Yingzhi +3 more
doaj +1 more source
Uniform bounds for isoperimetric problems [PDF]
Proceedings of the American Mathematical Society, 1989 In this paper we generalize our previous joint work with Allan Calder on the width of homotopies by considering an arbitrary finite polyhedral pair ( W , V ) \left ( {W,V} \right ) rather than ( I , {
Siegel, Jerrold, Williams, Frank
openaire +2 more sources
Bounded derivations on uniform Roe algebras [PDF]
Rocky Mountain Journal of Mathematics, 2020 9 ...
Lorentz, Matthew, Willett, Rufus
openaire +4 more sources
Uniform Bounds for Invariant Subspace Perturbations [PDF]
SIAM Journal on Matrix Analysis and Applications, 2020 29 pages, 3 figures; added new theorem for random E; corrected typos and improved clarity; mild revisions to the way the main results are stated, but no significant changes to the results ...
Anil Damle, Yuekai Sun
openaire +2 more sources
Uniform Linear Bound in Chevalley's Lemma [PDF]
Canadian Journal of Mathematics, 2008 AbstractWe obtain a uniform linear bound for the Chevalley function at a point in the source of an analytic mapping that is regular in the sense of Gabrielov. There is a version of Chevalley’s lemma also along a fibre, or at a point of the image of a proper analytic mapping.
Adamus, Janusz +2 more
openaire +5 more sources
Journal of Inequalities and Applications, 2020 In this paper, we obtain a sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and characterize when this bound is achieved. Furthermore, this result deduces the main result in [X. Duan and B.
Chuang Lv, Lihua You, Xiao-Dong Zhang
doaj +1 more source
New bounds on Poisson approximation to the distribution of a sum of negative binomial random variables [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2018 The Stein-Chen method is usedto give new bounds, non-uniform bounds, for the distances between the distribution of a sum of independent negative binomial random variables and a Poisson distribution with mean, where ri and pi = 1-qi are parameters of ...
Kanint Teerapabolarn
doaj +1 more source
Optimal PAC Bounds without Uniform Convergence
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023 In statistical learning theory, determining the sample complexity of realizable binary classification for VC classes was a long-standing open problem. The results of Simon and Hanneke established sharp upper bounds in this setting. However, the reliance of their argument on the uniform convergence principle limits its applicability to more general ...
Aden-Ali, Ishaq +3 more
openaire +2 more sources
Upper bounds on the uniform spreads of the sporadic simple groups [PDF]
International Journal of Group Theory, 2019 A finite group $G$ has uniform spread $k$ if there exists a fixed conjugacy class $C$ of elements in $G$ with the property that for any $k$ nontrivial elements $s_1, s_2,ldots,s_k$ in $G$ there exists $yin C$ such that $G = langle s_i,yrangle$ for $
Ali Raza Rahimipour, Yousof Farzaneh
doaj +1 more source
Uniform derandomization from pathetic lower bounds [PDF]
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2012 The notion of probabilistic computation dates back at least to Turing, who also wrestled with the practical problems of how to implement probabilistic algorithms on machines with, at best, very limited access to randomness. A more recent line of research, known as derandomization, studies the extent to which randomness is superfluous.
Allender, Eric +3 more
openaire +2 more sources