Related papers: Boolean product polynomials, Schur positivity, and…

It does not seem to have been observed previously that the classical Bernstein polynomials $B_N(f)(x)$ are closely related to the Bergman-Szego kernels $\Pi_N$ for the Fubini-Study metric on $\CP^1$: $B_N(f)(x)$ is the Berezin symbol of the…

A set of functions is defined which is indexed by a positive integer $n$ and partitions of integers. The case $n=1$ reproduces the standard Schur polynomials. These functions are seen to arise naturally as a determinant of an action on the…

Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and R\'onyai proved that if the graph of a polynomial contains $cn^2$ points of an…

We introduce the binomial-Stirling-Eulerian polynomials, denoted $\tilde{A}_n(x,y|{\alpha})$, which encompass binomial coefficients, Eulerian numbers and two Stirling statistics: the left-to-right minima and the right-to-left minima. When…

Given an identity relating families of Schur and power sum symmetric functions, this may be thought of as encoding representation-theoretic properties according to how the $p$-to-$s$ transition matrices provide the irreducible character…

We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

Schur's theorem states that in any $k$-colouring of the set of integers $[n]$ there is a monochromatic solution to $a+b=c$, provided $n$ is sufficiently large. Abbott and Wang studied the size of the largest subset of $[n]$ such that there…

In this paper we initiate the study of products and sums divisible by central binomial coefficients. We show that 2(2n+1)binom(2n,n)| binom(6n,3n)binom(3n,n) for every n=1,2,3,... Also, for any nonnegative integers $k$ and $n$ we have…

We give a Molev-Sagan type formula for computing the product $\mathfrak{S}_u(x;y)\mathfrak{S}_v(x;z)$ of two double Schubert polynomials in different sets of coefficient variables where the descents of $u$ and $v$ satisfy certain conditions…

The main purpose of this paper is to show that the multiplication of a Schubert polynomial of finite type $A$ by a Schur function, which we refer to as Schubert vs. Schur problem, can be understood from the multiplication in the space of…

Let X be a very general Debarre-Voisin fourfold. In this article, we prove that all the Schur functors of the restriction of the quotient bundle of Gr(6,10) to X are modular and polystable vector bundles. We also show that such bundles are…

For a smooth Deligne-Mumford stack X we describe a large number of inertial products on K(IX) and A*(IX) and corresponding inertial Chern characters. We do this by developing a theory of inertial pairs. Each inertial pair determines an…

Let $X$ be a compact connected Riemann surface of genus $g\geq 0$, and let ${\rm Sym}^d(X)$, $d \ge 1$, denote the $d$-fold symmetric product of $X$. We show that ${\rm Sym}^d(X)$ admits a Hermitian metric with negative Chern scalar…

Rado's theorem about permutahedra and dominance order on partitions reveals that each Schur polynomial is M-convex, or equivalently, it has a saturated Newton polytope and this polytope is a generalized permutahedron as well. In this paper…

We prove several theorems concerning arithmetic properties of Stern polynomials defined in the following way: $B_{0}(t)=0, B_{1}(t)=1, B_{2n}(t)=tB_{n}(t)$, and $B_{2n+1}(t)=B_{n}(t)+B_{n+1}(t)$. We study also the sequence…

We construct linear operators factorizing the three bases of symmetric polynomials: monomial symmetric functions m(x), elementary symmetric polynomials E(x), and Schur functions s(x), into products of univariate polynomials.

Given two m x n matrices A = (a_{ij}) and B=(b_{ij}) with entries in B(H), the Schur block product is the m x n matrix A \square B := (a_{ij}b_{ij}). There exists an m x n contraction matrix S = (s_{ij}), such that A \square B =…

A combinatorial expression for the coefficient of the Schur function $s_{\lambda}$ in the expansion of the plethysm $p_{n/d}^d \circ s_{\mu}$ is given for all $d$ dividing $n$ for the cases in which $n=2$ or $\lambda$ is rectangular. In…

We prove that every supersymmetric Schur polynomial has a saturated Newton polytope (SNP). Our approach begins with a tableau-theoretic description of the support, which we encode as a polyhedron with a totally unimodular constraint matrix.…