For a given graph $H$, we say that a graph $G$ has a perfect $H$-subdivision tiling if $G$ contains a collection of vertex-disjoint subdivisions of $H$ covering all vertices of $G.$ Let $\delta _{\mathrm {sub}}(n, H)$ be the smallest integer $k$ such that any $n$-vertex graph $G$ with minimum degree at least $k$ has a perfect $H$-subdivision tiling. For every graph $H$, we asymptotically determined the value of $\delta _{\mathrm {sub}}(n, H)$. More precisely, for every graph $H$ with at least one edge, there is an integer $\mathrm {hcf}_{\xi }(H)$ and a constant $1 \lt \xi ^*(H)\leq 2$ that can be explicitly determined by structural properties of $H$ such that $\delta _{\mathrm {sub}}(n, H) = \left (1 - \frac {1}{\xi ^*(H)} + o(1) \right )n$ holds for all $n$ and $H$ unless $\mathrm {hcf}_{\xi }(H) = 2$ and $n$ is odd. When $\mathrm {hcf}_{\xi }(H) = 2$ and $n$ is odd, then we show that $\delta _{\mathrm {sub}}(n, H) = \left (\frac {1}{2} + o(1) \right )n$.

We give a complete combinatorial classification of the parabolic Verma modules in the principal block of the parabolic category $\mathcal{O}$ associated with a minimal or a maximal parabolic subalgebra of the special linear Lie algebra for which the answer to Kostant’s problem is positive.

Let $(W,S)$ be a Coxeter system, and write $S=\{s_i:i\in I\}$, where I is a finite index set. Fix a nonempty convex subset $\mathscr {L}$ of W. If W is of type A, then $\mathscr {L}$ is the set of linear extensions of a poset, and there are important Bender–Knuth involutions $\mathrm {BK}_i\colon \mathscr {L}\to \mathscr {L}$ indexed by elements of I. For arbitrary W and for each $i\in I$, we introduce an operator $\tau _i\colon W\to W$ (depending on $\mathscr {L}$) that we call a noninvertible Bender–Knuth toggle; this operator restricts to an involution on $\mathscr {L}$ that coincides with $\mathrm {BK}_i$ in type A. Given a Coxeter element $c=s_{i_n}\cdots s_{i_1}$, we consider the operator $\mathrm {Pro}_c=\tau _{i_n}\cdots \tau _{i_1}$. We say W is futuristic if for every nonempty finite convex set $\mathscr {L}$, every Coxeter element c and every $u\in W$, there exists an integer $K\geq 0$ such that $\mathrm {Pro}_c^K(u)\in \mathscr {L}$. We prove that finite Coxeter groups, right-angled Coxeter groups, rank-3 Coxeter groups, affine Coxeter groups of types $\widetilde A$ and $\widetilde C$, and Coxeter groups whose Coxeter graphs are complete are all futuristic. When W is finite, we actually prove that if $s_{i_N}\cdots s_{i_1}$ is a reduced expression for the long element of W, then $\tau _{i_N}\cdots \tau _{i_1}(W)=\mathscr {L}$; this allows us to determine the smallest integer $\mathrm {M}(c)$ such that $\mathrm {Pro}_c^{{\mathrm {M}}(c)}(W)=\mathscr {L}$ for all $\mathscr {L}$. We also exhibit infinitely many non-futuristic Coxeter groups, including all irreducible affine Coxeter groups that are not of type $\widetilde A$, $\widetilde C$, or $\widetilde G_2$.

In [15], using methods from ergodic theory, a longstanding conjecture of Erdős (see [5, Page 305]) about sumsets in large subsets of the natural numbers was resolved. In this paper, we extend this result to several important classes of amenable groups, including all finitely generated virtually nilpotent groups and all abelian groups $(G,+)$ with the property that the subgroup $2G := \{g+g : g\in G\}$ has finite index. We prove that in any group G from the above classes, any $A\subset G$ with positive upper Banach density contains a shifted product set of the form $\{tb_ib_j\colon i<j\}$, for some infinite sequence $(b_n)_{n\in \mathbb {N}}$ and some $t\in G$. In fact, we show this result for all amenable groups that posses a property which we call square absolute continuity. Our results provide answers to several questions and conjectures posed in [13].

For each uniformity $k \geq 3$, we construct $k$ uniform linear hypergraphs $G$ with arbitrarily large maximum degree $\Delta$ whose independence polynomial $Z_G$ has a zero $\lambda$ with $\left \vert \lambda \right \vert = O\left (\frac {\log \Delta }{\Delta }\right )$. This disproves a recent conjecture of Galvin, McKinley, Perkins, Sarantis, and Tetali.

We show that if $\Gamma $ is a point group of $\mathbb {R}^{k+1}$ of order two for some $k\geq 2$ and $\mathcal {S}$ is a k-pseudomanifold which has a free automorphism of order two, then either $\mathcal {S}$ has a $\Gamma $-symmetric infinitesimally rigid realisation in ${\mathbb R}^{k+1}$ or $k=2$ and $\Gamma $ is a half-turn rotation group. This verifies a conjecture made by Klee, Nevo, Novik and Zheng for the case when $\Gamma $ is a point-inversion group. Our result implies that Stanley’s lower bound theorem for centrally symmetric polytopes extends to pseudomanifolds with a free simplicial automorphism of order 2, thus verifying (the inequality part of) another conjecture of Klee, Nevo, Novik and Zheng. Both results actually apply to a much larger class of simplicial complexes – namely, the circuits of the simplicial matroid. The proof of our rigidity result adapts earlier ideas of Fogelsanger to the setting of symmetric simplicial complexes.

In his “lost notebook,” Ramanujan used iterated derivatives of two theta functions to define sequences of q-series $\{U_{2t}(q)\}$ and $\{V_{2t}(q)\}$ that he claimed to be quasimodular. We give the first explicit proof of this claim by expressing them in terms of “partition Eisenstein series,” extensions of the classical Eisenstein series $E_{2k}(q),$ defined by

$$ \begin{align*}\lambda=(1^{m_1}, 2^{m_2},\dots, n^{m_n}) \vdash n \ \ \ \longmapsto \ \ \ E_{\lambda}(q):= E_2(q)^{m_1} E_4(q)^{m_2}\cdots E_{2n}(q)^{m_n}. \end{align*} $$

For functions $\phi : \mathcal {P}\mapsto {\mathbb C}$ on partitions, the weight $2n$ partition Eisenstein trace is

$$ \begin{align*}\operatorname{\mathrm{Tr}}_n(\phi;q):=\sum_{\lambda \vdash n} \phi(\lambda)E_{\lambda}(q). \end{align*} $$

For all t, we prove that $U_{2t}(q)=\operatorname {\mathrm {Tr}}_t(\phi _U;q)$ and $V_{2t}(q)=\operatorname {\mathrm {Tr}}_t(\phi _V;q),$ where $\phi _U$ and $\phi _V$ are natural partition weights, giving the first explicit quasimodular formulas for these series.

For finite nilpotent groups $J$ and $N$, suppose $J$ acts on $N$ via automorphisms. We exhibit a decomposition of the first cohomology set in terms of the first cohomologies of the Sylow $p$-subgroups of $J$ that mirrors the primary decomposition of $H^1(J,N)$ for abelian $N$. We then show that if $N \rtimes J$ acts on some non-empty set $\Omega$, where the action of $N$ is transitive and for each prime $p$ a Sylow $p$-subgroup of $J$ fixes an element of $\Omega$, then $J$ fixes an element of $\Omega$.

We define oriented Temperley–Lieb algebras for Hermitian symmetric spaces. This allows us to explain the existence of closed combinatorial formulae for the Kazhdan–Lusztig polynomials for these spaces.

We extend the notion of ascent-compatibility from symmetric groups to all Coxeter groups, thereby providing a type-independent framework for constructing families of modules of $0$-Hecke algebras. We apply this framework in type B to give representation–theoretic interpretations of a number of noteworthy families of type-B quasisymmetric functions. Next, we construct modules of the type-B $0$-Hecke algebra corresponding to type-B analogs of Schur functions and introduce a type-B analog of Schur Q-functions; we prove that these shifted domino functions expand positively in the type-B peak functions. We define a type-B analog of the $0$-Hecke–Clifford algebra, and we use this to provide representation–theoretic interpretations for both the type-B peak functions and the shifted domino functions. We consider the modules of this algebra induced from type-B $0$-Hecke modules constructed via ascent-compatibility and prove a general formula, in terms of type-B peak functions, for the type-B quasisymmetric characteristics of the restrictions of these modules.

For $M,N,m\in \mathbb {N}$ with $M\geq 2, N\geq 1$ and $m \geq 2$, we define two families of sequences, $\mathcal {B}_{M,N}$ and $\mathcal {B}_{M,N,m}$. The nth term of $\mathcal {B}_{M,N}$ is obtained by expressing n in base M and recombining those digits in base N. The nth term of $\mathcal {B}_{M,N,m}$ is defined by $\mathcal {B}_{M,N,m}(n):=\mathcal {B}_{M,N}(n) \; (\textrm {mod}\;m)$. The special case $\mathcal {B}_{M,1,m}$, where $N=1$, yields the digit sum sequence $\mathbf {t}_{M,m}$ in base M mod m. We prove that $\mathcal {B}_{M,N}$ is the fixed point of a morphism $\mu _{M,N}$ at letter $0$, similar to a property of $\mathbf {t}_{M,m}$. Additionally, we show that $\mathcal {B}_{M,N,m}$ contains arbitrarily long palindromes if and only if $m=2$, mirroring the behaviour of the digit sum sequence. When $m\geq M$ and N, m are coprime, we establish that $\mathcal {B}_{M,N,m}$ contains no overlaps.

This article explores the notions of $\mathcal {F}$-transitivity and topological $\mathcal {F}$-recurrence for backward shift operators on weighted $\ell ^p$-spaces and $c_0$-spaces on directed trees, where $\mathcal {F}$ represents a Furstenberg family of subsets of $\mathbb {N}_0$. In particular, we establish the equivalence between recurrence and hypercyclicity of these operators on unrooted directed trees. For rooted directed trees, a backward shift operator is hypercyclic if and only if it possesses an orbit of a bounded subset that is weakly dense.

We establish the restricted sumset analog of the celebrated conjecture of Sárközy on additive decompositions of the set of nonzero squares over a finite field. More precisely, we show that if $q>13$ is an odd prime power, then the set of nonzero squares in $\mathbb {F}_q$ cannot be written as a restricted sumset $A \hat {+} A$, extending a result of Shkredov. More generally, we study restricted sumsets in multiplicative subgroups over finite fields as well as restricted sumsets in perfect powers (over integers) motivated by a question of Erdős and Moser. We also prove an analog of van Lint–MacWilliams’ conjecture for restricted sumsets, which appears to be the first analogue of Erdős--Ko–Rado theorem in a family of Cayley sum graphs.

Let $\overline {M}(a,c,n)$ denote the number of overpartitions of n with first residual crank congruent to a modulo c with $c\geq 3$ being odd and $0\leq a<c$. The central objective of this paper is twofold: firstly, to establish an asymptotic formula for the crank of overpartitions; and secondly, to establish several inequalities concerning $\overline {M}(a,c,n)$ that encompasses crank differences, positivity, and strict log-subadditivity.

In his proof of the irrationality of $\zeta (3)$ and $\zeta (2)$, Apéry defined two integer sequences through $3$-term recurrences, which are known as the famous Apéry numbers. Zagier, Almkvist–Zudilin, and Cooper successively introduced the other $13$ sporadic sequences through variants of Apéry’s $3$-term recurrences. All of the $15$ sporadic sequences are called Apéry-like sequences. Motivated by Gessel’s congruences mod $24$ for the Apéry numbers, we investigate congruences of the form $u_n\equiv \alpha ^n \ \pmod {N_{\alpha }}~(\alpha \in \mathbb {Z},N_{\alpha }\in \mathbb {N}^{+})$ for all of the $15$ Apéry-like sequences $\{u_n\}_{n\ge 0}$. Let $N_{\alpha }$ be the largest positive integer such that $u_n\equiv \alpha ^n\ \pmod {N_{\alpha }}$ for all non-negative integers n. We determine the values of $\max \{N_{\alpha }|\alpha \in \mathbb {Z}\}$ for all of the $15$ Apéry-like sequences $\{u_n\}_{n\ge 0}$. The binomial transforms of Apéry-like sequences provide us a unified approach to this type of congruences for Apéry-like sequences.

Let $f^{(r)}(n;s,k)$ denote the maximum number of edges in an n-vertex r-uniform hypergraph containing no subgraph with k edges and at most s vertices. Brown, Erdős, and Sós [New directions in the theory of graphs (Proc. Third Ann Arbor Conf., Univ. Michigan 1971), pp. 53–63, Academic Press 1973] conjectured that the limit $\lim _{n\rightarrow \infty }n^{-2}f^{(3)}(n;k+2,k)$ exists for all k. The value of the limit was previously determined for $k=2$ in the original paper of Brown, Erdős, and Sós, for $k=3$ by Glock [Bull. Lond. Math. Soc., 51 (2019) 230–236] and for $k=4$ by Glock, Joos, Kim, Kühn, Lichev, and Pikhurko [Proc. Amer. Math. Soc., Series B, 11 (2024) 173–186] while Delcourt and Postle [Proc. Amer. Math. Soc., 152 (2024), 1881–1891] proved the conjecture (without determining the limiting value).

In this article, we determine the value of the limit in the Brown–Erdős–Sós problem for $k\in \{5,6,7\}$. More generally, we obtain the value of $\lim _{n\rightarrow \infty }n^{-2}f^{(r)}(n;rk-2k+2,k)$ for all $r\geqslant 3$ and $k\in \{5,6,7\}$. In addition, by combining these new values with recent results of Bennett, Cushman, and Dudek [arxiv:2309.00182, 2023] we obtain new asymptotic values for several generalized Ramsey numbers.

A classical result of Erdős, Lovász and Spencer from the late 1970s asserts that the dimension of the feasible region of densities of graphs with at most k vertices in large graphs is equal to the number of non-trivial connected graphs with at most k vertices. Indecomposable permutations play the role of connected graphs in the realm of permutations, and Glebov et al. showed that pattern densities of indecomposable permutations are independent, i.e., the dimension of the feasible region of densities of permutation patterns of size at most k is at least the number of non-trivial indecomposable permutations of size at most k. However, this lower bound is not tight already for $k=3$. We prove that the dimension of the feasible region of densities of permutation patterns of size at most k is equal to the number of non-trivial Lyndon permutations of size at most k. The proof exploits an interplay between algebra and combinatorics inherent to the study of Lyndon words.

The q-colour Ramsey number of a k-uniform hypergraph H is the minimum integer N such that any q-colouring of the complete k-uniform hypergraph on N vertices contains a monochromatic copy of H. The study of these numbers is one of the central topics in Combinatorics. In 1973, Erdős and Graham asked to maximise the Ramsey number of a graph as a function of the number of its edges. Motivated by this problem, we study the analogous question for hypergaphs. For fixed $k \ge 3$ and $q \ge 2$ we prove that the largest possible q-colour Ramsey number of a k-uniform hypergraph with m edges is at most $\mathrm{tw}_k(O(\sqrt{m})),$ where tw denotes the tower function. We also present a construction showing that this bound is tight for $q \ge 4$. This resolves a problem by Conlon, Fox and Sudakov. They previously proved the upper bound for $k \geq 4$ and the lower bound for $k=3$. Although in the graph case the tightness follows simply by considering a clique of appropriate size, for higher uniformities the construction is rather involved and is obtained by using paths in expander graphs.

A graph G is called chromatic-choosable if $\chi (G)=ch(G)$. A natural problem is to determine the minimum number of vertices in a non-chromatic-choosable graph with given chromatic number. It was conjectured by Ohba, and proved by Noel, Reed, and Wu that k-chromatic graphs G with $|V(G)| \le 2k+1$ are chromatic-choosable. This upper bound on $|V(G)|$ is tight. It is known that if k is even, then $G=K_{3 \star (k/2+1), 1 \star (k/2-1)}$ and $G=K_{4, 2 \star (k-1)}$ are non-chromatic-choosable k-chromatic graphs with $|V(G)| =2 k+2$. Some subgraphs of these two graphs are also non-chromatic-choosable. The main result of this paper is that all other k-chromatic graphs G with $|V(G)| =2 k+2$ are chromatic-choosable. In particular, if $\chi (G)$ is odd and $|V(G)| \le 2\chi (G)+2$, then G is chromatic-choosable, which was conjectured by Noel.

An extension of Szemerédi’s theorem is proved for sets of positive density in approximate lattices in general locally compact and second countable abelian groups. As a consequence, we establish a recent conjecture of Klick, Strungaru and Tcaciuc. Via a novel version of Furstenberg’s correspondence principle, which should be of independent interest, we show that our Szemerédi theorems can be deduced from a general transverse multiple recurrence theorem, which we establish using a recent work of Austin [Non-conventional ergodic averages for several commuting actions of an amenable group. J. Anal. Math. 130 (2016), 243–274].