Related papers: Shattering bounds for tuple systems

An explicit upper bound for the Weil-Petersson volumes of the moduli spaces of punctured Riemann surfaces is obtained, using Penner's combinatorial integration scheme with embedded trivalent graphs. It is shown that for a fixed number of…

Quasi one-dimensional systems are systems of particles in domains which are of infinite extent in one direction and of uniformly bounded size in all other directions, e.g. on a cylinder of infinite length. The main result proven here is…

Let $M(n,d)$ be the maximum size of a permutation array on $n$ symbols with pairwise Hamming distance at least $d$. Some permutation arrays can be constructed using blocks of certain type [2] called product blocks in this paper. We study…

In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum $P_1+\dots+P_d$ of $d$-dimensional lattice polytopes is bounded from above by a…

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through…

We obtain two sided estimates for the Bures volume of an arbitrary subset of the set of $N\times N$ density matrices, in terms of the Hilbert-Schmidt volume of that subset. For general subsets, our results are essentially optimal (for large…

We find an upper bound for the sum $\sum_{x<n\leq 2x}\textbf{1}_{\mathbb{P}}(n+h_{i_{1}})\cdots\textbf{1}_{\mathbb{P}}(n+h_{i_{m+1}})w_{n}$, where $(h_{i_{1}},...,h_{i_{m+1}})$ is any $(m+1)$-tuple of elements in the admissible set…

A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. A function is a pebbling threshold for a sequence of graphs if a randomly chosen…

We study a decay rate asymmetry of the top quark in the supersymmetric standard model, taking into account the constraints from the electric dipole moments of the neutron and the electron. One CP-violating phase contained in the…

In this paper, we prove a new point-sphere incidence bound in vector spaces over finite fields. More precisely, let $P$ be a set of points and $S$ be a set of spheres in $\mathbb{F}_q^d$. Suppose that $|P|, |S|\le N$, we prove that the…

We give a method for computing upper and lower bounds for the volume of a non-obtuse hyperbolic polyhedron in terms of the combinatorics of the 1-skeleton. We introduce an algorithm that detects the geometric decomposition of good…

We improve the best known upper bound for the bracketing number of $d$-dimensional axis-parallel boxes anchored in $0$ (or, put differently, of lower left orthants intersected with the $d$-dimensional unit cube $[0,1]^d$). More precisely,…

Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…

In this entry point into the subject, combining two elementary proofs, we decrease the gap between the upper and lower bounds by $0.2\%$ in a classical combinatorial number theory problem. We show that the maximum size of a Sidon set of $\{…

The point selection theorem says that the convex hull of any finite point set contains a point that lies in a positive proportion of the simplices determined by that set. This paper proves several new volumetric versions of this theorem…

Motivated by juggling sequences and bubble sort, we examine permutations on the set {1,2,...,n} with d descents and maximum drop size k. We give explicit formulas for enumerating such permutations for given integers k and d. We also derive…

In this work, we systematically study the heavy baryonium and heavy dibaryon systems using the Bethe-Salpeter equation in the ladder and instantaneous approximations for the kernel. Our results indicate that all the heavy baryonium systems,…

For years limited Monte Carlo simulations have led to the suspicion that the time to failure of hierarchically organized load-transfer models of fracture is non-zero for sets of infinite size. This fact could have a profound significance in…

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 compute explicitly the limits of tangents of a quasi-ordinary singularity in terms of its special monomials. We show that the set of limits of tangents of Y is essentially a topological invariant of Y .