| |
Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Combinatorics (G.2.1) > Permutations And Combinations (G.2.1...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 22
Reviews about "Permutations And Combinations (G.2.1...)":
|
Date Reviewed |
| |
Asymptotic medians of random permutations sampled from reversal random walks
Jamshidpey A., Sankoff D. Theoretical Computer Science 698 9-13, 2017. Type: Article
The area of application of this interesting, and quite advanced, five-page paper is in the study of genomics and chromosomal rearrangements. The median specified in the title “is a point whose sum of distances to k
|
Feb 15 2018 |
| |
Counting and generating permutations in regular classes
Basset N. Algorithmica 76(4): 989-1034, 2016. Type: Article
The signature of a permutation can be described in terms of two symbols that represent ascent and descent in the ordering of the elements. For each regular language (that can be recognized by a finite-state automaton) over those two sy...
|
May 19 2017 |
| |
Odd permutations are nicer than even ones
Cori R., Marcus M., Schaeffer G. European Journal of Combinatorics 33(7): 1467-1478, 2012. Type: Article
The set of all permutations on a finite set of n elements forms a group, with the composition of the permutations as the group operation. A permutation can be considered as a bijection (one-to-one correspondence) fro...
|
Jan 8 2013 |
| |
Permutation patterns
Linton S., Ruskuc N., Vatter V., Cambridge University Press, New York, NY, 2010. 352 pp. Type: Book (978-0-521728-34-8)
This book consists of papers from the Fifth International Conference on Permutation Patterns, held in 2007. The study of permutation patterns is a branch of combinatorics that finds applications in graph theory, model theory, automata ...
|
May 19 2011 |
| |
Uncoverings-by-bases for base-transitive permutation groups
Bailey R. Designs, Codes and Cryptography 41(2): 153-176, 2006. Type: Article
Permuting a codeword generates lists of strings that constitute bases of a permutation group. This paper is a portion (with amplification) of Bailey’s 2005 PhD mathematics dissertation, “Permutation Groups, Error Co...
|
Feb 22 2007 |
| |
Solving Kirkman’s schoolgirl problem in a few seconds
Barnier N., Brisset P. Constraints 10(1): 7-21, 2005. Type: Article
Symmetry maps solutions to solutions and nonsolutions to nonsolutions. Many constraint programming problems are highly symmetric. Symmetry in constraint programs can cause problems for an algorithm that searches a space of partial assi...
|
Nov 15 2006 |
| |
Biplanes with flag-transitive automorphism groups of almost simple type, with alternating or sporadic socle
Regueiro E. European Journal of Combinatorics 26(5): 577-584, 2005. Type: Article
A biplane is a (v, k, 2) design, that is, a structure of v points and v blocks such that every point belongs to exactly k blocks, and every ...
|
Aug 23 2005 |
| |
Permutation statistics and the q, t-Catalan sequence
Loehr N. European Journal of Combinatorics 26(1): 83-93, 2005. Type: Article
The Catalan numbers play a prominent role in combinatorics. Stanley’s book on enumerative combinatorics [1] lists over 95 collections of objects counted by the Catalan numbers. One of the collections of objects counted by the...
|
May 13 2005 |
| |
Harmonic and gold Sturmian words
Carpi A., de Luca A. European Journal of Combinatorics 25(5): 685-705, 2004. Type: Article
In this tour de force, the authors introduce two easily-defined proper subsets of the set PER of all finite words w on {a, b} having two relatively prime periods p
|
Sep 23 2004 |
| |
Tile invariants: new horizons
Pak I. Theoretical Computer Science 303(2-3): 303-331, 2003. Type: Article
The tiling problem can best be described by thinking of the problem of covering a checkerboard with dominoes. One can generalize the problem by allowing other shapes of the board, changing it to have infinite dimensions, allowing for h...
|
Feb 24 2004 |
| |
|
|
| |
|
|
