We use the geometry of the stellahedral toric variety to study matroids. We identify the valuative group of matroids with the cohomology ring of the stellahedral toric variety and show that valuative, homological and numerical equivalence relations for matroids coincide. We establish a new log-concavity result for the Tutte polynomial of a matroid, answering a question of Wagner and Shapiro–Smirnov–Vaintrob on Postnikov–Shapiro algebras, and calculate the Chern–Schwartz–MacPherson classes of matroid Schubert cells. The central construction is the ‘augmented tautological classes of matroids’, modeled after certain toric vector bundles on the stellahedral toric variety.

In 2007, Andrews introduced Durfee symbols and k-marked Durfee symbols so as to give a combinatorial interpretation for the symmetrized moment function $\eta _{2k}(n)$ of ranks of partitions. He also considered the relations between odd Durfee symbols and the mock theta function $\omega (q)$, and proved that the $2k$th moment function $\eta _{2k}^0(n)$ of odd ranks of odd Durfee symbols counts $(k+1)$-marked odd Durfee symbols of n. In this paper, we first introduce the definition of symmetrized positive odd rank moments $\eta _k^{0+}(n)$ and prove that for all $1\leq i\leq k+1$, $\eta _{2k-1}^{0+}(n)$ is equal to the number of $(k+1)$-marked odd Durfee symbols of n with the ith odd rank equal to zero and $\eta _{2k}^{0+}(n)$ is equal to the number of $(k+1)$-marked Durfee symbols of n with the ith odd rank being positive. Then we calculate the generating functions of $\eta _{k}^{0+}(n)$ and study its asymptotic behavior. Finally, we use Wright’s variant of the Hardy–Ramanujan circle method to obtain an asymptotic formula for $\eta _{k}^{0+}(n)$.

In 1968, Steinberg [Endomorphisms of Linear Algebraic Groups, Memoirs of the American Mathematical Society, 80 (American Mathematical Society, Providence, RI, 1968)] proved a theorem stating that the exterior powers of an irreducible reflection representation of a Euclidean reflection group are again irreducible and pairwise nonisomorphic. We extend this result to a more general context where the inner product invariant under the group action may not necessarily exist.

A set of vertices in a graph is a Hamiltonian subset if it induces a subgraph containing a Hamiltonian cycle. Kim, Liu, Sharifzadeh, and Staden proved that for large $d$, among all graphs with minimum degree $d$, $K_{d+1}$ minimises the number of Hamiltonian subsets. We prove a near optimal lower bound that takes also the order and the structure of a graph into account. For many natural graph classes, it provides a much better bound than the extremal one ($\approx 2^{d+1}$). Among others, our bound implies that an $n$-vertex $C_4$-free graph with minimum degree $d$ contains at least $n2^{d^{2-o(1)}}$ Hamiltonian subsets.

Let $\mathcal{F}$ be an intersecting family. A $(k-1)$-set $E$ is called a unique shadow if it is contained in exactly one member of $\mathcal{F}$. Let ${\mathcal{A}}=\{A\in \binom{[n]}{k}\colon |A\cap \{1,2,3\}|\geq 2\}$. In the present paper, we show that for $n\geq 28k$, $\mathcal{A}$ is the unique family attaining the maximum size among all intersecting families without unique shadow. Several other results of a similar flavour are established as well.

We demonstrate that the phenomenon of popular differences (aka the phenomenon of large intersections) holds for natural families of polynomial patterns in rings of integers of number fields. If K is a number field with ring of integers $\mathcal{O}_K$ and $E \subseteq \mathcal{O}_K$ has positive upper Banach density $d^*(E) = \delta > 0$, we show, inter alia:

1. (1) if $p(x) \in K[x]$ is an intersective polynomial (i.e., p has a root modulo m for every $m \in \mathcal{O}_K$) with $p(\mathcal{O}_K) \subseteq \mathcal{O}_K$ and $r, s \in \mathcal{O}_K$ are distinct and nonzero, then for any $\varepsilon > 0$, there is a syndetic set $S \subseteq \mathcal{O}_K$ such that for any $n \in S$,

   \begin{align*}d^* \left( \left\{ x \in \mathcal{O}_K \;:\; \{x, x + rp(n), x + sp(n)\} \subseteq E \right\} \right) > \delta^3 - \varepsilon. \end{align*}
   Moreover, if ${s}/{r} \in \mathbb{Q}$, then there are syndetically many $n \in \mathcal{O}_K$ such that
   \begin{align*}d^* \left( \left\{ x \in \mathcal{O}_K \;:\; \{x, x + rp(n), x + sp(n), x + (r+s)p(n)\} \subseteq E \right\} \right)> \delta^4 - \varepsilon; \end{align*}

2. (2) if $\{p_1, \dots, p_k\} \subseteq K[x]$ is a jointly intersective family (i.e., $p_1, \dots, p_k$ have a common root modulo m for every $m \in \mathcal{O}_K$) of linearly independent polynomials with $p_i(\mathcal{O}_K) \subseteq \mathcal{O}_K$, then there are syndetically many $n \in \mathcal{O}_K$ such that

   \begin{align*}d^* \left( \left\{ x \in \mathcal{O}_K \;:\; \{x, x + p_1(n), \dots, x + p_k(n)\} \subseteq E \right\} \right)> \delta^{k+1} - \varepsilon. \end{align*}

These two results generalise and extend previous work of Frantzikinakis and Kra [21] and Franztikinakis [19] on polynomial configurations in $\mathbb{Z}$ and build upon recent work of the authors and Best [2] on linear patterns in general abelian groups. The above combinatorial results follow from multiple recurrence results in ergodic theory via a version of Furstenberg’s correspondence principle. The ergodic-theoretic recurrence theorems require a sharpening of existing tools for handling polynomial multiple ergodic averages. A key advancement made in this paper is a new result on the equidistribution of polynomial orbits in nilmanifolds, which can be seen as a far-reaching generalisation of Weyl’s equidistribution theorem for polynomials of several variables:

1. (3) let $d, k, l \in \mathbb{N}$. Let $(X, \mathcal{B}, \mu, T_1, \dots, T_l)$ be an ergodic, connected $\mathbb{Z}^l$-nilsystem. Let $\{p_{i,j} \;:\; 1 \le i \le k, 1 \le j \le l\} \subseteq \mathbb{Q}[x_1, \dots, x_d]$ be a family of polynomials such that $p_{i,j}\left( \mathbb{Z}^d \right) \subseteq \mathbb{Z}$ and $\{1\} \cup \{p_{i,j}\}$ is linearly independent over $\mathbb{Q}$. Then the $\mathbb{Z}^d$-sequence $\left( \prod_{j=1}^l{T_j^{p_{1,j}(n)}}x, \dots, \prod_{j=1}^l{T_j^{p_{k,j}(n)}}x \right)_{n \in \mathbb{Z}^d}$ is well-distributed in $X^k$ for every x in a co-meager set of full measure.

We recall several categories of graphs which are useful for describing homotopy-coherent versions of generalised operads (e.g. cyclic operads, modular operads, properads, and so on), and give new, uniform definitions for their morphisms. This allows for straightforward comparisons, and we use this to show that certain free-forgetful adjunctions between categories of generalised operads can be realised at the level of presheaves. This includes adjunctions between operads and cyclic operads, between dioperads and augmented cyclic operads, and between wheeled properads and modular operads.

In this note, we bound the metric dimension of the circulant graphs $C_n(1,2,\ldots ,t)$. We shall prove that if $n=2tk+t$ and if t is odd, then $\dim (C_n(1,2,\ldots ,t))=t+1$, which confirms Conjecture 4.1.1 in Chau and Gosselin (2017, Opuscula Mathematica 37, 509–534). In Vetrík (2017, Canadian Mathematical Bulletin 60, 206–216; 2020, Discussiones Mathematicae. Graph Theory 40, 67–76), the author has shown that $\dim (C_n(1,2,\ldots ,t))\leq t+\left \lceil \frac {p}{2}\right \rceil $ for $n=2tk+t+p$, where $t\geq 4$ is even, $1\leq p\leq t+1$, and $k\geq 1$. Inspired by his work, we show that $\dim (C_n(1,2,\ldots ,t))\leq t+\left \lfloor \frac {p}{2}\right \rfloor $ for $n=2tk+t+p$, where $t\geq 5$ is odd, $2\leq p\leq t+1$, and $k\geq 2$.

Resolving a problem of Conlon, Fox and Rödl, we construct a family of hypergraphs with arbitrarily large tower height separation between their $2$-colour and q-colour Ramsey numbers. The main lemma underlying this construction is a new variant of the Erdős–Hajnal stepping-up lemma for a generalized Ramsey number $r_k(t;q,p)$, which we define as the smallest integer n such that every q-colouring of the k-sets on n vertices contains a set of t vertices spanning fewer than p colours. Our results provide the first tower-type lower bounds on these numbers.

We study the locations of complex zeroes of independence polynomials of bounded-degree hypergraphs. For graphs, this is a long-studied subject with applications to statistical physics, algorithms, and combinatorics. Results on zero-free regions for bounded-degree graphs include Shearer’s result on the optimal zero-free disc, along with several recent results on other zero-free regions. Much less is known for hypergraphs. We make some steps towards an understanding of zero-free regions for bounded-degree hypergaphs by proving that all hypergraphs of maximum degree $\Delta$ have a zero-free disc almost as large as the optimal disc for graphs of maximum degree $\Delta$ established by Shearer (of radius $\sim 1/(e \Delta )$). Up to logarithmic factors in $\Delta$ this is optimal, even for hypergraphs with all edge sizes strictly greater than $2$. We conjecture that for $k\ge 3$, $k$-uniform linear hypergraphs have a much larger zero-free disc of radius $\Omega (\Delta ^{- \frac{1}{k-1}} )$. We establish this in the case of linear hypertrees.

We introduce a new class of permutations, called web permutations. Using these permutations, we provide a combinatorial interpretation for entries of the transition matrix between the Specht and $\operatorname {SL}_2$-web bases of the irreducible $ \mathfrak {S}_{2n} $-representation indexed by $ (n,n) $, which answers Rhoades’s question. Furthermore, we study enumerative properties of these permutations.

We prove that any strongly mixing action of a countable abelian group on a probability space has higher-order mixing properties. This is achieved via the utilization of $\mathcal R$-limits, a notion of convergence which is based on the classical Ramsey theorem. $\mathcal R$-limits are intrinsically connected with a new combinatorial notion of largeness which is similar to but has stronger properties than the classical notions of uniform density one and IP$^*$. While the main goal of this paper is to establish a universal property of strongly mixing actions of countable abelian groups, our results, when applied to ${\mathbb {Z}}$-actions, offer a new way of dealing with strongly mixing transformations. In particular, we obtain several new characterizations of strong mixing for ${\mathbb {Z}}$-actions, including a result which can be viewed as the analogue of the weak mixing of all orders property established by Furstenberg in the course of his proof of Szemerédi’s theorem. We also demonstrate the versatility of $\mathcal R$-limits by obtaining new characterizations of higher-order weak and mild mixing for actions of countable abelian groups.

It is consistent relative to an inaccessible cardinal that ZF+DC holds, and the hypergraph of isosceles triangles on $\mathbb {R}^2$ has countable chromatic number while the hypergraph of isosceles triangles on $\mathbb {R}^3$ has uncountable chromatic number.

In the setting of finite groups, suppose $J$ acts on $N$ via automorphisms so that the induced semidirect product $N\rtimes J$ acts on some non-empty set $\Omega$, with $N$ acting transitively. Glauberman proved that if the orders of $J$ and $N$ are coprime, then $J$ fixes a point in $\Omega$. We consider the non-coprime case and show that if $N$ is abelian and a Sylow $p$-subgroup of $J$ fixes a point in $\Omega$ for each prime $p$, then $J$ fixes a point in $\Omega$. We also show that if $N$ is nilpotent, $N\rtimes J$ is supersoluble, and a Sylow $p$-subgroup of $J$ fixes a point in $\Omega$ for each prime $p$, then $J$ fixes a point in $\Omega$.

Let $\ell $ be a prime number. The Iwasawa theory of multigraphs is the systematic study of growth patterns in the number of spanning trees in abelian $\ell $-towers of multigraphs. In this context, growth patterns are realized by certain analogs of Iwasawa invariants, which depend on the prime $\ell $ and the abelian $\ell $-tower of multigraphs. We formulate and study statistical questions about the behavior of the Iwasawa $\mu $ and $\lambda $ invariants.

We show that an $n$-uniform maximal intersecting family has size at most $e^{-n^{0.5+o(1)}}n^n$. This improves a recent bound by Frankl ((2019) Comb. Probab. Comput. 28(5) 733–739.). The Spread Lemma of Alweiss et al. ((2020) Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing.) plays an important role in the proof.

We make precise and prove a conjecture of Klivans about actions of the sandpile group on spanning trees. More specifically, the conjecture states that there exists a unique ‘suitably nice’ sandpile torsor structure on plane graphs which is induced by rotor-routing.

First, we rigorously define a sandpile torsor algorithm (on plane graphs) to be a map which associates each plane graph (i.e., planar graph with an appropriate ribbon structure) with a free transitive action of its sandpile group on its spanning trees. Then, we define a notion of consistency, which requires a torsor algorithm to be preserved with respect to a certain class of contractions and deletions. Using these definitions, we show that the rotor-routing sandpile torsor algorithm is consistent. Furthermore, we demonstrate that there are only three other consistent algorithms on plane graphs, which all have the same structure as rotor-routing.

We also define sandpile torsor algorithms on regular matroids and suggest a notion of consistency in this context. We conjecture that the Backman-Baker-Yuen algorithm is consistent, and that there are only three other consistent sandpile torsor algorithms on regular matroids, all with the same structure.

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of $a^3b$-quadrilaterals with all angles being rational degrees. There are $12$ sporadic and $3$ infinite sequences of quadrilaterals admitting the two-layer earth map tilings together with their modifications, and $3$ sporadic quadrilaterals admitting $4$ exceptional tilings. Among them only three quadrilaterals are convex. New interesting non-edge-to-edge triangular tilings are obtained as a byproduct.