Related papers: Conway groupoids, regular two-graphs and supersimp…

Given an adaptable separated graph, we construct an associated groupoid and explore its type semigroup. Specifically, we first attach to each adaptable separated graph a corresponding semigroup, which we prove is an $E^*$-unitary inverse…

Let G be a group. The intersection graph G(G) of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G; and there is an edge between two distinct…

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

We uncover 2-group symmetries in 6d superconformal field theories. These symmetries arise when the discrete 1-form symmetry and continuous flavor symmetry group of a theory mix with each other. We classify all 6d superconformal field…

For every spatial embedding of each graph in the Petersen family, it is known that the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2. In this paper, we give an integral lift of this…

The intersection pattern of the translates of the limit set of a quasi-convex subgroup of a hyperbolic group can be coded in a natural incidence graph, which suggests connections with the splittings of the ambient group. A similar incidence…

In this article, we investigate symmetric $(v,k,\lambda)$ designs $\mathcal{D}$ with $\lambda$ prime admitting flag-transitive and point-primitive automorphism groups $G$. We prove that if $G$ is an almost simple group with socle a finite…

In this paper, we continue our study of the class of diagram groups. Simply speaking, a diagram is a labelled plane graph bounded by a pair of paths (the top path and the bottom path). To multiply two diagrams, one simply identifies the top…

For every dimension d, there is an infinite family of convex co-compact reflection groups of isometries of hyperbolic d-space --- the superideal (simplicial and cubical) reflection groups --- with the property that a random group at any…

In addition to superconformal symmetry, (1,1) supersymmetric two-dimensional sigma models on special holonomy manifolds have extra symmetries that are in one-to-one correspondence with the covariantly constant forms on these manifolds. The…

In this paper, we give a complete, two-way characterization, of when a noncommutative crossed product $A \rtimes_\lambda G$ is simple, in the case of $G$ being an FC-hypercentral group. This is a large class of amenable groups that contains…

We construct a family of smooth supersingular curves of genus $5$ in characteristic $2$ with several notable features: its dimension matches the expected dimension of any component of the supersingular locus in genus $5$, its members are…

Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…

A group is boundedly simple if, for some constant N, every nontrivial conjugacy class generates the whole group in N steps. For a large class of trees, Tits proved simplicity of a canonical subgroup of the automorphism group, which is…

Let $\mathcal{S}$ be a family of sets with VC-codensity less than $2$. We prove that, if $\mathcal{S}$ has the $(\omega, 2)$-property (for any infinitely many sets in $\mathcal{S}$, at least $2$ among them intersect), then $\mathcal{S}$ can…

We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of…

We explore the dynamics of a simple class of two-dimensional models with $(0,1)$ supersymmetry, namely sigma-models with target $S^3$ and the minimal possible set of fields. For any nonzero value of the Wess--Zumino coupling $k$, we…

Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of…

We present a simple construction which associates to every Garside group a metric space, called the additional length complex, on which the group acts. These spaces share important features with curve complexes: they are…

The language of graph theory, or network science, has proven to be an exceptional tool for addressing myriad problems in neuroscience. Yet, the use of networks is predicated on a critical simplifying assumption: that the quintessential unit…