Related papers: The Moore Bound for Regular Simplicial Complexes

For a finite simple graph $G$ we give an upper bound for the regularity of the powers of the edge ideal $I(G)$.

Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree of regularity of a system of equations of the same degree,…

Linear upper bounds may be derived by imposing specific structural conditions on a generating set, such as additional constraints on ranks, eigenvalues, or the degree of the minimal polynomial of the generating matrices. This paper…

We establish a lower bound on the complexity orientable locally orientable geometric 3-orbifolds in terms of Delzant's T-invariants of their orbifold-fundamental groups, generalizing previously known bounds for complexity of 3-manifolds.

We suggest a new possible high dimensional analogue to metric distortion. We then show a possible method for providing lower bounds to this distortion and use this method to prove a "Bourgain-type" distortion theorem for Linial-Meshulam…

If $X$ is a smooth curve such that the minimal degree of its plane models is not too small compared with its genus, then $X$ has been known to be a double cover of another smooth curve $Y$ under some mild condition on the genera. However…

Let $J\subsetneq I$ be two ideals of a polynomial ring $S$ over a field, generated by square free monomials. We show that some inequalities among the numbers of square free monomials of $I\setminus J$ of different degrees give upper bounds…

We provide polynomial upper bounds on the size of a shortest solution for quadratic equations in a free group. A similar bound is given for parametric solutions in the description of solutions sets of quadratic equations in a free group.

In this paper, we introduce the n-th discrete topological complexity and study its properties such as its relation with simplicial Lusternik-Schnirelmann category and how the higher dimensions of discrete topological complexity relate with…

In this note, we provide a wide range of upper bounds for the moduli of the zeros of a complex polynomial. The obtained bounds complete a series of previous papers on the location of zeros of polynomials.

We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of R^k, assuming that P is positive on the simplex. This bound depends only on the number…

We shall consider the regularity problem of solutions for complex Monge-Ampere equations. First we prove interior $C^2$ estimates of solutions in a bounded domain for complex Monge-Ampere equation with assumption of certain $L^p$ bound for…

In this paper, we provide the upper bound and the lower bound of the sum of the number of spherical face-partition pair of simple spherical polytope $P$ with $p$ facets.

We give lower and upper bounds on the Buchsbaum-Rim multiplicity of finitely generated torsion-free modules over two-dimensional regular local rings, and conditions for them to attain the bounds. As consequences, we have formulae on the…

Upper bounds on the minimum Lee distance of codes that are linear over ${\mathbb Z}_q$, $q=p^t$, $p$ prime are discussed. The bounds are Singleton like, depending on the length, rank, and alphabet size of the code. Codes meeting such bounds…

The orbital diameter of a primitive permutation group is the maximal diameter of its orbital graphs. There has been a lot of interest in bounds for the orbital diameter. In this paper we provide explicit bounds on the diameters of groups of…

The polynomials of degree $\frac{p-1}{2}$ of range sum $p$ was determined in {\tt arXiv:2311.06136 [math.NT]} for large enough primes. We extend this result by reducing the lower bound for the primes to $23$ by introducing a new and…

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional…

A meromorphic solution of a complex linear differential equation (with meromorphic coefficients) for which the value zero is the only possible finite deficient/deviated value is called a standard solution. Conditions for the existence and…