SearcharxivSearch

arXiv subjects

Karl Auinger

Publications and source records attributed to Karl Auinger.

6 recordsLinked to original sources

Combinatorial skeletons of 2-cobordism and annular categories with applications to equational logic

We introduce a complete set of combinatorial data that encode the category $2\mathfrak{Cob}$ of all $2$-cobordisms. As an application, we show that the local monoids of $2\mathfrak{Cob}$ do not have finitely axiomatizable equational theories. As yet another application, we construct a von-Neumann-regular extension of this category. Similar results are provided for the topological annular category and various quotients of the latter, like the affine Temperley--Lieb category.

math.CT

Formations of finite groups with the M. Hall property

The first examples of formations which are arboreous (and therefore Hall) but not freely indexed (and therefore not locally extensible) are found. Likewise, the first examples of solvable formations which are freely indexed and arboreous (and therefore Hall) but not locally extensible are constructed. Some open questions are also mentioned.

math.GR

The Finite Basis Problem for Kauffman Monoids

We prove a sufficient condition under which a semigroup admits no finite identity basis. As an application, it is shown that the identities of the Kauffman monoid $\mathcal{K}_n$ are nonfinitely based for each $n\ge 3$. This result holds also for the case when $\mathcal{K}_n$ is considered as an involution semigroup under either of its natural involutions.

math.GR

Unary enhancements of inherently nonfinitely based semigroups

We exhibit a simple condition under which a finite involutary semigroup whose semigroup reduct is inherently nonfinitely based is also inherently nonfinitely based as a unary semigroup. As applications, we get already known as well as new examples of inherently nonfinitely based involutory semigroups. We also show that for finite regular semigroups, our condition is not only sufficient but also necessary for the property of being inherently nonfinitely based to persist. This leads to an algorithmic description of regular inherently nonfinitely based involutory semigroups.

math.GR