Related papers: Semigroup Identities, Proofs, and Artificial Intel…
We show that the abelian monoid of isomorphism classes of G-stable finite S-sets is free for a finite group G with Sylow p-subgroup S; here a finite S-set is called G-stable if it has isomorphic restrictions to G-conjugate subgroups of S.…
We use computer algebra to study polynomial identities for the trilinear operation [a,b,c] = abc - acb - bac + bca + cab - cba in the free associative algebra. It is known that [a,b,c] satisfies the alternating property in degree 3, no new…
We study the problem of modeling a binary operation that satisfies some algebraic requirements. We first construct a neural network architecture for Abelian group operations and derive a universal approximation property. Then, we extend it…
A semigroup A is an abelian semigroup with identity 0. A set of positives in A is an ordered down-directed set P containing with every r an element r/2 with r/2 + r/2 = r. A continuity space is an abstract set X equipped with a map d : XxX…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
We define an integer-valued invariant of special cube complexes called the genus, and prove that having genus one characterizes special cube complexes with abelian fundamental group. Using the genus, we obtain a new proof that the…
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…
For every group $G$, the set $\mathcal{P}(G)$ of its subsets forms a semiring under set-theoretical union $\cup$ and element-wise multiplication $\cdot$ and forms an involution semigroup under $\cdot$ and element-wise inversion ${}^{-1}$.…
It is easy to show that a pseudovariety which is reducible with respect to an implicit signature $\sigma$ for the equation $x=y$ can also be defined by $\sigma$-identities. We present several negative examples for the converse using…
Assume that $S$ is a semigroup generated by $\{x_1,...,x_n\}$, and let $\Uscr$ be the multiplicative free commutative semigroup generated by $\{u_1,...,u_n\}$. We say that $S$ is of \emph{$I$-typ}e if there is a bijection $v:\Uscr\r S$ such…
In 2012, Zilber used model-theoretic techniques to show that a curve of high genus over an algebraically closed field is determined by its Jacobian (viewed only as an abstract group with a distinguished subset for an image of the curve). In…
It is known that in (regular) unital and in subtractive categories, internal abelian groups are simply behaved; e.g., they are the same as internal algebras $(A,s)$ satisfying $s(x,0)=x$ and $s(x,x)=0$, i.e., \emph{subtraction algebras}.…
Let S be a finite generating set of a torsion-free, nilpotent group G. We show that every automorphism of the Cayley graph Cay(G;S) is affine. (That is, every automorphism of the graph is obtained by composing a group automorphism with…
When studying subgroups of $Out(F_n)$, one often replaces a given subgroup $H$ with one of its finite index subgroups $H_0$ so that virtual properties of $H$ become actual properties of $H_0$. In many cases, the finite index subgroup is…
We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F, or more generally, of a bounded PAC field F. This paper answers some of the questions of [1], and in particular that any finite group…
A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already known how to…
A prevailing assumption in machine learning is that model correctness must be enforced after the fact. We observe that the properties determining whether an AI model is numerically stable, computationally correct, or consistent with a…
A set of quasi-uniform random variables $X_1,...,X_n$ may be generated from a finite group $G$ and $n$ of its subgroups, with the corresponding entropic vector depending on the subgroup structure of $G$. It is known that the set of entropic…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in…