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

Fully homomorphic encryption is an encryption method with the property that any computation on the plaintext can be performed by a party having access to the ciphertext only. Here, we formally define and give schemes for quantum homomorphic…

The cyclic subgroup graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with cyclic subgroups as a vertex set and two distinct vertices $H_1$ and $H_2$ are adjacent if and only if $H_1 \leq H_2$ and there does not exist any…

Given a simple vertex algebra A and a reductive group G of automorphisms of A, the invariant subalgebra A^G is strongly finitely generated in most examples where its structure is known. This phenomenon is subtle, and is generally not true…

An \emph{automorphic loop} (or \emph{A-loop}) is a loop whose inner mappings are automorphisms. Every element of a commutative A-loop generates a group, and $(xy)^{-1} = x^{-1}y^{-1}$ holds. Let $Q$ be a finite commutative A-loop and $p$ a…

To every dynamical system $(X,\varphi)$ over a totally disconnected compact space, we associate a left-orderable group $T(\varphi)$. It is defined as a group of homeomorphisms of the suspension of $(X,\varphi)$ which preserve every orbit of…

We introduce a linearized version of group field theory. It can be viewed either as a group field theory over the additive group of a vector space or as an asymptotic expansion of any group field theory around the unit group element. We…

Each topological group $G$ admits a unique universal minimal dynamical system $(M(G),G)$. When $G$ is a non-compact locally compact group the phase space $M(G)$ of this universal system is non-metrizable. There are however topological…

For a graph $\Gamma$ and group $G$, $G^\Gamma$ is the subgroup of $G^{|\Gamma|}$ generated by elements with $g$ in the coordinates corresponding to $v$ and its neighbors in $\Gamma$. There is a natural epimorphism $G^\Gamma \to…

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…

We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…

In this paper, we continue the study of the generator graph of a group. In 2023, Tacbobo [9] defined the generator graph of a nontrivial group to be the graph whose vertices are the elements of the group, with two vertices being adjacent if…

For the category of group codes, that generalizes the category of linear codes over a finite field, and with the generalized notions of direct sums and ndecomposable group codes, we prove that every MDS non trivial code, every perfect non…

We find a set of generators for the automorphism group of a graph product of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup of star-automorphisms defined…

We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…

Let $M$ be an irreducible smooth projective variety, defined over an algebraically closed field, equipped with an action of a connected reductive affine algebraic group $G$, and let ${\mathcal L}$ be a $G$--equivariant very ample line…

A groupoid identity is said to be linear of length $2k$ if the same $k$ variables appear on both sides of the identity exactly once. We classify and count all varieties of groupoids defined by a single linear identity. For $k=3$, there are…

Let $G$ be a finitely generated malabelian group, let $A\leq\mathrm{Out}(G)$ be a finitely generated subgroup, and let $\Gamma_{G,A}$ denote the preimage of $A$ in $\mathrm{Aut}(G)$. We give a general criterion for the linearity of…

Let $V$ be a finite-dimensional vector space over the complex numbers and let $G\leq \operatorname{SL}(V)$ be a finite group. We describe the class group of a minimal model (that is, $\mathbb Q$-factorial terminalization) of the linear…

A subgroup $H$ of a free group $F$ is called inert in $F$ if for every $G < F$ the rank of the intersection of $H$ with $G$ is no grater than the rank of $G$. In this paper we expand the known families of inert subgroups. We show that the…

A group $G$ is called logically cyclic, if it contains an element $s$ such that every element of $G$ can be defined by a first order formula with parameter $s$. The aim of this paper is to investigate the structure of such groups.