Related papers: Dynamical forcing of circular groups

We compute the rank of the group of central units in the integral group ring $\Z G$ of a finite strongly monomial group $G$. The formula obtained is in terms of the strong Shoda pairs of $G$. Next we construct a virtual basis of the group…

The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…

This article introduces and investigates the basic features of a dynamical zeta function for group actions, motivated by the classical dynamical zeta function of a single transformation. A product formula for the dynamical zeta function is…

Let $K$ be an algebraically closed field of characteristic zero and let $G$ be a finitely generated subgroup of the multiplicative group of $K$. We consider $K$-valued sequences of the form $a_n:=f(\varphi^n(x_0))$, where $\varphi\colon…

This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a mathematical theory of computer simulation. It contains a classification of finite dynamical systems on binary strings, which are obtained by…

The paper demonstrates that invariant foliations are accurate, data-efficient and practical tools for data-driven modelling of physical systems. Invariant foliations can be fitted to data that either fill the phase space or cluster about an…

In this memoir, we seek to construct a dynamical theory as complete as possible to describe the algebraic properties of the field of real numbers in constructive mathematics without axiom of dependent choice. We propose a theory which turns…

For cyclically presented groups $G = G_n(w)$ with positive length four relators $w = x_0x_jx_kx_l$ in the free group with basis $x_0, x_1, \ldots, x_{n-1}$, we classify finiteness and, modulo two unresolved cases, we classify asphericity…

Consider the polynomial ring in countably infinitely many variables over a field of characteristic zero, together with its natural action of the infinite general linear group G. We study the algebraic and homological properties of finitely…

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

We show that every effectively closed action of a finitely generated group $G$ on a closed subset of $\{0,1\}^{\mathbb{N}}$ can be obtained as a topological factor of the $G$-subaction of a $(G \times H_1 \times H_2)$-subshift of finite…

Following the recent advances in the study of groups of circle diffeomorphisms, we describe an efficient way of classifying the topological dynamics of locally discrete, finitely generated, virtually free subgroups of the group…

The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…

In this paper, we study rotation numbers of random dynamical systems on the circle. We prove the existence of rotation numbers and the continuous dependence of rotation numbers on the systems. As an application, we prove a theorem on…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

A formulation of quantum mechanics based on replacing the general unitary group by finite groups is considered. To solve problems arising in the context of this formulation, we use computer algebra and computational group theory methods.

We study invariants for shifts of finite type obtained as the K-theory of various C*-algebras associated with them. These invariants have been studied intensely over the past thirty years since their introduction by Wolfgang Krieger. They…

We investigate how set-theoretic forcing can be seen as a computational process on the models of set theory. Given an oracle for information about a model of set theory $\langle M,\in^M\rangle$, we explain senses in which one may compute…

Let $X$ and $\mathfrak{a}$ be an affine scheme and (respectively) a finite-dimensional associative algebra over an algebraically-closed field $\Bbbk$, both equipped with actions by a linearly-reductive linear algebraic group $G$. We…

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup…