English
Related papers

Related papers: Probabilistic Entry Swapping Bijections for Non-At…

200 papers

We introduce bijections between generalized type $A_n$ noncrossing partitions (that is, associated to arbitrary standard Coxeter elements) and fully commutative elements of the same type. The latter index the diagram basis of the classical…

Combinatorics · Mathematics 2016-08-17 Thomas Gobet

The Jack polynomials with prescribed symmetry are obtained from the nonsymmetric polynomials via the operations of symmetrization, antisymmetrization and normalization. After dividing out the corresponding antisymmetric polynomial of…

Quantum Algebra · Mathematics 2009-11-07 P. J. Forrester , D. S. McAnally , Y. Nikoyalevsky

Another bijective proof of Stanley's hook-content formula for the generating function for semistandard tableaux of a given shape is given that does not involve the involution principle of Garsia and Milne. It is the result of a merge of the…

Combinatorics · Mathematics 2007-05-23 Christian Krattenthaler

We introduce a conjectural construction for an extension to superspace of the Macdonald polynomials. The construction, which depends on certain orthogonality and triangularity relations, is tested for high degrees. We conjecture a simple…

Mathematical Physics · Physics 2012-08-14 O. Blondeau-Fournier , P. Desrosiers , L. Lapointe , P. Mathieu

Theorems relating permutations with objects in other fields of mathematics are often stated in terms of avoided patterns. Examples include various classes of Schubert varieties from algebraic geometry (Billey and Abe 2013), commuting…

Combinatorics · Mathematics 2024-11-28 Henning Ulfarsson

We give the explicit analytic development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions. These expansions are obtained by inverting the Pieri formula. Specialization yields similar developments…

Combinatorics · Mathematics 2019-02-22 Michel Lassalle , Michael Schlosser

The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…

Complex Variables · Mathematics 2025-02-11 Pratap Basak , Sanjay Mallick

To every Poisson algebraic variety X over an algebraically closed field of characteristic zero, we canonically attach a right D-module M(X) on X. If X is affine, solutions of M(X) in the space of algebraic distributions on X are Poisson…

Symplectic Geometry · Mathematics 2010-12-24 Pavel Etingof , Travis Schedler , Ivan Losev

In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals…

Combinatorics · Mathematics 2008-03-10 Arun Ram , Martha Yip

A theory of matchings for finite subsets of an abelian group, introduced in connection with a conjecture of Wakeford on canonical forms for homogeneous polynomials, has since been extended to the setting of field extensions and to that of…

Combinatorics · Mathematics 2026-02-03 Mohsen Aliabadi , Jozsef Losonczy

We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…

Combinatorics · Mathematics 2019-09-16 Greg Kuperberg , Shachar Lovett , Ron Peled

To any poset or quasi-poset is attached a lattice polytope, whose Ehrhart polynomial we study from a Hopf-algebraic point of view. We use for this two interacting bialgebras on quasi-posets. The Ehrhart polynomial defines a Hopf algebra…

Rings and Algebras · Mathematics 2016-11-15 Loïc Foissy

We present a new formula of Cauchy type for the nonsymmetric Macdonald polynomials which are joint eigenfunctions of q-Dunkl operators. This gives the explicit formula for a reproducing kernel on the polynomial ring of n variables.

q-alg · Mathematics 2008-02-03 K. Mimachi , M. Noumi

The Principle of Complementarity of Probabilities based on of noncommutative probability is introduced.

Quantum Physics · Physics 2011-05-10 Andrei Khrennikov , Sergei Kozyrev

The interior polynomial was originally defined for hypergraphs and later shown to coincide with the Ehrhart polynomial of the root polytope of an associated bipartite graph. In previous work, we derived an alternating cycle recursion…

Combinatorics · Mathematics 2025-06-04 Keiju Kato

Previous work of Ayyer, Martin, and Williams gave a probabilistic interpretation of the Macdonald polynomials $P_{\lambda}(x_1,\dots,x_n;1,t)$ at $q=1$ in terms of a Markov chain called the multispecies $t$-Push TASEP, a Markov chain…

Combinatorics · Mathematics 2026-02-17 Houcine Ben Dali , Lauren Williams

In combinatorial problems it is sometimes possible to define a $G$-equivariant mapping from a space $X$ of configurations of a system to a Euclidean space $\mathbb{R}^m$ for which a coincidence of the image of this mapping with an…

Algebraic Topology · Mathematics 2008-07-10 Pavle V. M. Blagojevic , Aleksandra S. Dimitrijevic Blagojevic , John McCleary

For an integer $m\geq 1$, a combinatorial manifold $\widetilde{M}$ is defined to be a geometrical object $\widetilde{M}$ such that for $\forall p\in\widetilde{M}$, there is a local chart $(U_p,\phi_p)$ enable $\phi_p:U_p\to…

General Mathematics · Mathematics 2007-05-23 Linfan Mao

We consider symmetric polynomials, p, in the noncommutative free variables (x_1, x_2, ..., x_g). We define the noncommutative complex hessian of p and we call a noncommutative symmetric polynomial noncommutative plurisubharmonic if it has a…

Operator Algebras · Mathematics 2011-01-17 Jeremy M. Greene , J. William Helton , Victor Vinnikov

The motivating question for this work is a long standing open problem, posed by Nisan (1991), regarding the relative powers of algebraic branching programs (ABPs) and formulas in the non-commutative setting. Even though the general question…

Computational Complexity · Computer Science 2021-03-02 Prerona Chatterjee