Related papers: The Moore Bound for Regular Simplicial Complexes

We investigate the $L_p \mapsto L_q$ boundedness of the Fourier multipliers. We obtain sufficient conditions, namely, we derive Hormander and Lizorkin type theorems. We also obtain the necessary conditions. For $M$-generalized monotone…

We define upper bound and lower bounds for order-preserving homogeneous of degree one maps on a proper closed cone in $\R^n$ in terms of the cone spectral radius. We also define weak upper and lower bounds for these maps. For a proper…

We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds…

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

We give topological lower bounds on the number of periodic and closed trajectories in strictly convex smooth billiards. We use variational reduction admitting a finite group of symmetries and apply topological approach based on equivariant…

Meromorphic solutions of autonomous nonlinear ordinary differential equations are studied. An algorithm for constructing meromorphic solutions in explicit form is presented. General expressions for meromorphic solutions (including rational,…

Verifying a conjecture of Gromov we establish a generalized Margulis Lemma for manifolds with lower Ricci curvature bound. Among the various applications are finiteness results for fundamental groups of compact $n$-manifolds with upper…

Addressing a question of Gowers, we determine the order of the tower height for the partition size in a version of Szemer\'edi's regularity lemma.

The main goal of this paper is to obtain upper bounds for the regularity of graded deficiency modules in the spirit of the one obtained by Kumini--Murai in the monomial case building upon the spectral sequence formalism developed by…

We compute the Hilbert coefficients of a graded module with pure resolution and discuss lower and upper bounds for these coefficients for arbitrary graded modules.

We obtain bounded for all $t$ solutions of ordinary differential equations as limits of the solutions of the corresponding Dirichlet problems on $(-L,L)$, with $L \rightarrow \infty$. We derive a priori estimates for the Dirichlet problems,…

This paper provides a general result on controlling local Rademacher complexities, which captures in an elegant form to relate the complexities with constraint on the expected norm to the corresponding ones with constraint on the empirical…

We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and…

For small odd primes $p$, we prove that most of the rational points on the modular curve $X_0(p)/w_p$ parametrize pairs of elliptic curves having infinitely many supersingular primes. This result extends the class of elliptic curves for…

We establish upper bounds for shifted moments of modular $L$-functions to a fixed modulus as well as quadratic twists of modular $L$-functions under the generalized Riemann hypothesis. Our results are then used to establish bounds for…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Separation bounds are a fundamental measure of the complexity of solving a zero-dimensional system as it measures how difficult it is to separate its zeroes. In the positive dimensional case, the notion of reach takes its place. In this…

Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an explicit and constructive manner and apply them, through computer…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…