We correct typographical errors in our original paper.

Let $\mathcal {O}(\pi )$ denote the number of odd parts in an integer partition $\pi$. In 2005, Stanley introduced a new statistic $\operatorname {srank}(\pi )=\mathcal {O}(\pi )-\mathcal {O}(\pi ')$, where $\pi '$ is the conjugate of $\pi$. Let $p(r,\,m;n)$ denote the number of partitions of $n$ with srank congruent to $r$ modulo $m$. Generating function identities, congruences and inequalities for $p(0,\,4;n)$ and $p(2,\,4;n)$ were then established by a number of mathematicians, including Stanley, Andrews, Swisher, Berkovich and Garvan. Motivated by these works, we deduce some generating functions and inequalities for $p(r,\,m;n)$ with $m=16$ and $24$. These results are refinements of some inequalities due to Swisher.

In this paper we study the existence of higher dimensional arithmetic progressions in Meyer sets. We show that the case when the ratios are linearly dependent over ${\mathbb Z}$ is trivial and focus on arithmetic progressions for which the ratios are linearly independent. Given a Meyer set $\Lambda $ and a fully Euclidean model set with the property that finitely many translates of cover $\Lambda $ , we prove that we can find higher dimensional arithmetic progressions of arbitrary length with k linearly independent ratios in $\Lambda $ if and only if k is at most the rank of the ${\mathbb Z}$ -module generated by . We use this result to characterize the Meyer sets that are subsets of fully Euclidean model sets.

We show that if w is a multilinear commutator word and G a finite group in which every metanilpotent subgroup generated by w-values is of rank at most r, then the rank of the verbal subgroup $w(G)$ is bounded in terms of r and w only. In the case where G is soluble, we obtain a better result: if G is a finite soluble group in which every nilpotent subgroup generated by w-values is of rank at most r, then the rank of $w(G)$ is at most $r+1$ .

The following bare-bones story introduces the idea of a cumulative hierarchy of pure sets: ‘Sets are arranged in stages. Every set is found at some stage. At any stage S: for any sets found before S, we find a set whose members are exactly those sets. We find nothing else at S’. Surprisingly, this story already guarantees that the sets are arranged in well-ordered levels, and suffices for quasi-categoricity. I show this by presenting Level Theory, a simplification of set theories due to Scott, Montague, Derrick, and Potter.

Let $T = (T_1, \ldots , T_n)$ be a commuting tuple of bounded linear operators on a Hilbert space $\mathcal{H}$. The multiplicity of $T$ is the cardinality of a minimal generating set with respect to $T$. In this paper, we establish an additive formula for multiplicities of a class of commuting tuples of operators. A special case of the main result states the following: Let $n \geq 2$, and let $\mathcal{Q}_i$, $i = 1, \ldots , n$, be a proper closed shift co-invariant subspaces of the Dirichlet space or the Hardy space over the unit disc in $\mathbb {C}$. If $\mathcal{Q}_i^{\bot }$, $i = 1, \ldots , n$, is a zero-based shift invariant subspace, then the multiplicity of the joint $M_{\textbf {z}} = (M_{z_1}, \ldots , M_{z_n})$-invariant subspace $(\mathcal{Q}_1 \otimes \cdots \otimes \mathcal{Q}_n)^{\perp }$ of the Dirichlet space or the Hardy space over the unit polydisc in $\mathbb {C}^{n}$ is given by

\[ \mbox{mult}_{M_{\textbf{{z}}}|_{ (\mathcal{Q}_1 \otimes \cdots \otimes \mathcal{Q}_n)^{{\perp}}}} (\mathcal{Q}_1 \otimes \cdots \otimes \mathcal{Q}_n)^{{\perp}} = \sum_{i=1}^{n} (\mbox{mult}_{M_z|_{\mathcal{Q}_i^{{\perp}}}} (\mathcal{Q}_i^{\bot})) = n. \]

Potentialists think that the concept of set is importantly modal. Using tensed language as a heuristic, the following bare-bones story introduces the idea of a potential hierarchy of sets: ‘Always: for any sets that existed, there is a set whose members are exactly those sets; there are no other sets’. Surprisingly, this story already guarantees well-foundedness and persistence. Moreover, if we assume that time is linear, the ensuing modal set theory is almost definitionally equivalent with non-modal set theories; specifically, with Level Theory, as developed in Part 1.

What is status? How does it work? What effects does it tend to have? A new wave of scholarship on status in international relations has converged on a central definition of status, several causal pathways, and the claim that the pursuit of status tends to produce conflict. The authors take stock of the status literature and argue that this convergence is not only a sign of progress, but also an obstacle to it. They find that the consensus definition conceals critical contradictions between standing and membership, that its causal pathways are promising but often in tension with each other, and that the literature may be overlooking the ways in which status can help states avoid conflict and promote cooperation under certain conditions.

Let r be an integer with 2 ≤ r ≤ 24 and let pr(n) be defined by $\sum _{n=0}^\infty p_r(n) q^n = \prod _{k=1}^\infty (1-q^k)^r$. In this paper, we provide uniform methods for discovering infinite families of congruences and strange congruences for pr(n) by using some identities on pr(n) due to Newman. As applications, we establish many infinite families of congruences and strange congruences for certain partition functions, such as Andrews's smallest parts function, the coefficients of Ramanujan's ϕ function and p-regular partition functions. For example, we prove that for n ≥ 0,

\[ \textrm{spt}\bigg( \frac{1991n(3n+1) }{2} +83\bigg) \equiv \textrm{spt}\bigg(\frac{1991n(3n+5)}{2} +2074\bigg) \equiv 0\ (\textrm{mod} \ 11), \]

\[ \textrm{spt}\bigg( \frac{143\times 5^{6k} +1 }{24}\bigg)\equiv 2^{k+2} \ (\textrm{mod}\ 11), \]

A digraph is called oriented if there is at most one arc between two distinct vertices. An oriented graph $D$ is nonsingular if its adjacency matrix $A(D)$ is nonsingular. We characterise all nonsingular oriented graphs from three classes: graphs in which cycles are vertex disjoint, graphs in which all cycles share exactly one common vertex and graphs formed by cycles sharing a common path. As a straightforward corollary, the singularity of oriented bicyclic graphs is determined.