Related papers: Minor summation formula and a proof of Stanley's o…
A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…
The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they are equivalent to creation operators…
Let $a > 1$. Then $a^n < n!$ for some positive integer $n$. We show that the smallest such $n$ is one of a pair of possibilities, or is one possibility, which we show how to calculate. There are three interesting numerical sequences which…
The aim of this note is to give some factorization formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing those existing for Hall-Littlewood functions.
The Deligne-Simpson problem (DSP) (resp. the weak DSP) is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ or $c_j\subset gl(n,{\bf C})$ so that there…
We offer a proof of a summation formula equivalent to one due to Berndt. Our proof uses the M$\ddot{u}$ntz formula and the Poisson summation formula. By utilizing known properties of Mellin inversion, we give an example from a discontinuous…
We discuss the problem of factorisation of the symmetric Macdonald polynomials and present the obtained results for the cases of 2 and 3 variables.
Closed forms for $f_{\lambda,i} (q) := \sum_{\tau \in SYT(\lambda) : des(\tau) = i} q^{maj(\tau)}$, the distribution of the major index over standard Young tableaux of given shapes and specified number of descents, are established for a…
In his paper, "On a Partition Function of Richard Stanley," George Andrews proves a certain partition identity analytically and asks for a combinatorial proof. This paper provides the requested combinatorial proof.
We consider the Stokes eigenvalue problem in open balls and open annuli in R3 with homogeneous Dirichlet boundary conditions. Using the frame of toroidal and poloidal fields we construct the othogonal decomposition of the Stokes eigenvalue…
The aim of this short note is to provide a proof to a statement of Sierpi\'nski concerning the number of possible sums of a series (of type $\lambda<\aleph_1$) of arbitrary ordinal numbers.
The quest to build a mass formula which have in it the most relevant microscopic contributions is analyzed. Inspired in the successful Duflo-Zuker mass description, the challenges to describe the shell closures in a more transparent but…
In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz by using multi-Schur…
We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.
Let $I\supsetneq J$ be two monomial ideals of a polynomial algebra over a field generated in degree $\geq d$, resp. $\geq d+1$ . We study when the Stanley Conjecture holds for $I/J$ using the recent result of \cite{IKM} concerning the…
A new type of sl_3 basic hypergeometric series based on Macdonald polynomials is introduced. Besides a pair of Macdonald polynomials attached to two different sets of variables, a key-ingredient in the sl_3 basic hypergeometric series is a…
We define a new family of symmetric functions which are affine analogues of Stanley symmetric functions. We establish basic properties of these functions including symmetry, dominance and conjugation. We conjecture certain positivity…
We relate the combinatorial definitions of the type $A_n$ and type $C_n$ Stanley symmetric functions, via a combinatorially defined "double Stanley symmetric function," which gives the type $A$ case at $(\mathbf{x},\mathbf{0})$ and gives…
Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…
Let $\Lambda$ be the space of symmetric functions and $V_k$ be the subspace spanned by the modified Schur functions $\{S_\lambda[X/(1-t)]\}_{\lambda_1\leq k}$. We introduce a new family of symmetric polynomials,…