Related papers: Imprimitive Permutations in Primitive Groups

We consider a constructive modification of quantum-mechanical formalism. Replacement of a general unitary group by unitary representations of finite groups makes it possible to reproduce quantum formalism without loss of its empirical…

Let $G$ be a finite primitive permutation group on a set $\Omega$ and recall that the fixed point ratio of an element $x \in G$, denoted ${\rm fpr}(x)$, is the proportion of points in $\Omega$ fixed by $x$. Fixed point ratios in this…

A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…

For finite-dimensional Hopf algebras, their classification in characteristic $0$ (e.g. over $\mathbb{C}$) has been investigated for decades with many fruitful results, but their structures in positive characteristic have remained elusive.…

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

We use the Bateman--Horn Conjecture from number theory to give strong evidence of a positive answer to Peter Neumann's question, whether there are infinitely many simple groups of order a product of six primes. (Those with fewer than six…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

An approach to representations of finite groups is presented without recourse to character theory. Considering the group algebra C[G] as an algebra of linear maps on C[G] (by left multiplication), we derive the primitive central idempotents…

In this paper we study arithmetical and structural features of a finite group that possesses exactly two conjugacy class sizes that are composite numbers.

A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…

We introduce a new framework for solving an important class of computational problems involving finite permutation groups, which includes calculating set stabilisers, intersections of subgroups, and isomorphisms of combinatorial structures.…

We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…

Combining geometric group theory techniques with geometric topology tools, we show how primitive cohomologies provide useful insights towards unifying the mathematical formulation of Gromov-Witten invariants. In particular, we emphasise the…

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…

We propose an interpretation for the meets and joins in the lattice of experimental propositions of a physical theory, answering a question of Birkhoff and von Neumann in [1]. When the lattice is atomistic, it is isomorphic to the lattice…

We show that the minimal base size $b(G)$ of a finite primitive permutation group $G$ of degree $n$ is at most $2 (\log |G|/\log n) + 24$. This bound is asymptotically best possible since there exists a sequence of primitive permutation…

An overview of the results of new exhaustive computations of gaps between primes in arithmetic progressions is presented. We also give new numerical results for exceptionally large least primes in arithmetic progressions.

To every involutive non-degenerate set-theoretic solution $(X,r)$ of the Yang-Baxter equation on a finite set $X$ there is a naturally associated finite solvable permutation group ${\mathcal G}(X,r)$ acting on $X$. We prove that every…

We prove that there exist finitely presented, residually finite groups that are profinitely rigid in the class of all finitely presented groups but not in the class of all finitely generated groups. These groups are of the form $\Gamma…