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

Let $G$ be a finite group and $H$ a core-free subgroup of $G$. We will show that if there exists a solvable, generating transversal of $H$ in $G$, then $G$ is a solvable group. Further, if $S$ is a generating transversal of $H$ in $G$ and…

Let G be a group and let A be the algebra of complex functions on G with finite support. The product in G gives rise to a coproduct on A making it a multiplier Hopf algebra. In fact, because there exist integrals, we get an algebraic…

We introduce a general framework to design and analyze algorithms for the problem of testing homomorphisms between finite groups in the low-soundness regime. In this regime, we give the first constant-query tests for various families of…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

A {\it graph product} $G$ on a graph $\Gamma$ is a group defined as follows: For each vertex $v$ of $\Gamma$ there is a corresponding non-trivial group $G_v$. The group $G$ is the quotient of the free product of the $G_v$ by the commutation…

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…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

Temporal networks are a class of time-varying networks, which change their topology according to a given time-ordered sequence of static networks (known as subsystems). This paper investigates the reachability and controllability of…

For any code loop $L$, we prove that the half-automorphism group of $L$ is the product of the automorphism group of $L$ by an elementary abelian $2-$group consisting of all half-automorphisms that acts as the identity on a fixed basis.…

We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in…

A block in a linear order is an equivalence class when factored by the block relation B(x,y), satisfied by elements that are finitely far apart. We show that every computable linear order with dense condensation-type (i.e. a dense…

A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry (i.e. are full). It is shown by construction that every finite group…

A discrete group which admits a faithful, finite dimensional, linear representation over a field $\mathbb F$ of characteristic zero is called linear. This note combines the natural structure of semi-direct products with work of A. Lubotzky…

Let $K$ be a field and $G$ be a group of its automorphisms. If $G$ is precompact then $K$ is a generator of the category of smooth (i.e. with open stabilizers) $K$-semilinear representations of $G$. There are non-semisimple smooth…

The reachable set for a finite dimensional quantum system is shown to be the orbit of the group corresponding to the internal and control Hamiltonians, even if this group is not compact.

Let A be a supersingular abelian variety over a finite field k. We give an approximate description of the structure of the group A(k) of rational points of A over k in terms of the characteristic polynomial f of the Frobenius endomorphism…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

Aiming at a better understanding of finite groups as finite dynamical systems, we show that by a version of Fitting's Lemma for groups, each state space of an endomorphism of a finite group is a graph tensor product of a finite directed…

In a finite group, a subset is called a Lagrange subset if its size divides the group order, and a factor if it admits a complementary subset. We provide a new and comparatively direct proof of the classification of groups in which every…

A quantum processor (the programmable gate array) is a quantum network with a fixed structure. A space of states is represented as tensor product of data and program registers. Different unitary operations with the data register correspond…