Related papers: Lattice points and simultaneous core partitions

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

We decompose the indicator function of each $(a, b)$-Catalan matroid polytope as a weighted sum of indicator function of matroid polytopes that correspond to direct sums of uniform matroids. Catalan matroids lie in the interior of the…

The purpose of this paper is to combine classical methods from transcendental number theory with the technique of restriction to real scalars. We develop a conceptual approach relating transcendence properties of algebraic groups to results…

Let $D=(V,A)$ be a digraph whose underlying undirected graph is $2$-edge-connected, and let $P$ be the polytope whose vertices are the incidence vectors of arc sets whose reversal makes $D$ strongly connected. We study the lattice theoretic…

We compute the asymptotics of the number of integral quadratic forms with prescribed orthogonal decompositions and, more generally, the asymptotics of the number of lattice points lying in sectors of affine symmetric spaces. A new key…

There is a well-studied correspondence by Jaclyn Anderson between partitions that avoid hooks of length s or t and certain binary strings of length s+t. Using this map, we prove that the total size of a random partition of this kind…

The Ehrhart quasipolynomial of a rational polytope $\mathsf{P}$ encodes fundamental arithmetic data of $\mathsf{P}$, namely, the number of integer lattice points in positive integral dilates of $\mathsf{P}$. Ehrhart quasipolynomials were…

Recent work of the first author, Negut and Rasmussen, and of Oblomkov and Rozansky in the context of Khovanov--Rozansky knot homology produces a family of polynomials in $q$ and $t$ labeled by integer sequences. These polynomials can be…

The Littlewood decomposition for partitions is a well-known bijection between partitions and pairs of $t$-core and $t$-quotient partitions. This decomposition can be described in several ways, such as the $t$-abacus method of James or the…

Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property,…

We classify, up to some lattice-theoretic equivalence, all possible configurations of rational double points that can appear on a surface whose minimal resolution is a complex Enriques surface.

In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…

In a previous paper (arXiv:1608.02262), we used computer-assisted methods to find explicit expressions for the moments of the size of a uniform random (n,n+1)-core partition with distinct parts. In particular, we conjectured that the…

We introduce the higher rank $(q,t)$-Catalan polynomials and prove they equal truncations of the Hikita polynomial to a finite number of variables. Using affine compositions and a certain standardization map, we define a dinv statistic on…

The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corputs's theorem on arithmetic progressions of length $3$) with well-known tools and theorems for…

We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…

We prove the algorithmic canonicity of two classes of $\mu$-inequalities in a constructive meta-theory of normal lattice expansions. This result simultaneously generalizes Conradie and Craig's canonicity for $\mu$-inequalities based on a…

In the present paper, we give Assmus--Mattson type theorems for codes and lattices. We show that a binary doubly even self-dual code of length 24m with minimum weight 4m provides a combinatorial 1-design and an even unimodular lattice of…