Related papers: Towards a CFSG-free diameter bound for $\mathrm{Al…

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…

Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number $n_g$ of numerical…

What minimum degree of a graph $G$ on $n$ vertices guarantees that the union of $G$ and a random $2$-factor (or permutation) is with high probability Hamiltonian? Gir\~ao and Espuny D{\'\i}az showed that the answer lies in the interval…

In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…

We provide a sharp lower bound for the perimeter of the inner parallel sets of a convex body $\Omega$. The bound depends only on the perimeter and inradius $r$ of the original body and states that \[|\partial\Omega_t| \geq…

Let n_g denote the number of numerical semigroups of genus g. Bras-Amoros conjectured that n_g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree.…

Suppose $G$ is a free product $G = A_1 * A_2* \cdots * A_k * F_N$, where each of the groups $A_i$ is torsion-free and $F_N$ is a free group of rank $N$. Let $\mathcal{O}$ be the deformation space associated to this free product…

A weight-$t$ halfspace is a Boolean function $f(x)=$sign$(w_1 x_1 + \cdots + w_n x_n - \theta)$ where each $w_i$ is an integer in $\{-t,\dots,t\}.$ We give an explicit pseudorandom generator that $\delta$-fools any intersection of $k$…

We prove the first robust dimension free isoperimetric result for the standard Gaussian measure $\gamma_n$ and the corresponding boundary measure $\gamma_n^+$ in $\mathbb {R}^n$. The main result in the theory of Gaussian isoperimetry…

A problem of practical and theoretical interest is to determine or estimate the diameter of various families of Cayley networks. The previously known estimate for the diameter of Cayley graphs generated by transposition trees is an upper…

In a seminal paper, Alon and Tarsi have introduced an algebraic technique for proving upper bounds on the choice number of graphs (and thus, in particular, upper bounds on their chromatic number). The upper bound on the choice number of $G$…

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Non-asymptotic bounds for Gaussian and bootstrap approximation have recently attracted significant interest in high-dimensional statistics. This paper studies Berry-Esseen bounds for such approximations with respect to the multivariate…

The minimal degree of a permutation group $G$ is the minimum number of points not fixed by non-identity elements of $G$. Lower bounds on the minimal degree have strong structural consequences on $G$. Babai conjectured that if a primitive…

Let M(n, d) be the maximum size of a permutation array on n symbols with pairwise Hamming distance at least d. We use various combinatorial, algebraic, and computational methods to improve lower bounds for M(n, d). We compute the Hamming…

We present a strengthening of the lemma on the lower bound of the slice rank by Tao (2016) motivated by the Croot-Lev-Pach-Ellenberg-Gijswijt bound on cap sets (2017, 2017). The Croot-Lev-Pach-Ellenberg-Gijswijt method and the lemma of Tao…

We prove two assumptions made in an article by Ya.A. Butko, M. Grothaus, O.G. Smolyanov concerning the existence of a strongly continuous operator semigroup solving a Cauchy-Dirichlet problem for an elliptic differential operator in a…

Let $\delta_{g,n}$ be the minimal dilatation of pseudo-Anosovs defined on an orientable surface of genus $g$ with $n$ punctures. Tsai proved that for any fixed $g \ge 2$, the logarithm of the minimal dilatation $\log \delta_{g,n}$ is on the…

We consider the top tree compression scheme introduced by Bille et al. [ICALP 2013] and construct an infinite family of trees on $n$ nodes labeled from an alphabet of size $\sigma$, for which the size of the top DAG is…

We consider approximation of diameter of a set $S$ of $n$ points in dimension $m$. E$\tilde{g}$ecio$\tilde{g}$lu and Kalantari \cite{kal} have shown that given any $p \in S$, by computing its farthest in $S$, say $q$, and in turn the…