Related papers: Matching polytopes and Specht modules
We give a formula for counting tree modules for the quiver S_g with g loops and one vertex in terms of tree modules on its universal cover. This formula, along with work of Helleloid and Rodriguez-Villegas, is used to show that the number…
We obtain a new formula to relate the value of a Schur polynomial with variables $(x_1,\ldots,x_N)$ with values of Schur polynomials at $(1,\ldots,1)$. This allows to study the limit shape of perfect matchings on a square hexagon lattice…
Dipper, James and Murphy generalized the classical Specht module theory to Hecke algebras of type $B_n$. On the other hand, for any choice of a monomial order on the parameters in type $B_n$, we obtain corresponding Kazhdan--Lusztig cell…
A new descent set statistic on involutions, defined geometrically via their interpretation as matchings, is introduced in this paper, and shown to be equi-distributed with the standard one. This concept is then applied to construct explicit…
In this paper we provide an up-to-date survey on the study of Lipschitz equivalence of self-similar sets. Lipschitz equivalence is an important property in fractal geometry because it preserves many key properties of fractal sets. A…
We introduce Lipschitz functions on a finite partially ordered set $P$ and study the associated Lipschitz polytope $L(P)$. The geometry of $L(P)$ can be described in terms of descent-compatible permutations and permutation statistics that…
Let $T$ be a tree on $n$ vertices with $q$-Laplacian $L_T^q$ and Laplacian matrix $L_T$. Let $GTS_n$ be the generalized tree shift poset on the set of unlabelled trees on $n$ vertices. Inequalities are known between coefficients of the…
The solution of Shareshian-Wachs conjecture by Brosnan-Chow and Guay-Paquet tied the graded chromatic symmetric functions on indifference graphs (or unit interval graphs) and the cohomology of regular semisimple Hessenberg varieties with…
We prove a conjecture of Cuttler et al.~[2011] [A. Cuttler, C. Greene, and M. Skandera; \emph{Inequalities for symmetric means}. European J. Combinatorics, 32(2011), 745--761] on the monotonicity of \emph{normalized Schur functions} under…
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…
We give an algebraic description of several modules and algebras related to the vector partition function, and we prove that they can be realized as the equivariant K-theory of some manifolds that have a nice combinatorial description. We…
We begin by deriving an action of the 0-Hecke algebra on standard reverse composition tableaux and use it to discover 0-Hecke modules whose quasisymmetric characteristics are the natural refinements of Schur functions known as…
Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We…
For a given graph $G$, we construct an associated commutative algebra, whose dimension is equal to the number of $t$-labeled forests of $G$. We show that the dimension of the $k$-th graded component of this algebra also has a combinatorial…
Divided symmetrization of a function $f(x_1,\dots,x_n)$ is symmetrization of the ratio $$DS_G(f)=\frac{f(x_1,\dots,x_n)}{\prod (x_i-x_j)},$$ where the product is taken over the set of edges of some graph $G$. We concentrate on the case when…
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.…
We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and,…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
The generators of the classical Specht module satisfy intricate relations. We introduce the Specht matroid, which keeps track of these relations, and the Specht polytope, which also keeps track of convexity relations. We establish basic…
We discover a modular property of supersymmetric partition functions of supersymmetric theories with R-symmetry in four dimensions. This modular property is, in a sense, the generalization of the modular invariance of the supersymmetric…