منابع مشابه
Permutation tableaux and permutation patterns
Lauren Williams (joint work with Einar Steingrímsson) We introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the " Le-diagrams " of Alex Postnikov. The structure of these tableaux is in some ways more transparent than the structure of permutations; therefore we believe tha...
متن کاملPermutation Bigraphs: An Analogue of Permutation Graphs
We introduce the class of permutation bigraphs as an analogue of permutation graphs. We show that this is precisely the class of bigraphs having Ferrers dimension at most 2. We also characterize the subclasses of interval bigraphs and indifference bigraphs in terms of their permutation labelings, and we relate permutation bigraphs to posets of dimension 2.
متن کاملPermutation Generation: Two New Permutation Algorithms
Two completely new algorithms for generating permutations–shift cursor algorithm and level algorithm–and their efficient implementations are presented in this paper. One implementation of shift cursor algorithm gives an optimal solution of permutation generation problem, and one implementation of level algorithm can be used to generate random permutations.
متن کاملquasi-permutation representations of suzttki group
by a quasi-permutation matrix we mean a square matrix over the complex field c with non-negative integral trace. thus every permutation matrix over c is a quasipermutation matrix. for a given finite group g, let p(g) denote the minimal degree of a faithful permutation representation of g (or of a faithful representation of g by permutation matrices), let q(g) denote the minimal degree of a fait...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2018
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.97.012139