组合数学

We present an initial-seed-mutation formula for d-vectors of cluster variables in a cluster algebra. We also give two rephrasings of this recursion: one as a duality formula for d-vectors in the style of the g-vectors/c-vectors dualities of…

We consider two problems that appear at first sight to be unrelated. The first problem is to count certain diagrams consisting of noncrossing arcs in the plane. The second problem concerns the weak order on the symmetric group. Each…

We construct universal geometric coefficients, over the integers, the rationals, and the reals, for cluster algebras arising from the once-punctured torus. We verify that the once-punctured torus has a property called the Null Tangle…

In this chapter, we trace the path from the Tamari lattice, via lattice congruences of the weak order, to the definition of Cambrian lattices in the context of finite Coxeter groups, and onward to the construction of Cambrian fans. We then…

A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…

We define and study a combinatorial Hopf algebra dRec with basis elements indexed by diagonal rectangulations of a square. This Hopf algebra provides an intrinsic combinatorial realization of the Hopf algebra tBax of twisted Baxter…

When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how…

In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing…

We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…

We give a unified explanation of the geometric and algebraic properties of two well-known maps, one from permutations to triangulations, and another from permutations to subsets. Furthermore we give a broad generalization of the maps.…

We study the enumeration of spinal tree-child phylogenetic networks, a rigid family of tree-child networks in which all internal vertices lie on a single root--to--leaf path. We provide two complementary combinatorial frameworks. First, we…

The chromatic threshold of a graph $H$ is the minimum-degree density above which every $H$-free graph has bounded chromatic number. We study a two-color Ramsey analogue: for graphs $H_1$ and $H_2$, we ask for the minimum-degree density…

Chromatic choosability is a notion of fundamental importance in list coloring. A graph $G$ is chromatic-choosable when its chromatic number, $\chi(G)$, is equal to its list chromatic number $\chi_{\ell}(G)$. In 1990, Kostochka and Sidorenko…

The conflict-free closed neighborhood (CFCN$^*$) chromatic number of a graph $G = (V,E)$ is the smallest positive integer $k$ for which there exists a coloring of a subset of vertices using $k$ colors such that, for every vertex in $V$,…

Motivated by the change-of-domain problem for additive bases, Bukh, van Hintum and Keevash conjectured that if \(A,B\subseteq \mathbb{Q}^{n}\) and \(\{\boldsymbol{e}_i+\boldsymbol{e}_j:1\le i\le j\le n\}\subseteq A+B,\) then \(|A|+|B|\ge…

We argue that Jack Littlewood-Richardson coefficients $g_{\mu\nu}^{\lambda}(\alpha)$ are specialisations of certain novel polynomials. For the triple of partitions $(\mu,\nu,\lambda)=(21,21,321)$, we prove the corresponding polynomial is…

The regular set tolerance is an important term in sensitivity analysis. For combinatorial sum problems, e.g., the Traveling Salesman Problem, Shortest Path Problem and Minimum Spanning Tree Problem, it determines how much the sum of the…

This paper is to study the Ehrhart function $L(P,t)$ of a rational $n$-polytope $P$, defined as the number of lattice points of dilated polytopes $tP$ with real numbers $t\geq 0$. It turns out that $L(P,t)$ is a quasi-polynomial of real…

Given a graph $G=(V,E)$, a vertex $u \in V$ {\em ve-dominates} all edges incident to any vertex of $N_G[u]$. A set $S \subseteq V$ is a {\em ve-dominating set} if for all edges $e\in E$, there exists a vertex $u\in S$ such that $u$…

Motivated by Stanley's ``Schubert shenanigans'' paper, commendable attempts have been made to understand the principal specializations of Schubert or Grothendieck polynomials. In this paper, we prove that when a permutation $w$ does not…