Related papers: The zero divisor conjecture and Mealy automata

We are following [4]. Nevertheless we are interested only in claryfication that the lamplighter group can be realized as a 2--states Mealy machine.

The knapsack problem is a classic optimisation problem that has been recently extended in the setting of groups. Its study reveals to be interesting since it provides many different behaviours, depending on the considered class of groups.…

In the present paper the unconditional convergence and the invertibility of multipliers is investigated. Multipliers are operators created by (frame-like) analysis, multiplication by a fixed symbol, and resynthesis. Sufficient and/or…

We settle a conjecture of Farmer and Ki in a stronger form. Roughly speaking we show that there is a positive proportion of small gaps between consecutive zeros of the zeta-function $\zeta(s)$ if and only if there is a positive proportion…

We show that in a tracial and finitely generated $W^\ast$-probability space existence of conjugate variables in an appropriate sense exclude algebraic relations for the generators. Moreover, under the assumption of finite non-microstates…

We prove certain conjecture holds true for a finite category which has M\"obius inversion. The conjecture states a relationship between the zeta function of a finite category and the Euler characteristic of a finite category.

Recall that the Mouse Set Conjecture says that under AD++V=L(P(R)), a real is ordinal definable if and only if it belongs to an iterable mouse. The Mouse Set Conjecture for sets of reals says that under the same theory, a set of reals is…

This is a paper devoted to the symplectic birational geometry program where many basic notions are defined in terms of genus 0 GW invariants. We show that the existence of a positive uniruled symplectic divisor often implies that the…

We compare two approaches for modelling imperfect information in infinite games by using finite-state automata. The first, more standard approach views information as the result of an observation process driven by a sequential Mealy…

We prove, for various important classes of Mealy automata, that almost all generated groups have an element of infinite order. In certain cases, it also implies other results such as exponential growth.

It is well known that results on zero-sum sequences over a finitely generated abelian group can be translated to statements on generators of rings of invariants of the dual group. Here the direction of the transfer of information between…

We introduce and study the problem of finding necessary and sufficient conditions under which a conformal blocks divisor on $\bar{M}_{0,n}$ is nonzero. We give necessary conditions in type A, which are sufficient when theta and critical…

We investigate finite deterministic automata in sets with non-homogeneous atoms: integers with successor. As there are uncount- ably many deterministic finite automata in this setting, we restrict our attention to automata with semilinear…

A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed by a subset of the authors of this paper. Examples of the systems…

We find a necessary condition for zero divisors in complex group algebras of torsion-free groups.

The paper develops further the theory of quandle rings which was introduced by the authors in a recent work. Orderability of quandles is defined and many interesting examples of orderable quandles are given. It is proved that quandle rings…

The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. We consider the zero divisor graph…

We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of…

We prove that the semigroup generated by a finite state Mealy automaton $\mathcal{A}=(Q,A,\tau)$ is infinite if and only if there exists some right-infinite word in the alphabet $A$ with infinite orbit.

We prove that any finite system of interacted automata can not leave some finite arear of Calley graph of periodic group. If group has non-periodic element, then its Calley graph can be explored by some finite automata with 3 pebbles. If…