Related papers: Any strongly controllable group system or group sh…

Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there…

We display a new family of prime ideals with unbounded minimal number of generators in a three-dimensional power series ring over a field of characteristic zero. These primes are obtained as the kernel of a quasi-monomial algebra…

For an Abelian group $G$, any homomorphism $\mu\colon G\otimes G\rightarrow G$ is called a \textsf{multiplication} on $G$. The set $\text{Mult}\,G$ of all multiplications on an Abelian group $G$ is an Abelian group with respect to addition.…

Let $\Gamma$ be a torsion-free hyperbolic group. We study $\Gamma$--limit groups which, unlike the fundamental case in which $\Gamma$ is free, may not be finitely presentable or geometrically tractable. We define model $\Gamma$--limit…

This note considers the finite linear independence of coherent systems associated to discrete subgroups. We show by simple arguments that such coherent systems of amenable groups are linearly independent whenever the associated twisted…

Linear systems on Lie groups are a natural generalization of linear system on Euclidian spaces. When the state space is a solvable connected Lie group, controllability of the linear system is assured if the ad-rank condition holds.

A finite quantum hypergroup is a finite-dimensional unital algebra $A$ over the field of complex numbers. There is a coproduct on $A$, a coassociative map from $A$ to $A\otimes A$ assumed to be unital, but it is not required to be an…

For a topological dynamical system $(X, T)$ we define a uniform generator as a finite measurable partition such that the symmetric cylinder sets in the generated process shrink in diameter uniformly to zero. The problem of existence and…

A group in which every element commutes with its endomorphic images is called an $E$-group. Our main result is that all 3-generator $E$-groups are abelian. It follows that the minimal number of generators of a finitely generated non-abelian…

A cyclic subgroup $N$ of a finite group $G$ is called a uni-width subgroup of $G$ if $N$ is the unique cyclic subgroup of $G$ of order $|N|$. In this article, we prove that a finite group $G$ admits a unique largest uni-width subgroup…

A 2-group is a `categorified' version of a group, in which the underlying set G has been replaced by a category and the multiplication map m: G x G -> G has been replaced by a functor. A number of precise definitions of this notion have…

Let G be a free group in a variety of groups, but G is not absolutely free. We prove that the group of automorphisms Aut(G) is linear iff G is a virtually nilpotent group.

A spin system is a sequence of self-adjoint unitary operators $U_1,U_2,...$ acting on a Hilbert space $H$ which either commute or anticommute, $U_iU_j=\pm U_jU_i$ for all $i,j$; it is is called irreducible when $\{U_1,U_2,...\}$ is an…

This is an expository paper. It is well known that a linear transformation can be defined to have any desired action on a basis. From this fact, one can show that every group homomorphism from Z^k to R^d extends to a homomorphism from R^k…

It is a well-known fact that every group $G$ has a presentation of the form $G = F/R$, where $F$ is a free group and $R$ the kernel of the natural epimorphism from $F$ onto $G$. Driven by the desire to obtain a similar presentation of the…

In this paper we explore the structure and properties of C-groups. We define a C-group as a group $G$ with $rk(G) < rk(Z(G))$ (where $rk(G)$ is the minimal cardinal of a generating set for a group $G$). Using GAP (a group theory program)…

By a classical theorem of Jordan, every faithful transitive action of a nontrivial finite group has a derangement (an element with no fixed points). The existence of derangements with additional properties has attracted much attention,…

Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…

For a finite alphabet $\mathcal{A}$ and shift $X\subseteq\mathcal{A}^{\mathbb{Z}}$ whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group ${\rm Aut}(X)$. For such systems, we…

Consider a tree $\mathbb T$, all whose vertices have countable valence; its boundary is the Baire space $\mathbb{B} \simeq\mathbb{N}^{\mathbb N}$; continued fractions expansions identify the set of irrational numbers $\mathbb{R}\setminus…