Related papers: The zero divisor conjecture and Mealy automata
The main purpose of this paper is to investigate the zero-divisors of semigroups with zero and semirings and in particular, to discuss eversible and reversible semigroups and semirings. We also introduce a new ring-like algebraic structure…
A classical theorem of Kempner states that the sum of the reciprocals of positive integers with missing decimal digits converges. This result is extended to much larger families of "missing digits" sets of positive integers with both…
The distribution of cardinalities of zero-sum sets in abelian groups is completely determined. A complex summation involving the M\"obius function is given for the general abelian group, while in many special cases, including the case of…
We study the zero divisor graph determined by equivalence classes of zero divisors of a commutative Noetherian ring R. We demonstrate how to recover information about R from this structure. In particular, we determine how to identify…
In this paper we give new methods to construct zero divisors in A_n =R^(2^n) the Cayley_Dickson algebras over the real numbers, for n larger than 4, and we also relate the set of zero divisors in A_{n+1} with the Stiefel Manifold V_{2^n…
We characterize group representations that factor through monomial representations, respectively, block-triangular representations with monomial diagonal blocks, by arithmetic properties. Similar results are obtained for semigroup…
We obtain a necessary and sufficient condition for a finite set of states of a finite dimensional multiparticle quantum system to be amenable to unambiguous discrimination using local operations and classical communication. This condition…
In this paper, we continue the program initiated by I. Beck's now classical paper concerning zero-divisor graphs of commutative rings. After the success of much research regarding zero-divisor graphs, many authors have turned their…
In Bayesian statistics the precise point-null hypothesis $\theta=\theta_0$ can be tested by checking whether $\theta_0$ is contained in a credible set. This permits testing of $\theta=\theta_0$ without having to put prior probabilities on…
In this paper, we propose a new conjecture describing the structure of the unitary dual in terms of Arthur representations for connected reductive algebraic groups defined over any non-Archimedean local field of characteristic zero. This…
It is well known that the emptiness problem for binary probabilistic automata and so for quantum automata is undecidable. We present the current status of the emptiness problems for unary probabilistic and quantum automata with connections…
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set…
We show that the commensurator of any finitely generated abelian subgroup $H$ in a biautomatic group centralises a finite-index subgroup of $H$. We deduce that the CAT(0) groups introduced by Leary-Minasyan are either biautomatic or cannot…
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable. This result implies new decidability results for…
A generic strictly semistable bundle of degree zero over a curve X has a reducible theta divisor, given by the sum of the theta divisors of the stable summands of the associated graded bundle. The converse is not true: Beauville and Raynaud…
Planar automata seems to be representative of the synchronizing behavior of deterministic finite state automata. We conjecture that \v{C}erny's conjecture holds true, if and only if, it holds true for planar automata. In this paper we have…
We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.
Inspired by the work in \cite{sauer} regarding the classification of all the zero-divisor graphs with six vertices, we obtain all the zero-divisor graphs with seven vertices. Hence we classify all the zero-divisor commutative semigroups…
The following problem has been known since the 80's. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $m_i$, $1 \leq i \leq t$, be positive integers such that $\sum_{i=1}^t m_i=m-1$. Determine when…
Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…