Related papers: A note on $m$-factorizations of complete multigrap…
We completely classify the locally finite, infinite graphs with pure mapping class groups admitting a coarsely bounded generating set. We also study algebraic properties of the pure mapping class group: We establish a semidirect product…
We describe constructions of infinite graphs which are not representable as integral graphs in the plane, addressing a question of Erd\H{o}s. We also mention some related problems.
Given an infinity-category C, one can naturally construct an infinity-category Fam(C) of families of objects in C indexed by infinity-groupoids. An ordinary categorical version of this construction was used by Borceux and Janelidze in the…
This is the first one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple linear groups.
Non-trivial $2$-$(k^{2},k,\lambda )$ designs, with $\lambda \mid k$, admitting a flag-transitive almost simple automorphism group are classified.
We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…
Let $G$ be a group. The subsets $A_1,\ldots,A_k$ of $G$ form a complete factorization of group $G$ if if they are pairwise disjoint and each element $g\in G$ is uniquely represented as $g=a_1\ldots a_k$, with $a_i\in A_i$. We prove the…
In arXiv:1207.0332 [cs.LO] was proposed a graphic lambda calculus formalism, which has sectors corresponding to untyped lambda calculus and emergent algebras. Here we explore the sector covering knot diagrams, which are constructed as…
A new infinite family of bipartite cubic 3-arc transitive graphs is constructed and studied. They provide the first known examples admitting a 2-arc transitive vertex-biquasiprimitive group of automorphisms for which the index two subgroup…
Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.
The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…
A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G(1), \ldots , G(k)$. It is called an $r$-factorization if every $G(i)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
We show how to construct a family of groups with simple commutator subgroups from aperiodic 1-vertex, finitely aligned higher rank graphs (which are, in fact, a class of cancellative monoids). Inverse semigroups form the intermediary…
We associate each endomorphism of a finite cyclic group with a digraph and study many properties of this digraph, including its adjacent matrix and automorphism group.
This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…
In this paper, we introduce two new families of infinite-dimensional simple Lie algebras and a new family of infinite-dimensional simple Lie superalgebras. These algebras can be viewed as generalizations of the Block algebras.
We construct a new infinite family of quiver gauge theories which blow down to the X^{p,q} quiver gauge theories found by Hanany, Kazakopoulos and Wecht. This family includes a quiver gauge theory for the third del Pezzo surface. We show,…
This is the third one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with orthogonal groups in odd dimension.
We introduce and develop a language of semigroups over the braid groups for a study of braid monodromy factorizations (bmf's) of plane algebraic curves and other related objects. As an application we give a new proof of Orevkov's theorem on…