Related papers: String C-group representations of transitive Group…
Let X be a non-empty finite set, E be a finite dimensional euclidean vector space and G a finite subgroup of O(E), the orthognal group of E. Suppose GG={U_i | i in X} is a finite set of linear lines in E and an orbit of G on which its…
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…
Jeff Remmel introduced the concept of a $k$-11-representable graph in 2017. This concept was first explored by Cheon et al. in 2019, who considered it as a natural extension of word-representable graphs, which are exactly 0-11-representable…
Let $G$ be a subgroup of $S_n$, the symmetric group of degree $n$. For any field $k$, $G$ acts naturally on the rational function field $k(x_1,x_2,\ldots,x_n)$ via $k$-automorphisms defined by $\sigma\cdot x_i=x_{\sigma(i)}$ for any…
A group is $G$ commutative transitive or CT if commuting is transitive on nontrivial elements. A group $G$ is CSA or conjugately separated abelian if maximal abelian subgroups are malnormal. These concepts have played a prominent role in…
In this work, we prove that the permutation group of a Reed-Solomon code is given by the polynomials of degree one that leave the set of evaluation points invariant. Our results provide a straightforward proof of the well-known cases of the…
The paper is an investigation of the structure of block-transitive automorphism groups of a 3-design with small block size. Let $G$ be a block-transitive automorphism group of a nontrivial $3$-$(v,k,\lambda)$ design $\mathcal{D}$ with $k\le…
Let $\mathscr A$ denote the classical singly-graded Steenrod algebra over the binary field $\mathbb Z/2.$ We write $P_k:=\mathbb Z/2[t_1, t_2, \ldots, t_k]$ as the polynomial algebra on $k$ generators, each having a degree of one. Let…
We study the problem of classification of simple transitive 2-representations for the (non-finitary) 2-category of bimodules over the dual numbers. We show that simple transitive 2-representations with finitary apex are necessarily of rank…
A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…
The primary purpose of this paper is to report on the successful enumeration in Magma of representatives of the $195\,826\,352$ conjugacy classes of transitive subgroups of the symmetric group $S_{48}$ of degree 48. In addition, we have…
A transitive permutation group is said to be semiprimitive if each of its normal subgroups is either semiregular or transitive.The class of semiprimitive groups properly contains primitive groups, quasiprimitive groups and innately…
In this paper we complete a classification of finite linear spaces $\cS$ with line size at most 12 admitting a line-transitive point-imprimitive subgroup of automorphisms. The examples are the Desarguesian projective planes of orders $4,7,…
We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…
In this paper, we consider finite flag-transitive affine planes with a solvable automorphism group. Under a mild number-theoretic condition involving the order and dimension of the plane, the translation complement must contain a linear…
This work addresses the existence of transitive extensions of certain infinite permutation groups which arise as the automorphism groups of model-theoretic structures which are generic in the Fra\"iss\'e sense. The study of transitive…
A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $(x,y)$ is an edge in $E$. Some graphs are word-representable, others are not. It is…
A non-complete graph $\Gamma$ is said to be $(G,2)$-distance transitive if $G$ is a subgroup of the automorphism group of $\Gamma$ that is transitive on the vertex set of $\Gamma$, and for any vertex $u$ of $\Gamma$, the stabilizer $G_u$ is…
In this paper we give a complete characterization of the statistical equivalence classes of CEGs and of staged trees. We are able to show that all graphical representations of the same model share a common polynomial description. Then,…
A crucial role in representation theory of loop groups of reductive Lie groups and their Lie algebras is played by their non-trivial second cohomology classes which give rise to their central extensions (the affine Kac-Moody groups and Lie…