Related papers: Finite Semigroups of Constant Rank, and the five B…
We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…
Central in entanglement theory is the characterization of local transformations among pure multipartite states. As a first step towards such a characterization, one needs to identify those states which can be transformed into each other via…
The continuous random network (CRN) model is an idealized model for perfectly coordinated amorphous semiconductors. The quality of a CRN can be assessed in terms of topological and configurational properties, including coordination,…
Semiautomata form a rich class of sequence-processing algorithms with applications in natural language processing, robotics, computational biology, and data mining. We establish the first Statistical Query hardness result for semiautomata…
The notion of semi-classical states is first sharpened by clarifying two issues that appear to have been overlooked in the literature. Systems with linear and quadratic constraints are then considered and the group averaging procedure is…
We introduce in this work a novel stochastic inference process, for scene annotation and object class segmentation, based on finite state machines (FSMs). The design principle of our framework is generative and based on building, for a…
Let $\mathcal{CT}_n$ be the semigroup of full contraction mappings on $[n]=\{1,2,\ldots,n\}$, and let $\mathcal{OCT}_n$ and $\mathcal{ODCT}_n$ be the subsemigroups consisting of all order-preserving full contraction and subsemigroup of…
In this paper, we characterize completely the structure of Clifford semigroups of matrices over an arbitrary field. It is shown that a semigroups of matrices of finite order is a Clifford semigroup if and only if it is isomorphic to a…
For an arbitrary group $G$, it is shown that either the semigroup rank $G{\rm rk}S$ equals the group rank $G{\rm rk}G$, or $G{\rm rk}S = G{\rm rk}G+1$. This is the starting point for the rest of the article, where the semigroup rank for…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
Semiclassical mechanics of systems with first-class constraints is developed. Starting from the quantum theory, one investigates such objects as semiclassical states and observables, semiclassical inner product, semiclassical gauge…
Let $[n]=\{1,2,\ldots,n\}$ be a finite chain and let $\mathcal{CT}_{n}$ be the semigroup of full contractions on $[n]$. Denote $\mathcal{ORCT}_{n}$ and $\mathcal{OCT}_{n}$ to be the subsemigroup of order preserving or reversing and the…
It is proved that, given a (von Neumann) regular semigroup with finitely many left and right ideals, if every maximal subgroup is presentable by a finite complete rewriting system, then so is the semigroup. To achieve this, the following…
We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy…
In this paper we characterize when a Cayley automaton semigroup is a group, is trivial, is finite, is free, is a left zero semigroup, or is a right zero semigroup.
An almost para-CR structure on a manifold $M$ is given by a distribution $HM \subset TM$ together with a field $K \in \Gamma({\rm End}(HM))$ of involutive endomorphisms of $HM$. If $K$ satisfies an integrability condition, then $(HM,K)$ is…
Linear Attention Large Language Models (LLMs) offer a compelling recurrent formulation that compresses context into a fixed-size state matrix, enabling constant-time inference. However, the internal dynamics of this compressed state remain…
In this paper, a class of indecomposable positive finite rank elementary operators of order $(n,n)$ are constructed. This allows us to give a simple necessary and sufficient criterion for separability of pure states in bipartite systems of…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
We study the semibicategory $\textsf{Mre}$ of "Moore automata": an arrangement of objects, 1- and 2-cells which is inherently and irredeemably nonunital in dimension one. Between the semibicategory of Moore automata and the better behaved…