Results 31 to 40 of about 1,275,089 (180)
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
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
Uniform bounds for bounded geodesic image theorems [PDF]
Journal für die reine und angewandte Mathematik (Crelles Journal), 2013 Abstract We give a universal bound for the bounded geodesic image theorem of Masur–Minsky. The proof uses elementary techniques. We also give a universal bound for a stronger version of subsurface projection, this demonstrates good control over many standard subsurface projections simultaneously.
openaire +2 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
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
Plasmonic Jackiw-Rebbi Modes in Graphene Waveguide Arrays
Applied Sciences, 2019 We investigate the topological bound modes of surface plasmon polaritons (SPPs) in a graphene pair waveguide array. The arrays are with uniform inter-layer and intra-layer spacings but the chemical potential of two graphene in each pair are different ...
Chunyan Xu +5 more
doaj +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
Smoothing metrics on closed Riemannian manifolds through the Ricci flow
, 2011 Under the assumption of the uniform local Sobolev inequality, it is proved that Riemannian metrics with an absolute Ricci curvature bound and a small Riemannian curvature integral bound can be smoothed to having a sectional curvature bound.
Yang, Yunyan
core +1 more source
IEEE Access, 2019 A novel control scheme, namely adaptive-adaptive robust (A2R) control is proposed for motion control of mechanical systems. The system contains uncertainty which is bounded while the bound may be unknown. Two designs of robust controls are proposed, with
Qinqin Sun +3 more
doaj +1 more source