Sciweavers

1215 search results - page 106 / 243
» Combinatorics
Sort
View
108
Voted
COMBINATORICS
2006
120views more  COMBINATORICS 2006»
15 years 3 months ago
Cycle Lengths in a Permutation are Typically Poisson
The set of cycle lengths of almost all permutations in Sn are "Poisson distributed": we show that this remains true even when we restrict the number of cycles in the per...
Andrew Granville
117
Voted
COMBINATORICS
2006
108views more  COMBINATORICS 2006»
15 years 3 months ago
Grothendieck Bialgebras, Partition Lattices, and Symmetric Functions in Noncommutative Variables
We show that the Grothendieck bialgebra of the semi-tower of partition lattice algebras is isomorphic to the graded dual of the bialgebra of symmetric functions in noncommutative ...
Nantel Bergeron, Christophe Hohlweg, Mercedes Rosa...
COMBINATORICS
2006
83views more  COMBINATORICS 2006»
15 years 3 months ago
Permutations Generated by a Stack of Depth 2 and an Infinite Stack in Series
We prove that the set of permutations generated by a stack of depth two and an infinite stack in series has a basis (defining set of forbidden patterns) consisting of 20 permutati...
Murray Elder
COMBINATORICS
2006
114views more  COMBINATORICS 2006»
15 years 3 months ago
The Maximum Distinguishing Number of a Group
Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X, denoted DG(X), is the smallest number of colors such that there exists a coloring...
Melody Chan
COMBINATORICS
2006
100views more  COMBINATORICS 2006»
15 years 3 months ago
Parity Versions of 2-Connectedness
This paper introduces parity versions of familiar graph theoretic results, in particular results related to 2-connectedness. The even and odd circuit connected graphs are characte...
C. Little, A. Vince