Results 1 to 10 of about 407,922 (313)
Journal of Algebraic Combinatorics, 2013 Updated with minor corrections reflecting referee comments.
Elizalde, Sergi, Roichman, Yuval
openaire +3 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 +2 more
openaire +4 more sources
Palindromic Permutations And Generalized Smarandache Palindromic Permutations
, 2006 The idea of left(right) palindromic permutations(LPPs,RPPs) and left(right) generalized Smarandache palindromic permutations(LGSPPs,RGSPPs) are introduced in symmetric groups S_n of degree n. It is shown that in S_n, there exist a LPP and a RPP and they are unique(this fact is demonstrated using S_2 and S_3).
Jaiyeola, Temitope Gbolahan
openaire +6 more sources
The Dirac Equation, Mass and Arithmetic by Permutations of Automaton States [PDF]
EntropyThe cornerstones of the Cellular Automaton Interpretation of Quantum Mechanics are its underlying ontological states that evolve by permutations. They do not create would-be quantum mechanical superposition states.
Hans-Thomas Elze
doaj +2 more sources
Information, 2021 During the search for S-boxes resistant to Power Attacks, the S-box space has recently been divided into Hamming Weight classes, according to its theoretical resistance to these attacks using the metric variance of the confusion coefficient.
Carlos Miguel Legón-Pérez +5 more
doaj +1 more source
SIF Permutations and Chord-Connected Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A stabilized-interval-free (SIF) permutation on [n], introduced by Callan, is a permutation that does not stabilize any proper interval of [n]. Such permutations are known to be the irreducibles in the decomposition of permutations along non-crossing ...
Natasha Blitvić
doaj +1 more source
Cladistics, 1994 Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/31724/1/0000662 ...
Farris, James S. +3 more
openaire +4 more sources
Permutations on the Random Permutation [PDF]
The Electronic Journal of Combinatorics, 2015 The random permutation is the Fraïssé limit of the class of finite structures with two linear orders. Answering a problem stated by Peter Cameron in 2002, we use a recent Ramsey-theoretic technique to show that there exist precisely 39 closed supergroups of the automorphism group of the random permutation, and thereby expose all symmetries of this ...
Linman, Julie, Pinsker, Michael
openaire +3 more sources
IEEE Transactions on Information Theory, 2023 Motivated by the problem of constructing bijective maps with low differential uniformity, we introduce the notion of permutation resemblance of a function, which looks to measure the distance a given map is from being a permutation. We prove several results concerning permutation resemblance and show how it can be used to produce low differentially ...
Li-An Chen, Robert S. Coulter
openaire +2 more sources
The Electronic Journal of Combinatorics, 2021 The concept of prolificity was previously introduced by the authors in the context of compositions of integers. We give a general interpretation of prolificity that applies across a range of relational structures defined in terms of counting embeddings.
Albert, Michael, Tannock, Murray
openaire +1 more source