Add to ORKGAbstract. Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements a1,..., am of the cyclic group of order m, there is a permutation pi such that 1a pi(1) + · · ·+mapi(m) = 0
The primitive finite permutation groups containing a cycle are classified. Of these, only the altern...
AbstractLet F=GF(q) denote the finite field of order q, and Fmn the ring of m×n matrices over F. Let...
AbstractWe consider rings R, not necessarily with 1, for which there is a nontrivial permutation σ o...
A permutation pi of an abelian group G is said to destroy arithmetic progressions (APs) if, whenever...
Abstract. A permutation pi of an abelian group G is said to destroy arithmetic progressions (APs) if...
Abstract. Starting with a result in combinatorial number theory we prove that (apart from a couple o...
A permutation pi of an abelian group G (that is, a bijection from G to itself) will be said to avoid...
AbstractLetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,...
AbstractStarting with a result in combinatorial number theory we prove that (apart from a couple of ...
Starting with a result in combinatorial number theory we prove that (apart from a couple of excepti...
AbstractLetSbe a finite subset of a groupG,|S|=n, and letg∈SS. Thenginduces a partial function λg:S→...
Groups naturally occu as the symmetries of an object. This is why they appear in so many different a...
AbstractOut of the classical theory of Riemann surfaces, we extract the following combinatorial theo...
Let H be a subgroup of the multiplicative group of a finite field. In this note we give a method for...
AbstractLet G be a finite group with two transitive permutation representations on the sets Ω1 and Ω...
The primitive finite permutation groups containing a cycle are classified. Of these, only the altern...
AbstractLet F=GF(q) denote the finite field of order q, and Fmn the ring of m×n matrices over F. Let...
AbstractWe consider rings R, not necessarily with 1, for which there is a nontrivial permutation σ o...
A permutation pi of an abelian group G is said to destroy arithmetic progressions (APs) if, whenever...
Abstract. A permutation pi of an abelian group G is said to destroy arithmetic progressions (APs) if...
Abstract. Starting with a result in combinatorial number theory we prove that (apart from a couple o...
A permutation pi of an abelian group G (that is, a bijection from G to itself) will be said to avoid...
AbstractLetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,...
AbstractStarting with a result in combinatorial number theory we prove that (apart from a couple of ...
Starting with a result in combinatorial number theory we prove that (apart from a couple of excepti...
AbstractLetSbe a finite subset of a groupG,|S|=n, and letg∈SS. Thenginduces a partial function λg:S→...
Groups naturally occu as the symmetries of an object. This is why they appear in so many different a...
AbstractOut of the classical theory of Riemann surfaces, we extract the following combinatorial theo...
Let H be a subgroup of the multiplicative group of a finite field. In this note we give a method for...
AbstractLet G be a finite group with two transitive permutation representations on the sets Ω1 and Ω...
The primitive finite permutation groups containing a cycle are classified. Of these, only the altern...
AbstractLet F=GF(q) denote the finite field of order q, and Fmn the ring of m×n matrices over F. Let...
AbstractWe consider rings R, not necessarily with 1, for which there is a nontrivial permutation σ o...
