English
Related papers

Related papers: Convex caterpillars are Schur-Positive

200 papers

The Wiener index is maximized over the set of trees with the given vertex weight and degree sequences. This model covers the traditional "unweighed" Wiener index, the terminal Wiener index, and the vertex distance index. It is shown that…

Combinatorics · Mathematics 2017-05-12 Mikhail Goubko

A graph is Schur-positive if its chromatic symmetric function expands non-negatively in the Schur basis. We determine a full Schur-positivity classification for complete multipartite graphs by showing that a complete multipartite graph…

Combinatorics · Mathematics 2026-04-30 Ethan Shelburne , Stephanie van Willigenburg

In previous work of this author it was conjectured that the sum of power sums $p_\lambda,$ for partitions $\lambda$ ranging over an interval $[(1^n), \mu]$ in reverse lexicographic order, is Schur-positive. Here we investigate this…

Combinatorics · Mathematics 2025-09-09 Sheila Sundaram

In this note, we explicitly compute the probability that a given cell in a random standard Young tableau of the shifted staircase shape $(2n-1, 2n-3, \ldots, 3,1)$ contains the maximal label. We also show that the asymptotic distribution of…

Combinatorics · Mathematics 2025-11-17 Chihiro Kubota , Taizo Sadahiro , Yoshika Ueda

Species trees represent the historical divergences of populations or species, while gene trees trace the ancestry of individual gene copies sampled within those populations. In cases involving rapid speciation, gene trees with topologies…

Populations and Evolution · Quantitative Biology 2015-08-28 James H. Degnan , John A. Rhodes

For any finite Coxeter group $W$ of rank $n$ we show that the order complex of the lattice of non-crossing partitions $\mathrm{NC}(W)$ embeds as a connected chamber subcomplex into a spherical building of type $A_{n-1}$. We use this to give…

Combinatorics · Mathematics 2018-05-24 Julia Heller , Petra Schwer

For affine Coxeter groups of affine types $\tilde D$ and $\tilde B$, we model the interval $[1,c]_T$ in the absolute order by symmetric noncrossing partitions of an annulus with one or two double points. In type $\tilde B$ (and…

Combinatorics · Mathematics 2026-05-25 Nathan Reading

Let $\lambda$, $\mu$, $\lambda'$, $\mu'$ be partitions. The conjecture of Lam, Postnikov and Pylyavskyy states that, if $\lambda+\mu = \lambda' + \mu'$, and $\min(\lambda_i-\lambda_j, \mu_i-\mu_j) \leq \lambda'_i - \lambda'_j \leq…

Combinatorics · Mathematics 2026-05-01 David E Speyer

We study chains in an $H$-closed topological partially ordered space. We give sufficient conditions for a maximal chain $L$ in an $H$-closed topological partially ordered space such that $L$ contains a maximal (minimal) element. Also we…

General Topology · Mathematics 2010-02-18 Oleg V. Gutik , Dušan Pagon , Dušan Repovš

We describe the $\mathfrak sl_3$ non-elliptic webs in terms of convex sets in the affine building. Kuperberg defined the non-elliptic web basis in his work on rank-$2$ spider categories. Fontaine, Kamnitzer, Kuperberg showed that the…

Combinatorics · Mathematics 2021-02-04 Tair Akhmejanov

We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

We prove that the noncrossing partition lattices associated with the complex reflection groups $G(d,d,n)$ for $d,n\geq 2$ admit symmetric decompositions into Boolean subposets. As a result, these lattices have the strong Sperner property…

Combinatorics · Mathematics 2017-08-08 Henri Mühle

We prove that the enumerative polynomials of quasi-Stirling permutations of multisets with respect to the statistics of plateaux, descents and ascents are partial $\gamma$-positive, thereby confirming a recent conjecture posed by Lin, Ma…

Combinatorics · Mathematics 2021-07-14 Sherry H. F. Yan , Yunwei Huang , Lihong Yang

We consider maximal non-$l$-intertwining collections, which are a higher-dimensional version of the maximal non-crossing collections which give clusters of Pl\"ucker coordinates in the Grassmannian coordinate ring, as described by Scott. We…

Representation Theory · Mathematics 2020-01-22 Jordan McMahon , Nicholas J. Williams

The aim of this paper is to establish a lattice theoretical framework to study the partially ordered set $\operatorname{\mathsf{tors}} A$ of torsion classes over a finite-dimensional algebra $A$. We show that $\operatorname{\mathsf{tors}}…

Representation Theory · Mathematics 2024-08-13 Laurent Demonet , Osamu Iyama , Nathan Reading , Idun Reiten , Hugh Thomas

The maximal index of a Euclidean lattice L of dimension n is the maximal index of the sub-lattices of L spanned by n independent minimal vectors of L. In this paper, we prove that a perfect lattice of maximal index two not provided by a…

Number Theory · Mathematics 2008-06-05 Anne-Marie Bergé

The center $Z(\mathcal{A})$ of an abelian category $\mathcal{A}$ is the endomorphism ring of the identity functor on that category. A localizing subcategory of a Grothendieck category $\mathcal{C}$ is said to be stable if it is stable under…

Representation Theory · Mathematics 2022-10-25 Konstantin Ardakov , Peter Schneider

A semiregular tree is a tree where all non-pendant vertices have the same degree. Belardo et al. (MATCH Commun. Math. Chem. 61(2), pp. 503-515, 2009) have shown that among all semiregular trees with a fixed order and degree, a graph with…

Combinatorics · Mathematics 2009-06-09 Tuerker Biyikoglu , Josef Leydold

We provide a criterion for a coherent sheaf to be an Ulrich sheaf in terms of a certain bilinear form on its global sections. When working over the real numbers we call it a positive Ulrich sheaf if this bilinear form is symmetric or…

Algebraic Geometry · Mathematics 2023-07-18 Christoph Hanselka , Mario Kummer

In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…

Combinatorics · Mathematics 2013-12-03 Andy Hardt , Pete McNeely , Tung Phan , Justin M. Troyka
‹ Prev 1 3 4 5 6 7 10 Next ›