Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

JCT
2006

favoriteEmaildiscussreport

53views more JCT 2006»

On the number of factorizations of a full cycle

13 years 5 months ago

On the number of factorizations of a full cycle

Download garsia.math.yorku.ca

We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic means, extending recent work of Biane [Nombre de factorisations d'un grand cycle, S

John Irving

Real-time Traffic

Discrete Math | Grand Cycle | JCT 2006 | Large Cycles |

claim paper

Related Content

» A bijective proof of Jacksons formula for the number of factorizations of a cycle

» The upper bound of the number of cycles in a 2factor of a line graph

» Convergence of the multigrid Vcycle algorithm for secondorder boundary value problems with...

» PTLsim A Cycle Accurate Full System x8664 Microarchitectural Simulator

» A k k1Factor Containing A Given Hamiltonian Cycle

» Simultaneous graph parameters Factor domination and factor total domination

» Engineering OverClocking ReliabilityPerformance TradeOffs for HighPerformance Register Fil...

» De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences

» How to obtain full privacy in auctions

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JCT
Authors	John Irving

Comments (0)