arXiv subjects

K. Auinger

Publications and source records attributed to K. Auinger.

7 recordsLinked to original sources

arXiv2025

Finite approximation of free groups II: the Theorems of Ash, Herwig-Lascar and Ribes-Zalesskii -- revisited and strengthened

Relations and interactions between the theorems of Ash, Herwig--Lascar and Ribes--Zalesskii are discussed and it is shown that these three theorems are equivalent in the sense that each of them can be derived from each other one. Some strengthenings of these theorems are obtained with the use of groups provided by a construction of the third author. Evidence is given that these strengthenings are substantially stronger than the classical results. Yet, it turns out that both kinds of results can be interpreted as different instances of the same common scheme, namely as \emph{finite approximation of free groups}.

math.GR↗

arXiv2022

Finite approximation of free groups I: the $F$-inverse cover problem

For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of generators (i.e.~edges). As a consequence, every element $g\in G$ admits a unique minimal set $\mathrm{C}(g)$ of edges (the \emph{content} of $g$) needed to represent $g$ as a word over $\mathrm{C}(g)\cup\mathrm{C}(g)^{-1}$. The crucial property of the group $G$ is that connectivity in the graph $\mathcal{E}$ is encoded in $G$ in the following sense: if a word $p$ forms a path $u\longrightarrow v$ in $\mathcal{E}$ then there exists a $G$-equivalent word $q$ which also forms a path $u\longrightarrow v$ and uses only edges from their content; in particular, the content of the corresponding group element $[p]_G=[q]_G$ spans a connected subgraph of $\mathcal{E}$ containing the vertices $u$ and $v$. As the free group generated by $E$ obviously has these properties, the construction provides another instance of how certain features of free groups can be ``approximated'' or ``simulated'' in finite groups. As an application it is shown that every finite inverse monoid admits a finite $F$-inverse cover. This solves a long-standing problem of Henckell and Rhodes.

math.GR↗

arXiv2021

Cross-connection structure of locally inverse semigroups

Locally inverse semigroups are regular semigroups whose idempotents form pseudo-semilattices. We characterise the categories that correspond to locally inverse semigroups in the realm of Nambooripad's cross-connection theory. Further, we specialise our cross-connection description of locally inverse semigroups to inverse semigroups and completely 0-simple semigroups, obtaining structure theorems for these classes. In particular, we show that the structure theorem for inverse semigroups can be obtained using only one category, quite analogous to the Ehresmann-Schein-Nambooripad Theorem; for completely 0-simple semigroups, we show that cross-connections coincide with structure matrices, thus recovering the Rees Theorem by categorical tools.

math.GR↗

arXiv2019

$F$-inverse monoids as algebraic structures in enriched signature

Every $F$-inverse monoid can be equipped with the unary operation which maps each element to the maximum element of its $\sigma$-class. In this enriched signature, the class of all $F$-inverse monoids forms a variety of algebraic structures. We describe universal objects in several classes of $F$-inverse monoids, in particular free $F$-inverse monoids. More precisely, for every $X$-generated group $G$ we describe the initial object in the category of all $X$-generated $F$-inverse monoids $F$ for which $F/\sigma=G$.

math.GR↗

arXiv2016

The geometry of profinite graphs revisited

For a formation $\mathfrak{F}$ of finite groups, tight connections are established between the pro-$\mathfrak{F}$-topology of a finitely generated free group $F$ and the geometry of the Cayley graph $Γ(\hat{F_{\mathfrak{F}}})$ of the pro-$\mathfrak{F}$-completion $\hat{F_{\mathfrak {F}}}$ of $F$. For example, the Ribes--Zalesskii-Theorem is proved for the pro-$\mathfrak{F}$-topology of $F$ in case $Γ(\hat{F_{\mathfrak F}})$ is a tree-like graph. All these results are established by purely geometric proofs, without the use of inverse monoids which were indispensable in earlier papers, thereby giving more direct and more transparent proofs. Due to the richer structure provided by formations (compared to varieties), new examples of (relatively free) profinite groups with tree-like Cayley graphs are constructed. Thus, new topologies on $F$ are found for which the Ribes-Zalesskii-Theorem holds.

math.GR↗

arXiv2013

On the variety of strict pseudosemilattices

A new model, in terms of finite bipartite graphs, of the free pseudosemilattice is presented. This will then be used to obtain several results about the variety SPS of all strict pseudosemilattices: (i) an identity basis for SPS is found, (ii) SPS is shown to be inherently non-finitely based, (iii) SPS is shown to have no irredundant identity basis, and (iv) SPS is shown to have no covers and to be meet-prime in the lattice of all varieties of pseudosemilattices. Some applications to e-varieties of locally inverse semigroups are also derived.

math.RA↗

arXiv2012

On the power pseudovariety $\mathbf{PCS}$

Some new semantic and syntactic characterizations of the members of the power pseudovariety $\mathbf{PCS}$ are obtained. This leads in particular to new algorithms for deciding membership in $\mathbf{PCS}$.

math.GR↗