组合数学
The isolation game is played on a graph $G$ by two players who take turns playing a vertex such that if $X$ is the set of already played vertices, then a vertex can be selected only if it dominates a vertex from a nontrivial component of $G…
In this paper we classify when (row-strict) dual immaculate functions and (row-strict) extended Schur functions, as well as their skew generalizations, are symmetric. We also classify when their natural variants, termed advanced functions,…
The pebble motion problem (PMP) asks whether one configuration of labeled pebbles on a graph can be transformed into another by moving pebbles to adjacent unoccupied vertices. It is a fundamental model of graph reconfiguration and is…
In this paper, we estimate the weak saturation numbers of trees. As a case study, we examine caterpillars and obtain several tight estimates. In particular, this implies that for any $\alpha\in [1,2]$, there exist caterpillars with $k$…
For a list-assignment $L$, the reconfiguration graph $C_L(G)$ of a graph $G$ is the graph whose vertices are proper $L$-colorings of $G$ and whose edges link two colorings that differ on only one vertex. If $|L(v)| \ge d(v) + 2$ for every…
In this paper, we present new objects, quilts of alternating sign matrices with respect to two given posets. Quilts generalize several commonly used concepts in mathematics. For example, the rank function on submatrices of a matrix gives…
Given a (di)graph $H$, we say that a (di)graph $H^\prime$ is an $H$-subdivision if $H^\prime$ is obtained from $H$ by replacing one or more edges with internally vertex-disjoint path(s). Pavez-Sign\'{e} conjectured that for every…
Stability and dependence are model-theoretic notions that have recently proved highly effective in the study of structural and algorithmic properties of hereditary graph classes, and are considered key notions for generalizing to hereditary…
Inspired by recent work on refraction billiards in dynamics, we introduce a notion of refraction for combinatorial billiards. This allows us to define a generalization of toric promotion that we call toric promotion with reflections and…
An edge-colored graph $G$ is called properly colored if every two adjacent edges are assigned different colors. A monochromatic triangle is a cycle of length 3 with all the edges having the same color. Given a tree $T_0$, let…
Interpolation polynomials were introduced by Knop--Sahi in type $A$, and Okounkov in type $BC$. They are inhomogeneous polynomials whose top terms are Jack and Macdonald polynomials. Thus the expansion coefficients for the product of two…
Finding upper bounds for character ratios is a fundamental problem in asymptotic group theory. Previous bounds in the symmetric group have led to remarkable applications in unexpected domains. The existing approaches predominantly relied on…
We show that with a suitable weak notion of general position, the Elekes-Szab\'o condition on the group operation of a connected complex algebraic group characterises nilpotence of the group. Along the way, we prove a Mordell-Lang result…
In this paper, we construct additively graceful signed graphs S from a given graph G that may be additively graceful or not be additively graceful. We also show the construction of additively graceful signed graphs from additively graceful…
The sparse analogue of Szemer\'edi's regularity method has played a central role in the development of extremal results for random graphs. While the sparse embedding lemma (the KLR conjecture) has been resolved, the corresponding sparse…
We investigate lower bounds for the number of ideal and finite vertices of right-angled hyperbolic polyhedra of finite volume. We use a geometric method of orthogonal gluings to establish new bounds in low dimensions, specifically…
Fully inhomogeneous spin Hall-Littlewood symmetric rational functions $F_\lambda$ arise as partition functions of certain path configurations in the $\mathfrak{sl}_2$ higher spin six vertex models. They are multiparameter generalizations of…
Carnevale, Schein and Voll proved self-reciprocity of the generalized Igusa functions, and Maglione and Voll did the same for the Hall-Littlewood-Schubert series. We introduce a simultaneous generalization and refinement of these two…
We investigate `almost counterexamples' to Seymour's second neighbourhood conjecture. In what we call Seymour-tight orientations, the size of the first neighbourhood of each vertex equals the size of its second neighbourhood. We give…
Let $X\subseteq\{0,1\}^n$ be a set of binary strings of length $n$. The daisy cube $Q_n(X)$ is the subgraph of the hypercube $Q_n$ induced by the union of the intervals $I(x,0^n)$ for $x\in X$. As a subclass of partial cubes, it generalizes…