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

For an integral convex polytope $\mathcal{P} \subset \mathbb{R}^d$, we recall $L_\mathcal{P}(n)=|n\mathcal{P} \cap \mathbb{Z}^d|$ the Ehrhart polynomial of $\mathcal{P}$. Let $g_r(\mathcal{P})$ be the $r$th coefficients of…

Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which…

In recent years, the log-concavity or log-convexity of combinatorial sequences and their root sequences, higher order Tur{\'a}n inequalities, and Laguerre inequalities of order two have been widely studied. However, the research of the…

Motivated by the Nekrasov-Okounkov formula on hook lengths, the first author conjectured that the Plancherel average of the $2k$-th power sum of hook lengths of partitions with size $n$ is always a polynomial of $n$ for any $k\in…

We propose an efficient algorithm to compute the real roots of a sparse polynomial $f\in\mathbb{R}[x]$ having $k$ non-zero real-valued coefficients. It is assumed that arbitrarily good approximations of the non-zero coefficients are given…

In 1939 P. Tur\'an started to derive lower estimations on the norm of the derivatives of polynomials of (maximum) norm 1 on $I:=[-1,1]$ (interval) and $D:=\{z\in\mathbb{C}~:~|z|\le 1\}$ (disk), under the normalization condition that the…

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

We prove that for all natural numbers k,n,d with k <= d and every partition lambda of size kn with at most k parts there exists an irreducible GL(d, C)-representation of highest weight 2*lambda in the plethysm Sym^k(Sym^(2n) (C^d)). This…

Let $ES_{\ell}(n)$ be the minimum $N$ such that every $N$-element point set in the plane contains either $\ell$ collinear members or $n$ points in convex position. We prove that there is a constant $C>0$ such that, for each $\ell, n \ge 3$,…

A conjecture widely attributed to Neumann is that all finite non-desarguesian projective planes contain a Fano subplane. In this note, we show that any finite projective plane of even order which admits an orthogonal polarity contains a…

Let $\mathrm{pod}(n)$ denote the number of partitions of $n$ with odd parts distinct, and ${{r}_{k}}(n)$ be the number of representations of $n$ as sum of $k$ squares. We find the following two arithmetic relations: for any integer $n\ge…

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

We prove that a complete family of linearly non-degenerate rational curves of degree $e > 2$ in $\mathbb{P}^n$ has at most $n-1$ moduli. For $e = 2$ we prove that such a family has at most $n$ moduli. It is unknown whether or not this is…

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

We study a set of topological roots of the local Bernstein-Sato polynomial of arbitrary plane curve singularities. These roots are characterized in terms of certain divisorial valuations and the numerical data of the minimal log resolution.…

Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…

In 2007, Andrews and Paule introduced the broken $k$-diamond partition function $\Delta_k(n)$, which has received a lot of researches on the arithmetic propertises. In this paper, we prove that $D^3\log \Delta_1(n-1)>0$ for $n\geq 5$ and…

For each $n\geq 1$, we express the partition function $p(n)$ as a CM trace on $X_0(6)$ of the discriminant $\Delta_n:=1-24n$ invariants of a weight 0 weak Maass function $P$ that records where CM elliptic curves sit on $X(1)$, together with…

We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…