Related papers: Grid diagrams for higher-dimensional Thompson's gr…
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…
A new family of groups, called trickle groups, is presented. These groups generalize right-angled Artin and Coxeter groups, as well as cactus groups. A trickle group is defined by a presentation with relations of the form $xy = zx$ and…
Many real-world phenomena are naturally modeled by graphs and networks. However, classical graph models are often limited to pairwise interactions and may not adequately capture the richer structures that arise in practice. Higher-order…
Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…
Generalized pseudo-Hamiltonian normal forms (GPHNF) and an effective method of obtaining them are introduced for two-dimensional systems of autonomous ODEs with a Hamiltonian quasi-homogeneous unperturbed part of an arbitrary degree. The…
We show that R. Thompson's group $T$ is a maximal subgroup of the group $V$. The argument provides examples of foundational calculations which arise when expressing elements of $V$ as products of transpositions of basic clopen sets in…
Graph Neural Networks (GNNs) have emerged as powerful tools for learning representations of graph-structured data, demonstrating remarkable performance across various tasks. Recognising their importance, there has been extensive research…
For any n>3, we give a family of finite dimensional irreducible representations of the braid group B_n. Moreover, we give a subfamily parametrized by 0<m<n of dimension the combinatoric number (n,m). The representation obtained in the case…
A string diagram is a two-dimensional graphical representation that can be described as a one-dimensional term generated from a set of primitives using sequential and parallel compositions. Since different syntactic terms may represent the…
We adapt the Ping-Pong Lemma, which historically was used to study free products of groups, to the setting of the homeomorphism group of the unit interval. As a consequence, we isolate a large class of generating sets for subgroups of…
We extend the concept of two-way forest diagrams, introduced by Belk and Brown in 2003, to represent elements of $F(n)$ as a pair of infinite, bounded $n$-ary forests together with an order-preserving bijection of the leaves. This…
Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…
We show that the baker's map is a product of transpositions (particularly pleasant involutions), and conclude from this that an existing very short proof of the simplicity of Thompson's group V applies with equal brevity to the higher…
In this note we first consider a ternary matrix group related to the von Neumann regular semigroups and to the Artin braid group (in an algebraic way). The product of a special kind of ternary matrices (idempotent and of finite order)…
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…
We define an infinite sequence of new invariants, delta_n, of a group G that measure the size of the successive quotients of the derived series of G. In the case that G is the fundamental group of a 3-manifold, we obtain new 3-manifold…
We prove that the Brin-Thompson groups sV, also called higher dimensional Thompson's groups, are of type F_\infty for all natural numbers s. This result was previously shown for s up to 3, by considering the action of sV on a naturally…
We give sufficient conditions for left- and bi-orderability of fundamental groups of Ore categories in terms of indirect factors, including Thompson groups and many of their generalizations. Besides recovering known results, we prove that…
A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.
Recently there has been growing interest in discrete homotopies and homotopies of graphs beyond treating graphs as 1-dimensional simplicial spaces. One such type of homotopy is $\times$-homotopy. Recent work by Chih-Scull has developed a…