Related papers: Dynamical forcing of circular groups
We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…
Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow…
In this paper, we work on the pro-nilpotent group topology of a free group. First we investigate the closure of the product of finitely many subgroups of a free group in the pro-nilpotent group topology. We present an algorithm for the…
We provide a method for counting number fields of fixed Galois group ordered by arbitrary inertial invariants using analytic techniques from the study of multiple Dirichlet series. We prove unconditional results for infinitely many new…
Let $G$ be an affine algebraic group over an algebraically closed field $k$ of characteristic zero. In this paper, we consider finite $G$-equivariant morphisms $F:X\to Y$ of irreducible affine $G$-varieties. First we determine under which…
We prove that for arbitrary two finitely generated subgroups A and B having infinite index in a free group F, there is a subgroup H of finite index in B such that the subgroup generated by A and H has infinite index in F. The main corollary…
We demonstrate that the ring of invariants for the natural action of a subgroup G of GL_n(F_q) on a polynomial ring R=K[X_1,...,X_n] need not be F-pure. In these examples G is the symplectic group over a finite field, and the invariant…
The transitivity degree of a group $G$ is the supremum of all integers $k$ such that $G$ admits a faithful $k$-transitive action. Few obstructions are known to impose an upper bound on the transitivity degree for infinite groups. The…
Mobile manipulation tasks remain one of the critical challenges for the widespread adoption of autonomous robots in both service and industrial scenarios. While planning approaches are good at generating feasible whole-body robot…
Modified gravity theories can be used for the description of homogeneous and isotropic cosmological models through the corresponding field equations. These can be cast into systems of autonomous differential equations because of their sole…
We construct the first examples of finitely presented groups with cubic Dehn function containing a finitely generated infinite torsion subgroup. Moreover, we show that any infinite free Burnside group with sufficiently large odd exponent…
We study the dynamical response of a circularly-driven rigid body, focusing on the description of intrinsic rotational behavior (reverse rotations). The model system we address is integrable but nontrivial, allowing for qualitative and…
We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a…
The paper presents a new algorithmic construction of a finite generating set of rational invariants for the rational action of an algebraic group on the affine space. The construction provides an algebraic counterpart of the moving frame…
Consider a periodically forced nonlinear system which can be presented as a collection of smaller subsystems with pairwise interactions between them. Each subsystem is assumed to be a massive point moving with friction on a compact surface,…
Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…
This paper investigates the finite generation of cluster automorphism groups. By applying the pseudo $\mathbb{N}$-grading introduced in our previous work, we establish a sufficient condition for a cluster automorphism group to be finitely…
By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…
In this paper, we study the generating function of cyclically fully commutative elements in Coxeter groups, which are elements such that any cyclic shift of theirs reduced decompositions remains a reduced expression of a fully commutative…
The cycle polynomial of a finite permutation group $G$ is the generating function for the number of elements of $G$ with a given number of cycles: \[F_G(x) = \sum_{g\in G}x^{c(g)},\] where $c(g)$ is the number of cycles of $g$ on $\Omega$.…