Results 31 to 40 of about 203,327 (292)

Prime order derangements in primitive permutation groups [PDF]

, 2011
Let G be a transitive permutation group on a finite set Ω of size at least 2. An element of G is a derangement if it has no fixed points on Ω. Let r be a prime divisor of |Ω|.
Giudici, M., Giudici, Michael, Robert A. Wilson, Wilson, R.A., Wilson, Robert, Timothy C. Burness, Wilson, Robert A., Burness, Tim C, Burness, Timothy C., Burness, T.C., Michael Giudici   +10 more
core   +1 more source

Permutation and complete permutation polynomials

Finite Fields and Their Applications, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leonid A. Bassalygo, Victor A. Zinoviev
openaire   +2 more sources

Interlocked Permutations [PDF]

SIAM Journal on Discrete Mathematics, 2019
The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We solve the problem for three particular channels. Our results are purely combinatorial and in line with previous work of the third author about permutation capacity.
Cohen, Gérard, Fachini, Emanuela, Körner, János   +2 more
openaire   +4 more sources

Permutations by Interchanges [PDF]

The Computer Journal, 1963
Methods for obtaining all possible permutations of a number of objects, in which each permutation differs from its predecessor only by the interchange of two of the objects, are discussed. Details of two programs which produce these permutations are given, one allowing a specified position to be filled by each of the objects in a predetermined order ...
openaire   +3 more sources

Equivalence classes of matrices over a finite field

International Journal of Mathematics and Mathematical Sciences, 1979
Let Fq=GF(q) denote the finite field of order q and F(m,q) the ring of m×m matrices over Fq. Let Ω be a group of permutations of Fq. If A,BϵF(m,q) then A is equivalent to B relative to Ω if there exists ϕϵΩ such that ϕ(A)=B where ϕ(A) is computed by ...
Gary L. Mullen
doaj   +1 more source

The Yellowstone Permutation

J. Integer Seq., 2015
Define a sequence of positive integers by the rule that a(n) = n for 1 <= n <= 3, and for n >= 4, a(n) is the smallest number not already in the sequence which has a common factor with a(n-2) and is relatively prime to a(n-1). We show that this is a permutation of the positive integers. The remarkable graph of this sequence consists of runs of
David L. Applegate, Hans Havermann, Robert G. Selcoe, Vladimir Shevelev, Neil J. A. Sloane, Reinhard Zumkeller   +5 more
openaire   +4 more sources

Implementing a Class of Permutation Tests: The coin Package [PDF]

, 2007
The R package coin implements a unified approach to permutation tests providing a huge class of independence tests for nominal, ordered, numeric, and censored data as well as multivariate data at mixed scales.
van de Wiel, Mark A., Torsten Hothorn, Achim Zeileis, van de Wiel, Mark A., Wiel, M.A. van de, Hornik, Kurt, Hornik, K., Zeileis, Achim, Kurt Hornik, Hothorn, Torsten, van de Wiel, M.A., Hothorn, T., Mark A. van de Wiel, Wiel, Mark A. van de, Zeileis, A.   +14 more
core   +2 more sources

Computing in permutation groups without memory [PDF]

, 2013
Funding: UK Engineering and Physical Sciences Research Council (EP/K033956/1)Memoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory.
Maximilien Gadouleau, Cameron, P., Gadouleau, Maximilien, Cameron, Peter Jephson, Gadouleau, M., Cameron, Peter, Fairbairn, Ben, Cameron, P.J., Peter J. Cameron, Ben Fairbairn, Gadoleau, M.   +10 more
core   +2 more sources

Homogeneous Permutations [PDF]

The Electronic Journal of Combinatorics, 2002
There are just five Fraïssé classes of permutations (apart from the trivial class of permutations of a singleton set); these are the identity permutations, reversing permutations, composites (in either order) of these two classes, and all permutations. The paper also discusses infinite generalisations of permutations, and the connection with Fraïssé's ...
openaire   +3 more sources

Profiles of Permutations [PDF]

The Electronic Journal of Combinatorics, 2009
This paper develops an analogy between the cycle structure of, on the one hand, random permutations with cycle lengths restricted to lie in an infinite set $S$ with asymptotic density $\sigma$ and, on the other hand, permutations selected according to the Ewens distribution with parameter $\sigma$.
openaire   +3 more sources