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. Weighted Tree-Number ...
Conference paper

Weighted Tree-Numbers of Matroid Complexes

Woong Kook (1), Kang-Ju Lee (1)
(1) Department of Mathematical Sciences [Seoul]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2014
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Proceedings
DOI
10.46298/dmtcs.2459
License
Attribution 4.0 International (CC BY 4.0)
Indicators
667
Views
1163
Downloads

Weighted Tree-Numbers of Matroid Complexes

Woong Kook (1), Kang-Ju Lee (1)
(1) Department of Mathematical Sciences [Seoul]
Abstract
English
We give a new formula for the weighted high-dimensional tree-numbers of matroid complexes. This formula is derived from our result that the spectra of the weighted combinatorial Laplacians of matroid complexes consist of polynomials in the weights. In the formula, Crapo’s $\beta$-invariant appears as the key factor relating weighted combinatorial Laplacians and weighted tree-numbers for matroid complexes.
French
Nous présentons une nouvelle formule pour les nombres d’arbres pondérés de grande dimension des matroïdes complexes. Cette formule est dérivée du résultat que le spectre des Laplaciens combinatoires pondérés des matrides complexes sont des polynômes à plusieurs variables. Dans la formule, le $\beta$;-invariant de Crapo apparaît comme étant le facteur clé reliant les Laplaciens combinatoires pondérés et les nombres d’arbres pondérés des matroïdes complexes.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • matroid complex
  • weighted combinatorial Laplacians
  • weighted tree-numbers
Cited by

Source: OpenCitations

  • Simplicial and cellular trees

    ˜The œIMA volumes in mathematics and its applications

    Authors : Art M. Duval, Caroline J. Klivans, Jeremy L. Martin ORCID

    Journal reference : Volume , 2016, pp. 713-752

    DOI : 10.1007/978-3-319-24298-9_28
Preview
Loading PDF preview...