Related papers: On the group generated by the round functions of t…

Let ${\mathbb F}_q$ be a finite field of characteristic two and ${\mathbb F}_q(X_1,...,X_n)$ a rational function field. We use matrix methods to obtain explicit transcendental bases of the invariant subfields of orthogonal groups and…

Let $G$ be a finite group and $p$ be a prime. We study the kernel of the map, between the Burnside ring of $G$ and the Grothendieck ring of $\mathbb{F}_p[G]$-modules, taking a $G$-set to its associated permutation module. We are able, for…

We present the ideas behind an algorithm to compute normalizers of primitive groups with non-regular socle in polynomial time. We highlight a concept we developed called permutation morphisms and present timings for a partial implementation…

We classify the simplest rational elements in a twisted loop group, and prove that dressing actions of them on proper indefinite affine spheres give the classical Tzitz\'eica transformation and its dual. We also give the group point of view…

We prove that the double covers of the alternating and symmetric groups are determined by their complex group algebras. To be more precise, let $n\geq 5$ be an integer, $G$ a finite group, and let $\AAA$ and $\SSS^\pm$ denote the double…

We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in…

The twisted Drinfeld double (or quasi-quantum double) of a finite group with a 3-cocycle is identified with a certain twisted groupoid algebra. The groupoid is the loop (or inertia) groupoid of the original group and the twisting is shown…

We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…

The analysis of quantum algorithms which query random, invertible permutations has been a long-standing challenge in cryptography. Many techniques which apply to random oracles fail, or are not known to generalize to this setting. As a…

Hereunder we continue the study of the representation theory of the algebra of permutation operators acting on the $n$-fold tensor product space, partially transposed on the last subsystem. We develop the concept of partially reduced…

In this paper, we construct several new permutation polynomials over finite fields. First, using the linearized polynomials, we construct the permutation polynomial of the form $\sum_{i=1}^k(L_{i}(x)+\gamma_i)h_i(B(x))$ over ${\bf…

We show that any complex (respectively real) representation of finite group naturally generates a open-closed (respectively Klein) topological field theory over complex numbers. We relate the 1-point correlator for the projective plane in…

Bazzi and Mitter [3] showed that binary dihedral group codes are asymptotically good. In this paper we prove that the dihedral group codes over any finite field with good mathematical properties are asymptotically good. If the…

Several structural results about permutation groups of finite rank definable in differentially closed fields of characteristic zero (and other similar theories) are obtained. In particular, it is shown that every finite rank definably…

Cryptographic primitives are fundamental for information security: they are used as basic components for cryptographic protocols or public-key cryptosystems. In many cases, their security proofs consist in showing that they are reducible to…

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

In this paper, we introduce a novel approach for generating random elements of a finite group given a set of generators of that. Our method draws upon combinatorial group theory and automata theory to achieve this objective. Furthermore, we…

We define a notion of roundness for finite groups. Roughly speaking, a group is round if one can order its elements in a cycle in such a way that some natural summation operators map this cycle into new cycles containing all the elements of…

We show, under some natural conditions, that the set of abelian (and thus also cyclotomic) multiplicatively dependent points on an irreducible curve over a number field is a finite union of preimages of roots of unity by a certain finite…

We investigate the construction of circulant matrices derived from primitive roots over finite fields. Our approach reduces exponential sums to Jacobi sums, thereby establishing explicit connections between character theory and matrix…