Results 31 to 40 of about 1,282,961 (279)
Uniform bound for Hecke L-functions
Acta Mathematica, 2005 50 ...
Jutila, Matti, Motohashi, Yoichi
openaire +4 more sources
Improved security analysis for OMAC as a pseudorandom function
Journal of Mathematical Cryptology, 2009 This paper shows that the advantage of any q-query adversary (which makes at most q queries) for distinguishing OMAC from a uniform random function is roughly Lq2/2n.
Nandi Mridul
doaj +1 more source
An upper bound for the Z-spectral radius of adjacency tensors
Journal of Inequalities and Applications, 2018 Let H $\mathcal{H}$ be a k-uniform hypergraph on n vertices with degree sequence Δ=d1≥⋯≥dn=δ $\Delta=d_{1} \geq\cdots\geq d_{n}=\delta$. In this paper, in terms of degree di $d_{i}$, we give a new upper bound for the Z-spectral radius of the adjacency ...
Zhi-Yong Wu +3 more
doaj +1 more source
Metric Uniformization and Spectral Bounds for Graphs [PDF]
Geometric and Functional Analysis, 2011 We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of such a metric is shown by examining the combinatorics of special types of flows.
Kelner, Jonathan Adam +3 more
openaire +4 more sources
Electronic Notes in Theoretical Computer Science, 2002 AbstractWe investigate the computable content of the Uniform Boundedness Theorem which states that a pointwise bounded sequence of bounded linear operators on Banach spaces is also uniformly bounded. But, given the sequence, can we also effectively find the uniform bound? It turns out that the answer depends on how the sequence is “given”.
openaire +1 more source
On uniform bounds of primeness in matrix rings [PDF]
Journal of the Australian Mathematical Society, 2004 AbstractA subset S of an associative ring R is a uniform insulator for R provided a S b ≠ 0 for any nonzero a, b ∈ R. The ring R is called uniformly strongly prime of bound m if R has uniform insulators and the smallest of those has cardinality m. Here we compute these bounds for matrix rings over fields and obtain refinements of some results of van ...
Beidar, Konstantin I., Wisbauer, Robert
openaire +1 more source
Sunflowers and -intersecting families
AKCE International Journal of Graphs and Combinatorics, 2020 Let stand for the least number so that if is an arbitrary -uniform, -intersecting set system, where , and has more than elements, then contains a sunflower with petals. We give an upper bound for .
Gábor Hegedűs
doaj +1 more source
On Medium-Uniformity and Circuit Lower Bounds [PDF]
2013 IEEE Conference on Computational Complexity, 2013 We explore relationships between circuit complexity, the complexity of generating circuits, and algorithms for analyzing circuits. Our results can be divided into two parts: 1. Lower Bounds Against Medium-Uniform Circuits. Informally, a circuit class is “medium uniform” if it can be generated by an algorithmic process that is somewhat complex (stronger
Rahul Santhanam, Ryan Williams 0001
openaire +1 more source
A non-uniform bound on Poisson approximation for a sum of negative binomial random variables [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2017 This paper uses the Stein–Chen method to determine a non-uniform bound on the point metric between the distribution of a sum of independent negative binomial random variables and a Poisson distribution with mean 1 n i i i r q , where r i
Kanint Teerapabolarn
doaj +1 more source
Asymptotic Sharpness of Bounds on Hypertrees
Discussiones Mathematicae Graph Theory, 2017 The hypertree can be defined in many different ways. Katona and Szabó introduced a new, natural definition of hypertrees in uniform hypergraphs and investigated bounds on the number of edges of the hypertrees.
Lin Yi, Kang Liying, Shan Erfang
doaj +1 more source