Related papers: Independent sets in the discrete hypercube

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

Let $d \geq 3$ be an integer. It is known that the number of edges of the edge polytope of the complete graph with $d$ vertices is $d(d-1)(d-2)/2$. In this paper, we study the maximum possible number $\mu_d$ of edges of the edge polytope…

Labourie and the author independently showed that a convex real projective structure on an oriented surface of genus at least 2 is equivalent to a conformal structure plus a holomorphic cubic differential U. We analyze the behavior of the…

A discrete d-manifold is a finite simple graph G=(V,E) where all unit spheres are (d-1)-spheres. A d-sphere is a d-manifold for which one can remove a vertex to make it contractible. A graph is contractible if one can remove a vertex with…

We continue the study of positive singular solutions of PDEs arising from double phase functionals started in [6]. In particular, we consider the case $p<q < 2$, and we relax the assumption on the capacity of the singular set using an…

In the paper we partially solved the problem of the distribution of the discriminants of integral polynomials in the cubic case. We proved the asymptotic formula for the number of integral cubic polynomials having bounded height and bounded…

We show that infinitely many cubic fields have class group of 2-rank 1.

In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional…

Motivated by the known autocorrelation properties of the Rudin-Shapiro sequence, we study the discrete correlation among infinite sequences over a finite alphabet, where we just take into account whether two symbols are identical. We show…

In this note, we show that the exceptional algebraic set of an infinite discrete group in $PSL(3,\Bbb{C})$ should be a finite union of complex lines, copies of the Veronese curve or copies of the cubic $xy^2-z^3$.

In the first part of this work we provide a formula for the number of edges of the Hasse diagram of the independent subsets of the h-th power of a path ordered by inclusion. For h=1 such a value is the number of edges of a Fibonacci cube.…

Given a smooth cubic hypersurface $X$ over a finite field of characteristic greater than 3 and two generic points on $X$, we use a function field analogue of the Hardy-Littlewood circle method to obtain an asymptotic formula for the number…

The Vapnik-Chervonenkis (VC) dimension of a collection of subsets of a set is an important combinatorial concept in settings such as discrete geometry and machine learning. In this paper we prove that the VC dimension of the family of…

We consider finite dimensional representations of the dihedral group $D_{2p}$ over an algebraically closed field of characteristic two where $p$ is an odd integer and study the degrees of generating and separating polynomials in the…

As was pointed out by Nikulin [8] and Vinberg [10], a right-angled polyhedron of finite volume in hyperbolic n-space $\mathbb{H}^n$ has at least one cusp for $n\geq 5$. We obtain non-trivial lower bounds on the number of cusps of such…

We consider a system of $R$ cubic forms in $n$ variables, with integer coefficients, which define a smooth complete intersection in projective space. Provided $n\geq 25R$, we prove an asymptotic formula for the number of integer points in…

A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…

We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of d-regular graphs. For independent sets, this theorem is a strengthening of the results of Kahn, Galvin and Tetali, and Zhao showing…

In this note we prove that the number of combinatorial types of $d$-polytopes with $d+1+\alpha$ vertices and $d+1+\beta$ facets is bounded by a constant independent of $d$.

We consider two and three-dimensional quantum billiards with discrete symmetries. We derive the first terms of the Weyl expansion for the level density projected onto the irreducible representations of the symmetry group. As an illustration…