English
Related papers

Related papers: The monoid representation of upho posets and total…

200 papers

Upper homogeneous finite type (upho) posets are a large class of partially ordered sets with the property that the principal order filter at every vertex is isomorphic to the whole poset. Well-known examples include k-array trees, the grid…

Combinatorics · Mathematics 2020-11-04 Yibo Gao , Joshua Guo , Karthik Seetharaman , Ilaria Seidel

A poset is called upper homogeneous (or "upho") if every principal order filter of the poset is isomorphic to the whole poset. We observe that the rank and characteristic generating functions of upho posets are multiplicative inverses of…

Combinatorics · Mathematics 2022-06-06 Sam Hopkins

The question of which functions acting entrywise preserve positive semidefiniteness has a long history, beginning with the Schur product theorem [Crelle 1911], which implies that absolutely monotonic functions (i.e., power series with…

Classical Analysis and ODEs · Mathematics 2023-09-07 Prateek Kumar Vishwakarma

The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…

Representation Theory · Mathematics 2019-02-27 Vyacheslav Futorny , Kostiantyn Iusenko

The machinery of noncommutative Schur functions is a general approach to Schur positivity of symmetric functions initiated by Fomin-Greene. Hwang recently adapted this theory to posets to give a new approach to the Stanley-Stembridge…

Combinatorics · Mathematics 2022-11-10 Jonah Blasiak , Holden Eriksson , Pavlo Pylyavskyy , Isaiah Siegl

We consider families of quasisymmetric functions with the property that if a symmetric function $f$ is a positive sum of functions in one of these families, then f is necessarily a positive sum of Schur functions. Furthermore, in each of…

Combinatorics · Mathematics 2015-08-31 Austin Roberts

We seek simple conditions on a pair of labeled posets that determine when the difference of their $(P,\omega)$-partition enumerators is $F$-positive, i.e., positive in Gessel's fundamental basis. This is a quasisymmetric analogue of the…

Combinatorics · Mathematics 2025-09-17 Nathan R. T. Lesnevich , Peter R. W. McNamara

The quasisymmetric generating function of the set of permutations whose inverses have a fixed descent set is known to be symmetric and Schur-positive. The corresponding representation of the symmetric group is called the descent…

Combinatorics · Mathematics 2023-09-26 Vassilis Dionyssis Moustakas

A poset is called upper homogeneous, or "upho," if every principal order filter of the poset is isomorphic to the whole poset. We study (finite type $\mathbb{N}$-graded) upho lattices, with an eye towards their classification. Any upho…

Combinatorics · Mathematics 2025-02-07 Sam Hopkins

Every polynomial of the form $P=(x+1)(x^{n-1}+c_1x^{n-2}+\cdots +c_{n-1})$ is representable as Schur-Szeg\H{o} composition of $n-1$ polynomials of the form $(x+1)^{n-1}(x+a_i)$, where the numbers $a_i$ are unique up to permutation. We give…

Classical Analysis and ODEs · Mathematics 2015-04-08 Vladimir Petrov Kostov

The $(P, \omega)$-partition generating function of a labeled poset $(P, \omega)$ is a quasisymmetric function enumerating certain order-preserving maps from $P$ to $\mathbb{Z}^+$. We study the expansion of this generating function in the…

Combinatorics · Mathematics 2019-12-24 Ricky Ini Liu , Michael Weselcouch

In this paper we compute the rank and exhibit a presentation for the monoids of all $P$-stable and $P$-order preserving partial permutations on a finite set $\Omega$, with $P$ an ordered uniform partition of $\Omega$. These (inverse)…

Rings and Algebras · Mathematics 2019-05-29 Rita Caneco , Vítor H. Fernandes , Teresa M. Quinteiro

Using the combinatorics of $\alpha$-unimodal sets, we establish two new results in the theory of quasisymmetric functions. First, we obtain the expansion of the fundamental basis into quasisymmetric power sums. Secondly, we prove that…

Combinatorics · Mathematics 2023-11-14 Per Alexandersson , Robin Sulzgruber

Formal power series come up in several areas such as formal language theory , algebraic and enumerative combinatorics, semigroup theory, number theory etc. This paper focuses on the set x R[[x]] consisting of formal power series with zero…

Rings and Algebras · Mathematics 2015-10-21 Edgar Enochs , Overtoun Jenda , Furuzan Ozbek

Let $P\subset\mathbb R^n$ be a convex polytope and let $\ell$ be a linear functional which is nonconstant on every edge of $P$. The induced acyclic orientation determines positive and negative Bia{\l}ynicki-Birula type partitions of $P$…

Combinatorics · Mathematics 2026-05-01 Mateusz Michałek , Leonid Monin , Botong Wang

We prove that a finite graded simplicial poset with a top element added has real-rooted Chow and augmented Chow polynomials whenever it has a positive $h$-vector. This class of posets include Cohen-Macaulay simplicial posets and in…

Combinatorics · Mathematics 2025-08-22 Elena Hoster , Christian Stump

The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this…

Combinatorics · Mathematics 2007-05-23 Samuel K. Hsiao , T. Kyle Petersen

We give combinatorial proofs that certain families of differences of products of Schur functions are monomial-positive. We show in addition that such monomial-positivity is to be expected of a large class of generating functions with…

Combinatorics · Mathematics 2007-05-23 Thomas Lam , Pavlo Pylyavskyy

Let $n$ be a positive integer $\geqslant 2$ and $\mathbb{N}^n_{\leqslant}$ be the $n$-th power of positive integers with the product order of the usual order on $\mathbb{N}$. In the paper we study the semigroup of injective partial monotone…

Group Theory · Mathematics 2020-09-01 Oleg Gutik , Olha Krokhmalna

Three decades ago, Stanley and Brenti initiated the study of the Kazhdan--Lusztig--Stanley (KLS) functions, putting on common ground several polynomials appearing in algebraic combinatorics, discrete geometry, and representation theory. In…

Combinatorics · Mathematics 2026-05-06 Luis Ferroni , Jacob P. Matherne , Lorenzo Vecchi
‹ Prev 1 2 3 10 Next ›