Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. PreLie-decorated hyp ...
Conference paper

PreLie-decorated hypertrees

Bérénice Oger ORCID (1)
(1) Institut Camille Jordan
Download article
Open on HAL
Imported on
November 20, 2016
Published on
December 31, 2012
Last modified on
April 1, 2025
Volume
DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Proceedings
DOI
10.46298/dmtcs.12825
License
https://about.hal.science/hal-authorisation-v1
Indicators
348
Views
769
Downloads

PreLie-decorated hypertrees

Bérénice Oger ORCID (1)
(1) Institut Camille Jordan
Abstract
English
Weighted hypertrees have been used by C. Jensen, J. McCammond, and J. Meier to compute some Euler characteristics in group theory. We link them to decorated hypertrees and 2-coloured rooted trees. After the enumeration of pointed and non-pointed types of decorated hypertrees, we compute the character for the action of the symmetric group on these hypertrees.
French
Des hyperarbres pondérés ont été utilisés en théorie des groupes, par C. Jensen, J. McCammond et J. Meier pour calculer des caractéristiques d’Euler. Nous relions ces hyperarbres pondérés à des hyperarbres décorés, puis à des arbres enracinés 2-colorés. Après énumération des hyperarbres décorés pointés et non pointés, nous déterminons le caractère de l’action du groupe symétrique sur les hyperarbres.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Species
  • Hypertrees
  • Symmetric group action
  • Enumerative combinatorics
Cited by

Source: OpenCitations

  • Phase Transition of Random Non-uniform Hypergraphs

    Lecture notes in computer science

    Authors : Élie de Panafieu ORCID

    Journal reference : Volume , 2013, pp. 127-139

    DOI : 10.1007/978-3-642-45278-9_12
Preview
Loading PDF preview...