English
Related papers

Related papers: Convex caterpillars are Schur-Positive

200 papers

Let A be a subspace arrangement and let chi(A,t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(B_n), where B_n is the type B Weyl arrangement, then chi(A,t) counts a…

Combinatorics · Mathematics 2007-05-23 Andreas Blass , Bruce E. Sagan

We prove that an $n$-component fibered link $L$ in $S^3$ is strongly quasi-positive if and only if $\tau(L)=g_3(L)+n-1$, where $g_3(L)$ denotes the Seifert genus and $\tau$ is the Ozsv\'ath-Szab\'o concordance invariant. We also provide a…

Geometric Topology · Mathematics 2022-10-13 Alberto Cavallo

The classification of lattice equations that are integrable in the sense of higher-dimensional consistency is extended by allowing directed edges. We find two cases that are not transformable via the 'admissible transformations' to the…

Exactly Solvable and Integrable Systems · Physics 2009-11-13 Chris M. Field

We characterize supersolvable lattices in terms of a certain modular type relation. McNamara and Thomas earlier characterized this class of lattices as those graded lattices having a maximal chain that consists of left-modular elements. Our…

Combinatorics · Mathematics 2022-01-31 Stephan Foldes , Russ Woodroofe

Trees without vertices of degree $2$ are sometimes named topological trees. In this work, we bring forward the study of the inducibility of (rooted) topological trees with a given number of leaves. The inducibility of a topological tree $S$…

Combinatorics · Mathematics 2018-02-20 Audace Amen Vioutou Dossou-Olory , Stephan Wagner

The notion of exponential Dowling structures is introduced, generalizing Stanley's original theory of exponential structures. Enumerative theory is developed to determine the M\"obius function of exponential Dowling structures, including a…

Combinatorics · Mathematics 2010-09-23 Richard Ehrenborg , Margaret Readdy

The investigation into large families of non-opposite flags in finite spherical buildings has been a recent addition to a long line of research in extremal combinatorics, extending classical results in vector and polar spaces. This line of…

Combinatorics · Mathematics 2025-05-21 Jan De Beule , Philipp Heering , Sam Mattheus , Klaus Metsch

For two subsets S and T of a given lattice L, we define a relative distributive (modular) property over L, that underlies a large family including the usual class of distributive (modular) lattices. Our proposed class will be called…

Combinatorics · Mathematics 2023-12-07 M. R. Emamy-K. , Gustavo A. Melendez Rios

Assume that we embed the path $P_n$ as a subgraph of a $2$-dimensional grid, namely, $P_k \times P_l$. Given such an embedding, we consider the ordered set of subpaths $L_1, L_2, \ldots , L_m$ which are maximal straight segments in the…

Combinatorics · Mathematics 2018-03-23 Susana-Clara López , Francesc-Antoni Muntaner-Batle

Let S(D) be the surface produced by applying Seifert's algorithm to the oriented link diagram D. I prove that if D has no negative crossings then S(D) is a quasipositive Seifert surface, that is, S(D) embeds incompressibly on a fiber…

Geometric Topology · Mathematics 2007-05-23 Lee Rudolph

In [GHKK18], Gross-Hacking-Keel-Kontsevich discuss compactifications of cluster varieties from "positive subsets" in the real tropicalization of the mirror. To be more precise, let $\mathfrak{D}$ be the scattering diagram of a cluster…

Algebraic Geometry · Mathematics 2021-01-29 Man-Wai Cheung , Timothy Magee , Alfredo Nájera Chávez

We study upward planar straight-line embeddings (UPSE) of directed trees on given point sets. The given point set $S$ has size at least the number of vertices in the tree. For the special case where the tree is a path $P$ we show that: (a)…

Computational Geometry · Computer Science 2020-12-22 Elena Arseneva , Pilar Cano , Linda Kleist , Tamara Mchedlidze , Saeed Mehrabi , Irene Parada , Pavel Valtr

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

Combinatorics · Mathematics 2013-06-18 T. Kyle Petersen

An antimagic labeling of a graph $G$ is an injection from $E(G)$ to $\{1,2,\dots,|E(G)|\}$ such that all vertex sums are pairwise distinct, where the vertex sum at vertex $u$ is the sum of the labels assigned to edges incident to $u$. A…

Combinatorics · Mathematics 2024-05-09 Antoni Lozano , Mercè Mora , Carlos Seara , Joaquín Tey

Regarding the Specht modules associated to the two-row partition $(n,n)$, we provide a combinatorial path model to study the transitioning matrix from the tableau basis to the $A_1$-web basis (i.e. cup diagrams), and prove that the entries…

Representation Theory · Mathematics 2020-09-03 Mee Seong Im , Jieru Zhu

We explore labeled chip-firing on undirected $k$-ary trees, trees where every vertex has degree $k+1$. First, we extend known results for binary trees from Musiker and Nguyen, including the endgame and the locations of the smallest and…

Combinatorics · Mathematics 2025-10-09 Ryota Inagaki , Aaron Lin

A convex chain is a finite integer linear combination of indicator functions of convex polytopes. Khovanskii-Pukhlikov extend the Ehrhart theory of convex lattice polytopes to the setting of convex chains. Extending the relationship between…

Algebraic Geometry · Mathematics 2026-04-08 Suhyon Chong , Shaoyu Huang , Kiumars Kaveh

In this paper, we investigate the trace set of a Fuchsian lattice. There are two results of this paper: the first is that for a non-uniform lattice, we prove Scmutz's conjecture: the trace set of a Fuchsian lattice exhibits linear growth if…

Group Theory · Mathematics 2025-10-21 Yanlong Hao

The Horton-Strahler (HS) index $r=\max{(i,j)}+\delta_{i,j}$ has been shown to be relevant to a number of physical (such at diffusion limited aggregation) geological (river networks), biological (pulmonary arteries, blood vessels, various…

Statistical Mechanics · Physics 2009-11-07 Z. Toroczkai

The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.

Operator Algebras · Mathematics 2009-01-26 Mihai Popa