Related papers: Antichains and counterpoint dichotomies
The (bitwise) complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An $\textit{antisquare}$ is a nonempty word of the form $x\, \overline{x}$. In this paper, we study infinite binary…
We obtain a criterion for an analytic subset of a Euclidean space to contain points of differentiability of a typical Lipschitz function, namely, that it cannot be covered by countably many sets, each of which is closed and purely…
The class of all subdirectly irreducible groups belonging to a variety generated by a finite nilpotent group can be axiomatised by a finite set of elementary sentences.
It is shown that a group defined by forbidding all patterns of size s+1 that do not appear in a given self-similar group of tree automorphisms is the topological closure of a self-similar, countable, regular branch group, branching over its…
In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result by Deligne which is due to Chapoton, and the goal of this…
The strong symmetric genus of a finite group is the minimum genus of a compact Riemann surface on which the group acts as a group of automorphisms preserving orientation. A characterization of the infinite number of groups with strong…
This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contains a subgraph that is isomorphic to a specified graph H.…
We compute for reflection groups of type $A,B,D,F_4,H_3$ and for dihedral groups a statistic counting the maximal cardinality of a set of elements in the group whose generalized inversions yield the full set of inversions and which are…
We provide precise asymptotics for the number of antichains in the poset $\{0,1,2\}^n$, answering a question of Sapozhenko. Finding improved estimates for this number was also a problem suggested by Noel, Scott, and Sudakov, who obtained…
We construct irreducible hyperfinite subfactors of index 6 with a prescribed fundamental group from a large family containing all countable and many uncountable subgroups of R_+. We also prove that there are unclassifiably many irreducible…
Denote by $\continuum=2^{\aleph_0}$ the cardinal of continuum. We construct an intriguing family $(P_\alpha: \alpha\in\continuum)$ of prime $z$-ideals in $\C_0(\reals)$ with the following properties: If $f\in P_{i_0}$ for some…
We obtain several results concerning the concept of isotypic structures. Namely we prove that any field of finite transcendence degree over a prime subfield is defined by types; then we construct isotypic but not isomorphic structures with…
A graph class is monotone if it is closed under taking subgraphs. It is known that a monotone class defined by finitely many obstructions has bounded treewidth if and only if one of the obstructions is a so-called tripod, that is, a…
We prove some nice properties of anti-homomorphisms, some of which are analogic to that of homomorphisms. Meanwhile, we develop a new kind of composition called $*$-composition such that the $*$-composition of two anti-homomorphisms is…
Let a cluster be a term with a number of patterns occurring in it. We give two accounts of clusters, a geometric one as sets of (node and edge) positions, and an inductive one as pairs of terms with gaps (2nd order variables) and…
We study the general problem of extremality for metric Diophantine approximation on submanifolds of matrices. We formulate a criterion for extremality in terms of a certain family of algebraic obstructions and show that it is sharp. In…
We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…
Higher order set theory has been a topic of interest for some time, with recent efforts focused on the strength of second order set theories [KW16]. In this paper we strive to present one 'theory of collections' that allows for a formal…
We prove a new, efficient version of the hypergraph container theorems that is suited for hypergraphs with large uniformities. The main novelty is a refined approach to constructing containers that employs simple ideas from high-dimensional…
We produce a simple group $G$ of cardinality $\aleph_1$ which is Artinian (every strictly descending chain of subgroups is finite), satisfies a Burnside law and such that for each uncountable subset $Y \subseteq G$ there exists a natural…