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

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…

A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…

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…

A subset $S$ of a group $G$ invariably generates $G$ if, when each element of $S$ is replaced by an arbitrary conjugate, the resulting set generates $G.$ An invariable generating set $X$ of $G$ is called minimal if no proper subset of $X$…

This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…

Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this…

The strong symmetric genus of a finite group is the minimum genus of a compact Riemann surface on which the group acts as a group of automorphisms preserving orientation. A characterization of the infinite number of groups with strong…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

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…

For a coefficient free cluster algebra $\mathcal{A}$, we study the cluster automorphism group $Aut(\mathcal{A})$ and the automorphism group $Aut(E_{\mathcal{A}})$ of its exchange graph $E_{\mathcal{A}}$. We show that these two groups are…

We discuss the group theory relevant to the ground-state baryons in large N_c QCD. For very large representation, the group generators become classical variables. We find the form of the classical generators for the completely symmetric N…

A subset $S$ of a group $G$ invariably generates $G$ if $G$ is generated by $\{ s^g(s) | s\in S\} $ for any choice of $g(s)\in G, s\in S$. In case $G$ is topological one defines similarly the notion of topological invariable generation. A…

We investigate multiplicative groups consisting entirely of singular alternating sign matrices (ASMs), and present several constructions of such groups. It is shown that every finite group is isomorphic to a group of singular ASMs, with a…

A group $G$ is self-similar if it admits a triple $(G,H,f)$ where $H$ is a subgroup of $G$ and $f: H \to G$ a simple homomorphism, that is, the only subgroup $K$ of $H$, normal in $G$ and $f$-invariant ($K^f \leq K$) is trivial. The group…

We describe an efficient algorithm to write any element of the alternating group A_n as a product of two n-cycles (in particular, we show that any element of A_n can be so written -- a result of E. A. Bertram). An easy corollary is that…

Many tight frames of interest are constructed via their Gramian matrix (which determines the frame up to unitary equivalence). Given such a Gramian, it can be determined whether or not the tight frame is projective group frame, i.e., is the…

We focus our attention to the set $\gl{\coring{C}}$ of grouplike elements of a coring $\coring{C}$ over a ring $A$. We do some observations on the actions of the groups $U(A)$ and $\aut{\coring{C}}$ of units of $A$ and of automorphisms of…

Run-length decoding is an operation on sequences in which a positive integer $a$ is replaced by a run(sequence of repeated elements) of length $a$. Iterated run-length decodings applied to sequences with alphabets consisting of pairs of…

The article continues the series of papers on the absolute of finitely generated groups. The absolute of a group with a fixed system of generators is defined as the set of ergodic Markov measures for which the system of cotransition…

The isotropic harmonic oscillator in N dimensions is shown to have an underlying symmetry group O(2,1)X O(N)which implies a unique result for the energy spectrum of the system. Raising and lowering operators analogous to those of the…