Related papers: Symmetry groups of boolean functions: simple group…

When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More…

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

The spectrum of a finite group is the set of its elements orders. Groups are said to be isospectral if their spectra coincide. For every finite simple exceptional group $L=E_7(q)$, we prove that each finite group isospectral to $L$ is…

We extend the definitions of complexity measures of functions to domains such as the symmetric group. The complexity measures we consider include degree, approximate degree, decision tree complexity, sensitivity, block sensitivity, and a…

Regular hypermaps with underlying simple hypergraphs are analysed. We obtain an algorithm to classify the regular embeddings of simple hypergraphs with given order, and determine the automorphism groups of regular embedding of simple…

It has been shown that there is a Hamilton cycle in every connected Cayley graph on each group G whose commutator subgroup is cyclic of prime-power order. This paper considers connected, vertex-transitive graphs X of order at least 3 where…

We define the notions of a free fusion of structures and a weakly stationary independence relation. We apply these notions to prove simplicity for the automorphism groups of order and tournament expansions of homogeneous structures like the…

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

Motivated in part by representation theoretic questions, we prove that if G is a finite quasi-simple group, then there exists an elementary abelian subgroup of G that intersects every conjugacy class of involutions of G.

The main purpose of this paper is to describe some published results and outline corresponding approaches which when applied to automorphism groups of algebras or groups establish that these groups are linear or non-linear.

We describe simply connected compact exceptional simple Lie groups in very elementary way. We first construct all simply connected compact exceptional Lie groups G concretely. Next, we find all involutive automorphisms of G, and determine…

For a given group $G$, it is natural to ask whether one can classify all isometric $G$-actions on Gromov hyperbolic spaces. We propose a formalization of this problem utilizing the complexity theory of Borel equivalence relations. In this…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$…

First we prove that any inner automorphism in the stabilizer of a graded-simple unital associative algebra whose grading group is abelian is the conjugation by a homogeneous element. Now consider a grading by an abelian group on an…

We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…

Symmetry groups of PDEs allow to transform solutions continuously into other solutions. In this paper, we use this property for the observability analysis of nonlinear PDEs with input and output. Based on a differential-geometric…

A semiregular permutation group on a set $\Ome$ is called {\em bi-regular} if it has two orbits. A classification is given of quasiprimitive permutation groups with a biregular dihedral subgroup. This is then used to characterize the family…

We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…