134 search results - page 7 / 27 » Combinatorics of diagrams of permutations |
COMBINATORICS
1999
13 years 9 months ago
1999
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to ext...
DCC
2005
IEEE
14 years 9 months ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
COMBINATORICS
2007
13 years 9 months ago
2007
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
COMBINATORICS
2006
13 years 9 months ago
2006
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
COMBINATORICS
2002
13 years 9 months ago
2002
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...