Related papers: Abelian networks II. Halting on all inputs

We introduce unitary network, an oriented architecture for tensor network unitaries. Compared to existing architectures, in a unitary network each local tensor is required to be a unitary matrix upon suitable reshaping. Global unitarity is…

A long-standing conjecture asserts that every finite non-abelian $p$-group has a non-inner automorphism of order $p$. In this paper, we settle the conjecture for a finite $p$-group ($p >2$) of nilpotency class $n$ with certain conditions.

For abstract linear systems in Hilbert spaces we revisit the problems of exact controllability and complete stabilizability (stabilizability with an arbitrary decay rate), the latter property is equivalent to exact null controllability. We…

In this note we show that any basic abelian variety with additional structures over an arbitrary algebraically closed field of characteristic $p>0$ is isogenous to another one defined over a finite field. We also show that the category of…

In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered…

We say that a subgroup $H$ of an infinite compact Abelian group $X$ is {\it $T$-characterized} if there is a $T$-sequence $\mathbf{u} =\{u_n \}$ in the dual group of $X$ such that $H=\{x\in X: \; (u_n, x)\to 1 \}$. We show that a closed…

Messages in communication networks often are considered as "discrete" taking values in some finite alphabet (e.g. a finite field). However, if we want to consider for example communication based on analogue signals, we will have to consider…

Let A be a finite alphabet and let L contained in (A*)^n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an…

We describe a large-scale project in applied automated deduction concerned with the following problem of considerable interest in loop theory: If $Q$ is a loop with commuting inner mappings, does it follow that $Q$ modulo its center is a…

Boolean automata networks (aka Boolean networks) are space-time discrete dynamical systems, studied as a model of computation and as a representative model of natural phenomena. A collection of simple entities (the automata) update their…

Translation association schemes are constructed from actions of finite groups on finite abelian groups satisfying certain natural conditions. It is also shown that the mere existence of maps from finite groups to themselves sending each…

We show that reachability, repeated reachability, nontermination and unboundedness are NP-complete for Lossy Channel Machines that are flat, i.e., with no nested cycles in the control graph. The upper complexity bound relies on a fine…

Global transfer systems are equivalent to global $N_\infty$-operads, which parametrize different levels of commutativity in globally equivariant homotopy theory, where objects have compatible actions by all compact Lie groups. In this paper…

We study a commutation pattern in which two affine families commute completely across the two families while each family retains internal noncommutativity. For one-dimensional affine groups over finite commutative rings, we prove a…

Every abelian (and even every nilpotent) group contains a solution of any finite unimodular system of equations over itself. However, this is not true for infinite systems. We deduced a criterion for a periodic abelian group to contain a…

We show how to treat supply networks as physical transport problems governed by balance equations and equations for the adaptation of production speeds. Although the non-linear behaviour is different, the linearized set of coupled…

In this paper, we classify the possible group structures on the set of $R$-valued points of an abelian variety, where $R$ is any real closed field. We make use of a family of abelian varieties that, in effect, allows one to quantify over…

An automorphism $\alpha$ of a group $G$ is said to be central if $\alpha$ commutes with every inner automorphism of $G$. We construct a family of non-special finite $p$-groups having abelian automorphism groups. These groups provide counter…

A homomorphism of an automaton ${\bf A}$ without outputs onto a subautomaton ${\bf B}$ of ${\bf A}$ is called a retract homomorphism if it leaves the elements of $B$ fixed. An automaton ${\bf A}$ is called a retractable automaton if, for…

Residual deep neural networks (ResNets) are mathematically described as interacting particle systems. In the case of infinitely many layers the ResNet leads to a system of coupled system of ordinary differential equations known as neural…