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

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

We prove a broad generalization of a theorem of W. Burnside on real characters using permutation characters. Under a necessary hypothesis, We can give some control on multiplicities (a result that needs the Classification of Finite Simple…

We define the category of mixed Tate motives over the ring of S-integers of a number field. We define the motivic fundamental group (made unipotent) of a unirational variety over a number field. We apply this to the study of the motivic…

A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of…

We describe those group algebras over fields of characteristic different from 2 whose units symmetric with respect to the classical involution, satisfy some group identity.

The irreducible characters of the symmetric group are a symmetric polynomial in the eigenvalues of a permutation matrix. They can therefore be realized as a symmetric function that can be evaluated at a set of variables and form a basis of…

A factorization of a permutation into transpositions is called "primitive" if its factors are weakly ordered. We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously…

The commuting probability of a finite group is defined to be the probability that two randomly chosen group elements commute. Let P \subset (0,1] be the set of commuting probabilities of all finite groups. We prove that every point of P is…

In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…

The covering number of a finite group $G$, denoted $\sigma(G)$, is the smallest positive integer $k$ such that $G$ is a union of $k$ proper subgroups. We calculate $\sigma(G)$ for a family of primitive groups $G$ with a unique minimal…

Given a permutation group acting on coordinates of $\mathbb{R}^n$, we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of such polytopes are called \emph{core points} and they play a…

We determine the irreducible constituents of the Steinberg character of an orthogonal group over a finite field restricted to the orthogonal group of one less dimension

Let $A$ be an abelian variety over the function field $K$ of a curve over a finite field. We describe several mild geometric conditions ensuring that the group $A(K^{\rm perf})$ is finitely generated and that the $p$-primary torsion…

Coin flipping is a cryptographic primitive for which strictly better protocols exist if the players are not only allowed to exchange classical, but also quantum messages. During the past few years, several results have appeared which give a…

It is shown, from $\sigma$-centered Martin's Axiom, that there exists a proper dense subgroup of the symmetric group on a countably infinite set whose natural action on sufficiently flexible relational structures is transitive. This allows…

We define and study quantum permutations of infinite sets. This leads to discrete quantum groups which can be viewed as infinite variants of the quantum permutation groups introduced by Wang. More precisely, the resulting quantum groups…

Oblivious transfer is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately, oblivious transfer cannot be achieved in an unconditionally secure way…

Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In this paper, we construct several new classes of permutation…

In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.

We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…