EUVIMEDEUVIMED entdecken
Crossref

The number of spanning trees of the Bruhat graph

Richard Ehrenborg

Advances in Applied Mathematics · 2021-04 · 125 · 102150

DOI: 10.1016/j.aam.2020.102150 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Advances in Applied Mathematics, 2021-04. Verfasst von Richard Ehrenborg. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 7 Literaturangaben. Gefördert von: Simons Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We provide an explicit product formula for the number of spanning trees of the Bruhat graph of the symmetric group, that is, the graph where two permutations π and σ are connected with an edge if π σ − 1 is a transposition. We also give the number of spanning trees for the graph where the two permutations are connected if π σ − 1 is an r-cycle for r even. For r odd we obtain the similar result for the alternating group.

Förderung

  • Simons Foundation

Zitieren

APA

Ehrenborg, R. (2021). The number of spanning trees of the Bruhat graph. Advances in Applied Mathematics, 125, 102150. https://doi.org/10.1016/j.aam.2020.102150

Vancouver

Ehrenborg R. The number of spanning trees of the Bruhat graph. Advances in Applied Mathematics. 2021;125:102150. doi:10.1016/j.aam.2020.102150

BibTeX
@article{Ehrenborg2021,
  author = {Ehrenborg, Richard},
  title = {The number of spanning trees of the Bruhat graph},
  journal = {Advances in Applied Mathematics},
  year = {2021},
  volume = {125},
  pages = {102150},
  doi = {10.1016/j.aam.2020.102150}
}
Kostenlos starten →