Permutations preserving divisibility
نویسندگان
چکیده
منابع مشابه
Permutations preserving divisibility
We give a proof of a theorem on the common divisibility of polynomials and permuted polynomials (over GF (2)) by a polynomial ( ).
متن کاملPerfect divisibility and 2-divisibility
A graph G is said to be 2-divisible if for all (nonempty) induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that ω(A) < ω(H) and ω(B) < ω(H). A graph G is said to be perfectly divisible if for all induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that H[A] is perfect and ω(B) < ω(H). We prove that if a graph is (P5, C5)-free, then it is 2-divisibl...
متن کاملStatistics-preserving bijections between classical and cyclic permutations
a r t i c l e i n f o a b s t r a c t
متن کاملDistance-preserving mappings from binary vectors to permutations
Mappings of the set of binary vectors of a fixed length to the set of permutations of the same length are useful for the construction of permutation codes. In this correspondence, several explicit constructions of such mappings preserving or increasing the Hamming distance are given. Some applications are given to illustrate the usefulness of the construction. In particular, a new lower bound o...
متن کاملGenerating Sym(ω) by Permutations Preserving Dense Orders
We show how generic permutations of ω can be presented by products of permutations preserving dense orders.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2001
ISSN: 0018-9448
DOI: 10.1109/18.915685