Related papers: Hybrid Pipe Dreams for Key Polynomials
Given two parallelisms of a projective space we describe a construction, called blending, that yields a (possibly new) parallelism of this space. For a projective double space $(\mathbb{P},\parallel_\ell,\parallel_r)$ over a quaternion skew…
The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and…
Based on the combinatorial description of the moduli spaces of curves provided by Strebel differentials, Witten and Kontsevich have introduced combinatorial cohomology classes $W_{(m_0,m_1,m_2,\dots),n}$, and conjectured that these can be…
Recently there has been a renewed interest in an extension of the notion of orthogonal polynomials known as multiple orthogonal polynomials. This notion comes from simultaneous rational approximation (Hermite-Pade approximation) of a system…
We propose a combinatorial interpretation of the coefficient of $q$ in Kazhdan- Lusztig polynomials and we prove it for finite simply-laced Weyl groups.
These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly…
In this article we will introduce the way to extend the mitosis algorithm for Schubert polynomials, developed by Ezra Miller, to the case of Grothendieck polynomials.
We develop certain combinatorial tools for the study of discriminants of general systems of polynomial equations. Applying these tools in a sequel paper, we completely classify components of such discriminants, generalizing the classical…
Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…
We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…
The ring of symmetric functions can be implemented in the homology of \union_{a,b} Gr(a,a+b), the multiplicative structure being defined from the "direct sum" map. There is a natural circle action (simultaneously on all Grassmannians) under…
A new version of the self-similarity spin transform on three-dimensional cubic lattices is proposed that makes possible calculation of nontrivial spin correlations in a "combinatorial" model, in which all permitted spin configurations have…
The kernel polynomial method allows to sample overall spectral properties of a quantum system, while sparse diagonalization provides accurate information about a few important states. We present a method combining these two approaches…
We give a combinatorial proof that Postnikov and Stanley's formula for dual Schubert polynomials in terms of weighted chains in Bruhat order is equivalent to a classical Cauchy identity for polynomials. This gives a natural interpretation…
We give a new description of the Pieri rule for k-Schur functions using the Bruhat order on the affine type-A Weyl group. In doing so, we prove a new combinatorial formula for representatives of the Schubert classes for the cohomology of…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
This paper reviews the construction of quantum field theory on a 4-dimensional spacetime by combinatorial methods, and discusses the recent developments in the direction of a combinatorial construction of quantum gravity.
The cuspidal cohomology groups of arithmetic groups in certain infinite dimensional Modules are computed. As a result we get a simultaneous generalization of the Patterson-Conjecture and the Lewis-Correspondence.
The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…
Exploiting the fact that the $q$-Whittaker polynomials arise as a specialization of the (modified) Macdonald polynomials, we derive some of their basic properties, and explore interesting identities that they satisfy. We also show how they…