Related papers: Abelian networks II. Halting on all inputs
When working with (multi-parameter) persistence modules, one usually makes some type of tameness assumption in order to obtain better control over their algebraic behavior. One such notion is Ezra Millers notion of finite encodability,…
A group is called metahamiltonian if all non-abelian subgroups of it are normal. This concept is a natural generalization of Hamiltonian groups. In this paper, the properties of finite metahamiltonian $p$-groups are investigated.
Let $G$ be a nonabelian group, $A\subseteq G$ an abelian subgroup and $n\geqslant 2$ an integer. We say that $G$ has an $n$-abelian partition with respect to $A$, if there exists a partition of $G$ into $A$ and $n$ disjoint commuting…
We analyze a family of clustered excitatory-inhibitory neural networks and the underlying bifurcation structures that arise because of permutation symmetries in the network as the global coupling strength $g$ is varied. We primarily…
The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptotic probability one, so that as the number of states n…
We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the…
It is known that any locally graded group with finitely many derived subgroups of non-normal subgroups is finite-by-abelian. This result is generalized here, by proving that in a locally graded group $G$ the subgroup $\gamma_{k}(G)$ is…
We say that a subgroup $H$ is isolated in a group $G$ if for every $x\in G$ we have either $x\in H$ or $\langle x\rangle\cap H=1$. In this short note, we describe the set of isolated subgroups of a finite abelian group. The technique used…
We examine questions involving nondeterministic finite automata where all states are final, initial, or both initial and final. First, we prove hardness results for the nonuniversality and inequivalence problems for these NFAs. Next, we…
Boolean networks are special types of finite state time-discrete dynamical systems. A Boolean network can be described by a function from an n-dimensional vector space over the field of two elements to itself. A fundamental problem in…
Minimal input/output selection is investigated in this paper for each subsystem of a networked system. Some novel sufficient conditions are derived respectively for the controllability and observability of a networked system, as well as…
One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…
For a given unconstrained dynamical system, input redundancy has been recently redefined as the existence of distinct inputs producing identical output for the same initial state. By directly referring to signals, this definition readily…
Let p be a fixed prime. An Abelian p-group is an Abelian group (not necessarily finitely generated) in which every element has for its order some power of p. The countable Abelian p-groups are classified by Ulm's theorem, and Khisamiev…
Infinite-dimensional linear port-Hamiltonian systems on a one-dimensional spatial domain with full boundary control and without internal damping are studied. This class of systems includes models of beams and waves as well as the transport…
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node depending on its neighbors. The global dynamics of the network…
A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…
We study the well-posedness and stability of an impedance passive infinite-dimensional linear system under nonlinear feedback of the form $u(t)=\phi(v(t)-y(t))$, where $\phi$ is a monotone function. Our first main result introduces…
We prove that for any fixed unitary matrix $U$, any abelian self-adjoint algebra of matrices that is invariant under conjugation by $U$ can be embedded into a maximal abelian self-adjoint algebra that is still invariant under conjugation by…
A permutation group $G\le\operatorname{Sym}(\Omega)$ is said to be $2$-closed if no group $H$ such that $G<H\le\operatorname{Sym}(\Omega)$ has the same orbits on $\Omega\times\Omega$ as $G$. A simple and efficient inductive criterion for…