Related papers: The zero divisor conjecture and Mealy automata

It is shown that any finite group $A$ is realizable as the automizer in a finite perfect group $G$ of an abelian subgroup whose conjugates generate $G$. The construction uses techniques from fusion systems on arbitrary finite groups, most…

In system operations it is commonly assumed that arbitrary changes to a system can be reversed or `rolled back', when errors of judgement and procedure occur. We point out that this view is flawed and provide an alternative approach to…

This short note aims at proving that the isolation problem is undecidable for probabilistic automata with only one probabilistic transition. This problem is known to be undecidable for general probabilistic automata, without restriction on…

Vaught's Conjecture states that if $T$ is a complete first order theory in a countable language that has more than $\aleph_0$ pairwise non-isomorphic countably infinite models, then $T$ has $2^{\aleph_0}$ such models. Morley showed that if…

Controlling hybrid systems is mostly very challenging due to the variety of dynamics these systems can exhibit. Inspired by the concept of differential flatness of nonlinear continuous systems and their inherent invertibility property, the…

This paper is about topological dynamics of cellular automata on finitely generated groups. We tackle the problem of determining for which group sensitivity to initial conditions is equivalent to the absence of equicontinuity points…

A group $G$ is called subgroup conjugacy separable if for every pair of non-conjugate finitely generated subgroups of $G$, there exists a finite quotient of $G$ where the images of these subgroups are not conjugate. We prove that limit…

Assuming the Riemann Hypothesis (RH), Montgomery proved a theorem concerning pair correlation of zeros of the Riemann zeta-function. One consequence of this theorem is that, assuming RH, at least $67.9\%$ of the nontrivial zeros are simple.…

For any field $\mathbb{F}$ and all torison-free group $\mathbb{G}$, we prove that if $ab = 0$ for some non-zero $a, b \in \mathbb{F}[\mathbb{G}]$ such that $|supp(a)|$ $= 3$ and $a = 1 + \alpha_{1}g_{1} + \alpha_{2}g_{2}$, then $g_{1},…

For a commutative semigroup $S$ with 0, the zero-divisor graph of $S$ denoted by $\Gamma(S)$ is the graph whose vertices are nonzero zero-divisor of $S$, and two vertices $x$, $y$ are adjacent in case $xy=0$ in $S$. In this paper we study…

We consider linear cost-register automata (equivalent to weighted automata) over the semiring of nonnegative rationals, which generalise probabilistic automata. The two problems of boundedness and zero isolation ask whether there is a…

Walker's cancellation theorem says that if B+Z is isomorphic to C+Z in the category of abelian groups, then B is isomorphic to C. We construct an example in a diagram category of abelian groups where the theorem fails. As a consequence, the…

In a recent paper, Merca posed three conjectures on congruences for specific convolutions of a sum of odd divisor functions with a generating function for generalized $m$-gonal numbers. Extending Merca's work, we complete the proof of these…

With the increasing pervasive use of machine learning in social and economic settings, there has been an interest in the notion of machine bias in the AI community. Models trained on historic data reflect biases that exist in society and…

In the case of finite groups, a separating algebra is a subalgebra of the ring of invariants which separates the orbits. Although separating algebras are often better behaved than the ring of invariants, we show that many of the criteria…

The aim of this paper is to prove the \v{C}ern\'y conjecture and the rank conjecture for \v{C}ern\'y type automata and monoids. A transformation monoid is said to be \v{C}ern\'y type if it is generated by a simple idempotent and a regular…

Deterministic synchronous systems consisting of two finite automata running in opposite directions on a shared read-only input are studied with respect to their ability to perform reversible computations, which means that the automata are…

We consider a family of finitely presented groups, called Universal Left Invertible Element (or ULIE) groups, that are universal for existence of one--sided invertible elements in a group ring K[G], where K is a field or a division ring. We…

The McKay Conjecture (MC) asserts the existence of a bijection between the (inequivalent) complex irreducible representations of degree coprime to $p$ ($p$ a prime) of a finite group $G$ and those of the subgroup $N$, the normalizer of…

We prove that the additive group of the rationals does not have an automatic presentation. The proof also applies to certain other abelian groups, for example, torsion-free groups that are $p$-divisible for infinitely many primes $p$, or…