Related papers: An upper bound for the minimum modulus in a coveri…

In this short note we revisit the upper bound of the asymptotic least density of covering codes of radius $R$ in $[q]^n$ established by Krivelevich, Sudakov, and Vu. We show that by using a slightly different optimization in their core…

We compute the minimal and the maximal bound on the number of generators of a minimal smooth monomial Togliatti system of forms of degree $d$ in $n+1$ variables, for any $d\ge 2$ and $n\geq 2$. We classify the Togliatti systems with number…

A conjecture of De Concini Kac and Procesi provides a bound on the minimal possible dimension of an irreducible module for quantized enveloping algebras at an odd root of unity. We pose the problem of the existence of modules whose…

We obtain an upper bound for the number of critical points of the systole function on $\mathcal{M}_g$. Besides, we obtain an upper bound for the number of those critical points whose systole is smaller than a constant.

We find upper bounds for the essential dimension of various moduli stacks of $\sln$-bundles over a curve. When $n$ is a prime power, our calculation computes the essential dimension of the stack of stable bundles exactly and the essential…

This paper gives a partial confirmation of a conjecture of P. Agarwal, S. Har-Peled, M. Sharir, and K. Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in the 3-dimensional Euclidean space…

Let $\epsilon > 0$ be sufficiently small and let $0 < \eta < 1/522$. We show that if $X$ is large enough in terms of $\epsilon$ then for any squarefree integer $q \leq X^{196/261-\epsilon}$ that is $X^{\eta}$-smooth one can obtain an…

We give upper bounds on the size of the gap between a non-zero constant term and the next non-zero Fourier coefficient of an entire level two modular form. We give upper bounds for the minimum positive integer represented by a level two…

A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…

The highest possible minimal norm of a unimodular lattice is determined in dimensions n <= 33. There are precisely five odd 32-dimensional lattices with the highest possible minimal norm (compared with more than 8*10^20 in dimension 33).…

For three dimensional complete Riemannian manifolds with scalar curvature no less than one, we obtain the sharp upper bound of complete stable minimal surfaces' diameter.

Given a $K$-vector space $V$, let $\sigma(V,K)$ denote the covering number, i.e. the smallest (cardinal) number of proper subspaces whose union covers $V$. Analogously, define $\sigma(M,R)$ for a module $M$ over a unital commutative ring…

The covering radius problem is a question in coding theory concerned with finding the minimum radius $r$ such that, given a code that is a subset of an underlying metric space, balls of radius $r$ over its code words cover the entire metric…

A classical problem in the literature seeks the minimal number of proper subgroups whose union is a given finite group. A different question, with applications to error-correcting codes and graph colorings, involves covering vector spaces…

Motivated by asymptotic phenomena of moduli spaces of higher rank stable sheaves on algebraic surfaces, we study the Picard number of the moduli space of one-dimensional stable sheaves supported in a sufficiently positive divisor class on a…

We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the number of edges tends to infinity.

We obtain lower bounds for the maximum dimension of a simple FG-module, where G is a finite group and F is an algebraically closed field of characteristic p. The bounds are described in terms of properties of p-subgroups of G. When p is 2…

We describe here, for the first time, a lower bound on the total number of fundamental constants required for a mathematical description of our physical universe to be complete. The answer is shown to be one. The formal arithmetized…

Let $n$ and $k$ be integers. A set $A\subset\mathbb{Z}/n\mathbb{Z}$ is $k$-free if for all $x$ in $A$, $kx\notin A$. We determine the maximal cardinality of such a set when $k$ and $n$ are coprime. We also study several particular cases and…

For a fixed singular modulus $\alpha$, we give an effective lower bound of norm of $x-\alpha$ for another singular modulus $x$ with large discriminant. We then generalize this result for $\Phi_m(x,\alpha)$, where $\Phi_m(X,Y) \in \Z[X,Y]$…