The objective of this study is to examine the asymptotic behavior of Betti numbers of Čech complexes treated as stochastic processes and formed from random points in the d-dimensional Euclidean space ${\mathbb{R}}^d$. We consider the case where the points of the Čech complex are generated by a Poisson process with intensity nf for a probability density f. We look at the cases where the behavior of the connectivity radius of the Čech complex causes simplices of dimension greater than $k+1$ to vanish in probability, the so-called sparse regime, as well when the connectivity radius is of the order of $n^{-1/d}$, the critical regime. We establish limit theorems in the aforementioned regimes: central limit theorems for the sparse and critical regimes, and a Poisson limit theorem for the sparse regime. When the connectivity radius of the Čech complex is $o(n^{-1/d})$, i.e. the sparse regime, we can decompose the limiting processes into a time-changed Brownian motion or a time-changed homogeneous Poisson process respectively. In the critical regime, the limiting process is a centered Gaussian process but has a much more complicated representation, because the Čech complex becomes highly connected with many topological holes of any dimension.

In this paper we consider random trees associated with the genealogy of Crump–Mode–Jagers processes and perform Bernoulli bond-percolation whose parameter depends on the size of the tree. Our purpose is to show the existence of a giant percolation cluster for appropriate regimes as the size grows. We stress that the family trees of Crump–Mode–Jagers processes include random recursive trees, preferential attachment trees, binary search trees for which this question has been answered by Bertoin [7], as well as (more general) m-ary search trees, fragmentation trees, and median-of-($2\ell+1$) binary search trees, to name a few, where to our knowledge percolation has not yet been studied.

We consider a simple preferential attachment graph process, which begins with a finite graph and in which a new (t + 1)st vertex is added at each subsequent time step t that is connected to each previous vertex u ≤ t with probability du(t)/t, where du(t) is the degree of u at time t. We analyse the graph obtained as the infinite limit of this process, and we show that, as long as the initial finite graph is neither edgeless nor complete, with probability 1 the outcome will be a copy of the Rado graph augmented with a finite number of either isolated or universal vertices.

We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with ℤ, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent definitions, and we study their ramifications. We also study its expected size and point out certain phase transitions.

Let $X$ be a nonempty set and ${\mathcal{P}}(X)$ the power set of $X$. The aim of this paper is to identify the unital subrings of ${\mathcal{P}}(X)$ and to compute its cardinality when it is finite. It is proved that any topology $\unicode[STIX]{x1D70F}$ on $X$ such that $\unicode[STIX]{x1D70F}=\unicode[STIX]{x1D70F}^{c}$, where $\unicode[STIX]{x1D70F}^{c}=\{U^{c}\mid U\in \unicode[STIX]{x1D70F}\}$, is a unital subring of ${\mathcal{P}}(X)$. It is also shown that $X$ is finite if and only if any unital subring of ${\mathcal{P}}(X)$ is a topology $\unicode[STIX]{x1D70F}$ on $X$ such that $\unicode[STIX]{x1D70F}=\unicode[STIX]{x1D70F}^{c}$ if and only if the set of unital subrings of ${\mathcal{P}}(X)$ is finite. As a consequence, if $X$ is finite with cardinality $n\geq 2$, then the number of unital subrings of ${\mathcal{P}}(X)$ is equal to the $n$th Bell number and the supremum of the lengths of chains of unital subalgebras of ${\mathcal{P}}(X)$ is equal to $n-1$.

Andrews [‘Binary and semi-Fibonacci partitions’, J. Ramanujan Soc. Math. Math. Sci.7(1) (2019), 1–6] recently proved a new identity between the cardinalities of the set of semi-Fibonacci partitions and the set of partitions into powers of 2 with all parts appearing an odd number of times. We extend the identity to the set of semi-$m$-Fibonacci partitions of $n$ and the set of partitions of $n$ into powers of $m$ in which all parts appear with multiplicity not divisible by $m$. We also give a new characterisation of semi-$m$-Fibonacci partitions and some congruences satisfied by the associated number sequence.

The theta graph ${\Theta _{\ell ,t}}$ consists of two vertices joined by t vertex-disjoint paths, each of length $\ell $. For fixed odd $\ell $ and large t, we show that the largest graph not containing ${\Theta _{\ell ,t}}$ has at most ${c_\ell }{t^{1 - 1/\ell }}{n^{1 + 1/\ell }}$ edges and that this is tight apart from the value of ${c_\ell }$.

In this paper, we investigate $\unicode[STIX]{x1D70B}(m,n)$, the number of partitions of the bipartite number$(m,n)$ into steadily decreasing parts, introduced by Carlitz [‘A problem in partitions’, Duke Math. J.30 (1963), 203–213]. We give a relation between $\unicode[STIX]{x1D70B}(m,n)$ and the crank statistic $M(m,n)$ for integer partitions. Using this relation, we establish some uniform asymptotic formulas for $\unicode[STIX]{x1D70B}(m,n)$.

Let c denote the largest constant such that every C6-free graph G contains a bipartite and C4-free subgraph having a fraction c of edges of G. Győri, Kensell and Tompkins showed that 3/8 ⩽ c ⩽ 2/5. We prove that c = 38. More generally, we show that for any ε > 0, and any integer k ⩾ 2, there is a C2k-free graph $G'$ which does not contain a bipartite subgraph of girth greater than 2k with more than a fraction

$$\Bigl(1-\frac{1}{2^{2k-2}}\Bigr)\frac{2}{2k-1}(1+\varepsilon)$$

$G'$

$G''$

$$\Bigl(1-\frac{1}{2^{k-1}}\Bigr)\frac{1}{k-1}(1+\varepsilon)$$

$G''$

One of our proofs uses the following statement, which we prove using probabilistic ideas, generalizing a theorem of Erdős. For any ε > 0, and any integers a, b, k ⩾ 2, there exists an a-uniform hypergraph H of girth greater than k which does not contain any b-colourable subhypergraph with more than a fraction

$$\Bigl(1-\frac{1}{b^{a-1}}\Bigr)(1+\varepsilon)$$

In addition, we give a new and very short proof of a result of Kühn and Osthus, which states that every bipartite C2k-free graph G contains a C4-free subgraph with at least a fraction 1/(k−1) of the edges of G. We also answer a question of Kühn and Osthus about C2k-free graphs obtained by pasting together C2l’s (with k >l ⩾ 3).

We show that a dense subset of a sufficiently large group multiplication table contains either a large part of the addition table of the integers modulo some k, or the entire multiplication table of a certain large abelian group, as a subgrid. As a consequence, we show that triples systems coming from a finite group contain configurations with t triples spanning $ O(\sqrt t )$ vertices, which is the best possible up to the implied constant. We confirm that for all t we can find a collection of t triples spanning at most t + 3 vertices, resolving the Brown–Erdős–Sós conjecture in this context. The proof applies well-known arithmetic results including the multidimensional versions of Szemerédi’s theorem and the density Hales–Jewett theorem.

This result was discovered simultaneously and independently by Nenadov, Sudakov and Tyomkyn [5], and a weaker result avoiding the arithmetic machinery was obtained independently by Wong [11].

We give a complete description of a basis of the extension spaces between indecomposable string and quasi-simple band modules in the module category of a gentle algebra.

In this paper, we study how to distinguish the embedded topology of a smooth quartic and its bitangent lines. In order to do this, we introduce the concept of two-graphs and switching classes from graph theory. This new method improves previous results about a quartic and three bitangent lines considered by E. Artal Bartolo and J. Vallès, four bitangent lines considered by the authors and H. Tokunaga, and enables us to distinguish the embedded topology of a smooth quartic and five or more bitangent lines. As an application, we obtain a new Zariski 5-tuple and a Zariski 9-tuple for arrangements consisting of a smooth quartic and five of its bitangent lines and six of its bitangent lines, respectively.

Recently, Brietzke, Silva and Sellers [‘Congruences related to an eighth order mock theta function of Gordon and McIntosh’, J. Math. Anal. Appl.479 (2019), 62–89] studied the number $v_{0}(n)$ of overpartitions of $n$ into odd parts without gaps between the nonoverlined parts, whose generating function is related to the mock theta function $V_{0}(q)$ of order 8. In this paper we first present a short proof of the 3-dissection for the generating function of $v_{0}(2n)$. Then we establish three congruences for $v_{0}(n)$ along certain progressions which are subsequences of the integers $4n+3$.

We prove that the class of reflexive asymptotic-$c_{0}$ Banach spaces is coarsely rigid, meaning that if a Banach space $X$ coarsely embeds into a reflexive asymptotic-$c_{0}$ space $Y$, then $X$ is also reflexive and asymptotic-$c_{0}$. In order to achieve this result, we provide a purely metric characterization of this class of Banach spaces. This metric characterization takes the form of a concentration inequality for Lipschitz maps on the Hamming graphs, which is rigid under coarse embeddings. Using an example of a quasi-reflexive asymptotic-$c_{0}$ space, we show that this concentration inequality is not equivalent to the non-equi-coarse embeddability of the Hamming graphs.

Let $\unicode[STIX]{x1D707}(m,n)$ (respectively, $\unicode[STIX]{x1D702}(m,n)$) denote the number of odd-balanced unimodal sequences of size $2n$ and rank $m$ with even parts congruent to $2\!\!\hspace{0.6em}{\rm mod}\hspace{0.2em}4$ (respectively, $0\!\!\hspace{0.6em}{\rm mod}\hspace{0.2em}4$) and odd parts at most half the peak. We prove that two-variable generating functions for $\unicode[STIX]{x1D707}(m,n)$ and $\unicode[STIX]{x1D702}(m,n)$ are simultaneously quantum Jacobi forms and mock Jacobi forms. These odd-balanced unimodal rank generating functions are also duals to partial theta functions originally studied by Ramanujan. Our results also show that there is a single $C^{\infty }$ function in $\mathbb{R}\times \mathbb{R}$ to which the errors to modularity of these two different functions extend. We also exploit the quantum Jacobi properties of these generating functions to show, when viewed as functions of the two variables $w$ and $q$, how they can be expressed as the same simple Laurent polynomial when evaluated at pairs of roots of unity. Finally, we make a conjecture which fully characterizes the parity of the number of odd-balanced unimodal sequences of size $2n$ with even parts congruent to $0\!\!\hspace{0.6em}{\rm mod}\hspace{0.2em}4$ and odd parts at most half the peak.

Qi and Chapman [‘Two closed forms for the Bernoulli polynomials’, J. Number Theory159 (2016), 89–100] gave a closed form expression for the Bernoulli polynomials as polynomials with coefficients involving Stirling numbers of the second kind. We extend the formula to the degenerate Bernoulli polynomials, replacing the Stirling numbers by degenerate Stirling numbers of the second kind.

The field of descriptive combinatorics investigates to what extent classical combinatorial results and techniques can be made topologically or measure-theoretically well behaved. This paper examines a class of coloring problems induced by actions of countable groups on Polish spaces, with the requirement that the desired coloring be Baire measurable. We show that the set of all such coloring problems that admit a Baire measurable solution for a particular free action $\unicode[STIX]{x1D6FC}$ is complete analytic (apart from the trivial situation when the orbit equivalence relation induced by $\unicode[STIX]{x1D6FC}$ is smooth on a comeager set); this result confirms the ‘hardness’ of finding a topologically well-behaved coloring. When $\unicode[STIX]{x1D6FC}$ is the shift action, we characterize the class of problems for which $\unicode[STIX]{x1D6FC}$ has a Baire measurable coloring in purely combinatorial terms; it turns out that closely related concepts have already been studied in graph theory with no relation to descriptive set theory. We remark that our framework permits a wholly dynamical interpretation (with colorings corresponding to equivariant maps to a given subshift), so this article can also be viewed as a contribution to generic dynamics.

Let $\overline{t}(n)$ be the number of overpartitions in which (i) the difference between successive parts may be odd only if the larger part is overlined and (ii) if the smallest part is odd then it is overlined. Ramanujan-type congruences for $\overline{t}(n)$ modulo small powers of $2$ and $3$ have been established. We present two infinite families of congruences modulo $5$ and $27$ for $\overline{t}(n)$, the first of which generalises a recent result of Chern and Hao [‘Congruences for two restricted overpartitions’, Proc. Math. Sci. 129 (2019), Article 31].

We construct an $S_{3}$-symmetric probability distribution on $\{(a,b,c)\in \mathbb{Z}_{{\geqslant}0}^{3}\,:\,a+b+c=n\}$ such that its marginal achieves the maximum entropy among all probability distributions on $\{0,1,\ldots ,n\}$ with mean $n/3$. Existence of such a distribution verifies a conjecture of Kleinberg et al. [‘The growth rate of tri-colored sum-free sets’, Discrete Anal. (2018), Paper No. 12, arXiv:1607.00047v1], which is motivated by the study of sum-free sets.

Let $M$ be a regular matroid. The Jacobian group $\text{Jac}(M)$ of $M$ is a finite abelian group whose cardinality is equal to the number of bases of $M$. This group generalizes the definition of the Jacobian group (also known as the critical group or sandpile group) $\operatorname{Jac}(G)$ of a graph $G$ (in which case bases of the corresponding regular matroid are spanning trees of $G$). There are many explicit combinatorial bijections in the literature between the Jacobian group of a graph $\text{Jac}(G)$ and spanning trees. However, most of the known bijections use vertices of $G$ in some essential way and are inherently ‘nonmatroidal’. In this paper, we construct a family of explicit and easy-to-describe bijections between the Jacobian group of a regular matroid $M$ and bases of $M$, many instances of which are new even in the case of graphs. We first describe our family of bijections in a purely combinatorial way in terms of orientations; more specifically, we prove that the Jacobian group of $M$ admits a canonical simply transitive action on the set ${\mathcal{G}}(M)$ of circuit–cocircuit reversal classes of $M$, and then define a family of combinatorial bijections $\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D70E},\unicode[STIX]{x1D70E}^{\ast }}$ between ${\mathcal{G}}(M)$ and bases of $M$. (Here $\unicode[STIX]{x1D70E}$ (respectively $\unicode[STIX]{x1D70E}^{\ast }$) is an acyclic signature of the set of circuits (respectively cocircuits) of $M$.) We then give a geometric interpretation of each such map $\unicode[STIX]{x1D6FD}=\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D70E},\unicode[STIX]{x1D70E}^{\ast }}$ in terms of zonotopal subdivisions which is used to verify that $\unicode[STIX]{x1D6FD}$ is indeed a bijection. Finally, we give a combinatorial interpretation of lattice points in the zonotope $Z$; by passing to dilations we obtain a new derivation of Stanley’s formula linking the Ehrhart polynomial of $Z$ to the Tutte polynomial of $M$.