Inversions of permutations in symmetric, alternating, and dihedral groups.
Indong, Dexter Jane L., Peralta, Gilbert R. (2008)
Journal of Integer Sequences [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On counting permutations by pairs of congruence classes of major index.”
Inversions of permutations in symmetric, alternating, and dihedral groups.
Variations on descents and inversions in permutations.
Chebikin, Denis (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Restricted permutations, Fibonacci numbers, and -generalized Fibonacci numbers.
Egge, Eric S., Mansour, Toufik (2005)
Integers
Similarity:
Enumeration schemes for permutations avoiding barred patterns.
Pudwell, Lara (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Enumerating permutations that avoid three term arithmetic progressions.
Sharma, Arun (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A generalization of an IMO problem.
Fink, Alex (2006)
Integers
Similarity:
Permutation separations and complete bipartite factorisations of .
Martin, Nigel, Stong, Richard (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alternating, pattern-avoiding permutations.
Lewis, Joel Brewster (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Divisibility properties of subgroup numbers for the modular group.
Müller, T.W., Schlage-Puchta, J.-C. (2005)
The New York Journal of Mathematics [electronic only]
Similarity:
The descent set and connectivity set of a permutation.
Stanley, Richard P. (2005)
Journal of Integer Sequences [electronic only]
Similarity:
The enumeration of simple permutations.
Albert, M.H., Atkinson, M.D., Klazar, M. (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Parity-alternating permutations and successions
Augustine Munagi (2014)
Open Mathematics
Similarity:
The study of parity-alternating permutations of {1, 2, … n} is extended to permutations containing a prescribed number of parity successions - adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using direct construction and elementary combinatorial techniques. Analogous results are derived for circular...
The permutation classes equinumerous to the smooth class.
Bóna, Miklós (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity: