Searcharxiv⌕ Search

arXiv subjects

Benjamin Steinberg

Publications and source records attributed to Benjamin Steinberg.

At least 91 records · Page 5Linked to original sources
arXiv2011

Double Catalan monoids

In this paper we define and study what we call the double Catalan monoid. This monoid is the image of a natural map from the 0-Hecke monoid to the monoid of binary relations. We show that the double Catalan monoid provides an algebraization of the (combinatorial) set of 4321-avoiding permutations and relate its combinatorics to various off-shoots of both the combinatorics of Catalan numbers and the combinatorics of permutations. In particular, we give an algebraic interpretation of the first derivative of the Kreweras involution on Dyck paths, of 4321-avoiding involutions and of recent results of Barnabei {\em et al.} on admissible pairs of Dyck paths. We compute a presentation and determine the minimal dimension of an effective representation for the double Catalan monoid. We also determine the minimal dimension of an effective representation for the 0-Hecke monoid.

math.GR↗
arXiv2011

The Krohn-Rhodes Theorem and Local Divisors

We give a new proof of the Krohn-Rhodes Theorem using local divisors. The proof provides nearly as good a decomposition in terms of size as the holonomy decomposition of Eilenberg, avoids induction on the size of the state set, and works exclusively with monoids with the base case of the induction being that of a group.

math.GR↗
arXiv2011

Quivers of monoids with basic algebras

We compute the quiver of any monoid that has a basic algebra over an algebraically closed field of characteristic zero. More generally, we reduce the computation of the quiver over a splitting field of a class of monoids that we term rectangular monoids (in the semigroup theory literature the class is known as $\mathbf{DO}$) to representation theoretic computations for group algebras of maximal subgroups. Hence in good characteristic for the maximal subgroups, this gives an essentially complete computation. Since groups are examples of rectangular monoids, we cannot hope to do better than this. For the subclass of $\mathscr R$-trivial monoids, we also provide a semigroup theoretic description of the projective indecomposables and compute the Cartan matrix.

math.RT↗
arXiv2011

Geometric Semigroup Theory

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups and automata lead to simplifications of the graphs on which the corresponding finite semigroups act. We show in particular that every finite semigroup can be finitely expanded so that the expansion acts on a labeled directed graph which resembles the right Cayley graph of a free Burnside semigroup in many respects.

math.GR↗
arXiv2010

Characterizations of Morita equivalent inverse semigroups

We prove that four different notions of Morita equivalence for inverse semigroups motivated by, respectively, $C^{\ast}$-algebra theory, topos theory, semigroup theory and the theory of ordered groupoids are equivalent. We also show that the category of unitary actions of an inverse semigroup is monadic over the category of étale actions. Consequently, the category of unitary actions of an inverse semigroup is equivalent to the category of presheaves on its Cauchy completion. More generally, we prove that the same is true for the category of closed actions, which is used to define the Morita theory in semigroup theory, of any semigroup with right local units.

math.CT↗
arXiv2010

The averaging trick and the Cerny conjecture

The results of several papers concerning the Černý conjecture are deduced as consequences of a simple idea that I call the averaging trick. This idea is implicitly used in the literature, but no attempt was made to formalize the proof scheme axiomatically. Instead, authors axiomatized classes of automata to which it applies.

cs.FL↗
arXiv2010

A Theory of Transformation Monoids: Combinatorics and Representation Theory

The aim of this paper is to develop a theory of finite transformation monoids and in particular to study primitive transformation monoids. We introduce the notion of orbitals and orbital digraphs for transformation monoids and prove a monoid version of D. Higman's celebrated theorem characterizing primitivity in terms of connectedness of orbital digraphs. A thorough study of the module (or representation) associated to a transformation monoid is initiated. In particular, we compute the projective cover of the transformation module over a field of characteristic zero in the case of a transitive transformation or partial transformation monoid. Applications of probability theory and Markov chains to transformation monoids are also considered and an ergodic theorem is proved in this context. In particular, we obtain a generalization of a lemma of P. Neumann, from the theory of synchronizing groups, concerning the partition associated to a transformation of minimal rank.

math.CO↗
arXiv2010

Representation Theory of Finite Semigroups over Semirings

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the results for a field. Special attention is paid to the boolean semiring, where we also characterize the simple representations and introduce the beginnings of a character theory.

math.RA↗
arXiv2009

Profinite Groups Associated to Sofic Shifts are Free

We show that the maximal subgroup of the free profinite semigroup associated by Almeida to an irreducible sofic shift is a free profinite group, generalizing an earlier result of the second author for the case of the full shift (whose corresponding maximal subgroup is the maximal subgroup of the minimal ideal). A corresponding result is proved for certain relatively free profinite semigroups. We also establish some other analogies between the kernel of the free profinite semigroup and the $\J$-class associated to an irreducible sofic shift.

math.GR↗
arXiv2009

Semigroup Actions, Covering Spaces and Schutzenberger Groups

We associate a 2-complex to the following data: a presentation of a semigroup $S$ and a transitive action of $S$ on a set $V$ by partial transformations. The automorphism group of the action acts properly discontinuously on this 2-complex. A sufficient condition is given for the 2-complex to be simply connected. As a consequence we obtain simple topological proofs of results on presentations of Schützenberger groups. We also give a geometric proof that a finitely generated regular semigroup with finitely many idempotents has polynomial growth if and only if all its maximal subgroups are virtually nilpotent.

math.GR↗
arXiv2009

An automata theoretic approach to the generalized word problem in graphs of groups

We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups in which edge groups are polycyclic-by-finite and vertex groups are either locally quasiconvex hyperbolic or polycyclic-by-finite and so in particular chordal graph groups (right-angled Artin groups).

math.GR↗
arXiv2009

A Groupoid Approach to Discrete Inverse Semigroup Algebras

Let $K$ be a commutative ring with unit and $S$ an inverse semigroup. We show that the semigroup algebra $KS$ can be described as a convolution algebra of functions on the universal étale groupoid associated to $S$ by Paterson. This result is a simultaneous generalization of the author's earlier work on finite inverse semigroups and Paterson's theorem for the universal $C^*$-algebra. It provides a convenient topological framework for understanding the structure of $KS$, including the center and when it has a unit. In this theory, the role of Gelfand duality is replaced by Stone duality. Using this approach we are able to construct the finite dimensional irreducible representations of an inverse semigroup over an arbitrary field as induced representations from associated groups, generalizing the well-studied case of an inverse semigroup with finitely many idempotents. More generally, we describe the irreducible representations of an inverse semigroup $S$ that can be induced from associated groups as precisely those satisfying a certain "finiteness condition". This "finiteness condition" is satisfied, for instance, by all representations of an inverse semigroup whose image contains a primitive idempotent.

math.RA↗
arXiv2009

Tilings and Submonoids of Metabelian Groups

In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product $\mathbb Z\wr (\mathbb Z\times \mathbb Z)$. We also show that subsemimodule membership is undecidable for finite rank free $(\mathbb Z\times \mathbb Z)$-modules. The proof involves an encoding of Turing machines via tilings. We also show that rational subset membership is undecidable for two-dimensional lamplighter groups.

math.GR↗