Related papers: The Reconstruction of Cycle-free Partial Orders fr…
Bojanczyk and Pilipczuk showed in their celebrated article "Definability equals recognizability for graphs of bounded treewidth" (LICS 2016) that monadic second-order logic can define tree-decompositions in graphs of bounded treewidth. This…
We like to build Abelian groups (or R-modules) which on the one hand are quite free, say $\aleph_{\omega + 1}$-free, and on the other hand, are complicated in suitable sense. We choose as our test problem having no non-trivial homomorphism…
We study orbit codes in the field extension ${\mathbb F}_{q^n}$. First we show that the automorphism group of a cyclic orbit code is contained in the normalizer of the Singer subgroup if the orbit is generated by a subspace that is not…
Let $\phi \in \mbox{Out}(F_n)$ be a free group outer automorphism that can be represented by an expanding, irreducible train-track map. The automorphism $\phi$ determines a free-by-cyclic group $\Gamma=F_n \rtimes_\phi \mathbb Z,$ and a…
We study congruences on the partial automorphism monoid of a finite rank free group action. We give a decomposition of a congruence on this monoid into a Rees congruence, a congruence on a Brandt semigroup and an idempotent separating…
We prove a general result concerning cyclic orderings of the elements of a matroid. For each matroid $M$, weight function $\omega:E(M)\rightarrow\mathbb{N}$, and positive integer $D$, the following are equivalent. (1) For all $A\subseteq…
We study a class $\mathfrak{M}$ of cyclically presented groups that includes both finite and infinite groups and is defined by a certain combinatorial condition on the defining relations. This class includes many finite metacyclic…
We study automorphism groups of fibered surfaces for finite cyclic covering fibrations of an elliptic surface. We estimate the order of a finite subgroup of automorphism groups in terms of the genus of the fiber, the genus of the base…
We give an explicit description of the free objects in the quasivariety of adequate semigroups, as sets of labelled directed trees under a natural combinatorial multiplication. The morphisms of the free adequate semigroup onto the free…
We show that tree almost automorphism groups, including Neretin groups, satisfy the analogue of the $F_\infty$-finiteness condition in the world of totally disconnected groups: They possess a cellular action on a contractible cellular…
Using Frobenius normal forms of matrices over finite fields as well as the Burnside Basis Theorem, we give a direct proof of Horo\v{s}evski\u{i}'s result that every automorphism $\alpha$ of a finite nilpotent group has a cycle whose length…
We compute explicitly the automorphism and outer automorphism group of all large-type free-of-infinity Artin groups. Our strategy involves reconstructing the associated Deligne complexes in a purely algebraic manner, i.e. in a way that is…
A finite tree $T$ with $|V(T)| \geq 2$ is called {\it automorphism-free} if there is no non-trivial automorphism of $T$. Let $\mathcal{AFT}$ be the poset with the element set of all finite automorphism-free trees (up to graph isomorphism)…
Connected acyclic graphs (trees) are data objects that hierarchically organize categories. Collections of trees arise in a diverse variety of fields, including evolutionary biology, public health, machine learning, social sciences and…
We define several "standard" subgroups of the automorphism group Aut(G) of a partially commutative (right-angled Artin) group and use these standard subgroups to describe decompositions of Aut(G). If C is the commutation graph of G, we show…
We define analogues of the graphs of free splittings, of cyclic splittings, and of maximally-cyclic splittings of $F_N$ for free products of groups, and show their hyperbolicity. Given a countable group $G$ which splits as…
We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…
We show that the group of type-preserving automorphisms of any irreducible semi-regular thick right-angled building is abstractly simple. When the building is locally finite, this gives a large family of compactly generated (abstractly)…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
In a previous paper [1] [MR4101040], we initiated a systematic study of semihypergroups and had a thorough discussion about some important analytic and algebraic objects associated to this class of objects. In this paper, we investigate…