Asymptotics of symmetry in matroids

Rudi Pendavingh, Jorn van der Pol

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

We prove that asymptotically almost all matroids have a trivial automorphism group, or an automorphism group generated by a single transposition. Additionally, we show that asymptotically almost all sparse paving matroids have a trivial automorphism group.

LanguageEnglish
Pages349-365
JournalJournal of Combinatorial Theory. Series B
Volume135
DOIs
StatePublished - 1 Mar 2019

Fingerprint

Matroid
Automorphism Group
Symmetry
Trivial
Transposition

Keywords

  • Asymptotic enumeration
  • Automorphism group
  • Matroid
  • Symmetry

Cite this

@article{39b19a4474a842acacc5c0bd45aa9346,
title = "Asymptotics of symmetry in matroids",
abstract = "We prove that asymptotically almost all matroids have a trivial automorphism group, or an automorphism group generated by a single transposition. Additionally, we show that asymptotically almost all sparse paving matroids have a trivial automorphism group.",
keywords = "Asymptotic enumeration, Automorphism group, Matroid, Symmetry",
author = "Rudi Pendavingh and {van der Pol}, Jorn",
year = "2019",
month = "3",
day = "1",
doi = "10.1016/j.jctb.2018.09.001",
language = "English",
volume = "135",
pages = "349--365",
journal = "Journal of Combinatorial Theory, Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",

}

Asymptotics of symmetry in matroids. / Pendavingh, Rudi; van der Pol, Jorn.

In: Journal of Combinatorial Theory. Series B, Vol. 135, 01.03.2019, p. 349-365.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Asymptotics of symmetry in matroids

AU - Pendavingh,Rudi

AU - van der Pol,Jorn

PY - 2019/3/1

Y1 - 2019/3/1

N2 - We prove that asymptotically almost all matroids have a trivial automorphism group, or an automorphism group generated by a single transposition. Additionally, we show that asymptotically almost all sparse paving matroids have a trivial automorphism group.

AB - We prove that asymptotically almost all matroids have a trivial automorphism group, or an automorphism group generated by a single transposition. Additionally, we show that asymptotically almost all sparse paving matroids have a trivial automorphism group.

KW - Asymptotic enumeration

KW - Automorphism group

KW - Matroid

KW - Symmetry

UR - http://www.scopus.com/inward/record.url?scp=85053331583&partnerID=8YFLogxK

U2 - 10.1016/j.jctb.2018.09.001

DO - 10.1016/j.jctb.2018.09.001

M3 - Article

VL - 135

SP - 349

EP - 365

JO - Journal of Combinatorial Theory, Series B

T2 - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

SN - 0095-8956

ER -