2,089 research outputs found
Tree-like properties of cycle factorizations
We provide a bijection between the set of factorizations, that is, ordered
(n-1)-tuples of transpositions in whose product is (12...n),
and labelled trees on vertices. We prove a refinement of a theorem of
D\'{e}nes that establishes new tree-like properties of factorizations. In
particular, we show that a certain class of transpositions of a factorization
correspond naturally under our bijection to leaf edges of a tree. Moreover, we
give a generalization of this fact.Comment: 10 pages, 3 figure
Bijective Enumeration of 3-Factorizations of an N-Cycle
This paper is dedicated to the factorizations of the symmetric group.
Introducing a new bijection for partitioned 3-cacti, we derive an el- egant
formula for the number of factorizations of a long cycle into a product of
three permutations. As the most salient aspect, our construction provides the
first purely combinatorial computation of this number
Lyashko-Looijenga morphisms and submaximal factorisations of a Coxeter element
When W is a finite reflection group, the noncrossing partition lattice NCP_W
of type W is a rich combinatorial object, extending the notion of noncrossing
partitions of an n-gon. A formula (for which the only known proofs are
case-by-case) expresses the number of multichains of a given length in NCP_W as
a generalised Fuss-Catalan number, depending on the invariant degrees of W. We
describe how to understand some specifications of this formula in a case-free
way, using an interpretation of the chains of NCP_W as fibers of a
Lyashko-Looijenga covering (LL), constructed from the geometry of the
discriminant hypersurface of W. We study algebraically the map LL, describing
the factorisations of its discriminant and its Jacobian. As byproducts, we
generalise a formula stated by K. Saito for real reflection groups, and we
deduce new enumeration formulas for certain factorisations of a Coxeter element
of W.Comment: 18 pages. Version 2 : corrected typos and improved presentation.
Version 3 : corrected typos, added illustrated example. To appear in Journal
of Algebraic Combinatoric
Connectivity Properties of Factorization Posets in Generated Groups
We consider three notions of connectivity and their interactions in partially
ordered sets coming from reduced factorizations of an element in a generated
group. While one form of connectivity essentially reflects the connectivity of
the poset diagram, the other two are a bit more involved: Hurwitz-connectivity
has its origins in algebraic geometry, and shellability in topology. We propose
a framework to study these connectivity properties in a uniform way. Our main
tool is a certain linear order of the generators that is compatible with the
chosen element.Comment: 35 pages, 17 figures. Comments are very welcome. Final versio
- …