English
Related papers

Related papers: Higher Tur\'{a}n inequalities for the plane partit…

200 papers

We introduce a sequence $P_{2n}$ of monic reciprocal polynomials with integer coefficients having the central coefficients fixed. We prove that the ratio between number of nonunimodular roots of $P_{2n}$ and its degree $d$ has a limit when…

Number Theory · Mathematics 2019-10-23 Dragan Stankov

We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many infinite families of such pairs. We also show that the bounded height case can be reduced to checking that the conjecture…

Combinatorics · Mathematics 2009-09-29 Francois Bergeron , Riccardo Biagioli , Mercedes H. Rosas

The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We…

Combinatorics · Mathematics 2007-05-23 M. Beck , J. A. De Loera , M. Develin , J. Pfeifle , R. P. Stanley

Let $p(n)$ denote the partition function. DeSalvo and Pak proved that $\frac{p(n-1)}{p(n)}\left(1+\frac{1}{n}\right)> \frac{p(n)}{p(n+1)}$ for $n\geq 2$, as conjectured by Chen. Moreover, they conjectured that a sharper inequality…

Number Theory · Mathematics 2014-07-02 William Y. C. Chen , Larry X. W. Wang , Gary Y. B. Xie

MacMahon proved a simple product formula for the generating function of plane partitions fitting in a given box. The theorem implies a $q$-enumeration of lozenge tilings of a semi-regular hexagon on the triangular lattice. In this paper we…

Combinatorics · Mathematics 2017-04-12 Tri Lai

In recent literature concerning integer partitions one can find many results related to both the Bessenrodt-Ono type inequalities and log-concavity property. In this note we offer some general approach to this type of problems. More…

Number Theory · Mathematics 2023-12-25 Krystian Gajdzica , Piotr Miska , Maciej Ulas

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…

Combinatorics · Mathematics 2025-12-02 Christos A. Athanasiadis , Theo Douvropoulos , Katerina Kalampogia-Evangelinou

We present new, simple proofs for the enumeration of five of the ten symmetry classes of plane partitions contained in a given box. Four of them are derived from a simple determinant evaluation, using combinatorial arguments. The previous…

Combinatorics · Mathematics 2021-06-01 Mihai Ciucu , Christian Krattenthaler

In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…

Number Theory · Mathematics 2014-09-11 Olivia Beckwith , Christine Bessenrodt

Let $p_{k,3}(n)$ enumerate the number of 2-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $k$. In this paper, we prove several infinite families of congruences modulo powers of 3 for…

Combinatorics · Mathematics 2018-05-24 Dazhao Tang

In this paper we shall discuss local polynomial convexity at the origin of the union of finitely many totally-real planes through $0 \in\mathbb{C}^2$. The planes, say $P_0,..., P_N$, satisfy a mild transversality condition that enables us…

Complex Variables · Mathematics 2011-08-31 Sushil Gorai

Let $P_{d}(n)$ denote the number of $n \times \ldots \times n$ $d$-dimensional partitions with entries from $\left\{0,1,\ldots,n\right\}$. Building upon the works of Balogh-Treglown-Wagner and Noel-Scott-Sudakov, we show that when $d \to…

Combinatorics · Mathematics 2024-02-28 Cosmin Pohoata , Dmitriy Zakharov

Lasserre [La] proved that for every compact set $K\subset\mathbb R^n$ and every even number $d$ there exists a unique homogeneous polynomial $g_0$ of degree $d$ with $K\subset G_1(g_0)=\{x\in\mathbb R^n:g_0(x)\leq 1\}$ minimizing $|G_1(g)|$…

Functional Analysis · Mathematics 2021-07-26 David Alonso-Gutiérrez , Bernardo González Merino , Rafael Villa

In the eleventh paper in the series on MacMahons partition analysis, Andrews and Paule [1] introduced the $k$ elongated partition diamonds. Recently, they [2] revisited the topic. Let $d_k(n)$ count the partitions obtained by adding the…

Number Theory · Mathematics 2022-07-14 Nayandeep Deka Baruah , Hirakjyoti Das , Pranjal Talukdar

We address the following generalization $P$ of the Lowner-John ellipsoid problem. Given a (non necessarily convex) compact set $K\subset R^n$ and an even integer $d$, find an homogeneous polynomial $g$ of degree $d$ such that $K\subset…

Optimization and Control · Mathematics 2014-12-24 Jean-Bernard Lasserre

In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…

Number Theory · Mathematics 2015-03-17 Mohamed El Bachraoui

It has been conjectured by P\'{o}lya and Szeg\"{o} seventy years ago that the planar set which minimizes the first eigenvalue of the Dirichlet-Laplace operator among polygons with $n$ sides and fixed area is the regular polygon. Despite its…

Optimization and Control · Mathematics 2022-03-31 Beniamin Bogosel , Dorin Bucur

The enumeration $d_k(n)$ of $k$-elongated plane partition diamonds has emerged as a generalization of the classical integer partition function $p(n)$. We have discovered an infinite congruence family for $d_5(n)$ modulo powers of 5.…

Number Theory · Mathematics 2024-12-11 Koustav Banerjee , Nicolas Allen Smoot

Let $P$ be a set $n$ points in a $d$-dimensional space. Tverberg's theorem says that, if $n$ is at least $(k-1)(d+1)+1$, then $P$ can be partitioned into $k$ sets whose convex hulls intersect. Partitions with this property are called {\em…

Combinatorics · Mathematics 2020-02-25 Sergey Bereg , Mohammadreza Haghpanah

We show that a $d$-dimensional polyhedron $S$ in $\real^d$ can be represented by $d$-polynomial inequalities, that is, $S = \{x \in \real^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \}$, where $p_0,...,p_{d-1}$ are appropriate polynomials.…

Algebraic Geometry · Mathematics 2010-02-05 Gennadiy Averkov , Ludwig Bröcker