ScholarWorksIndianapolis
  • Communities & Collections
  • Browse ScholarWorks
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Subject

Browsing by Subject "Chromatic zeros"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    Item
    Chromatic zeros on hierarchical lattices and equidistribution on parameter space
    (EMS Press, 2021-09) Chio, Ivan; Roeder, Roland K. W.; Mathematical Sciences, School of Science
    Associated to any finite simple graph $\\Gamma$ is the chromatic polynomial $\\mathcal{P}\\Gamma(q)$ whose complex zeros are called the \_chromatic zeros of $\\Gamma$. A hierarchical lattice is a sequence of finite simple graphs ${\\Gamman}{n=0}^\\infty$ built recursively using a substitution rule expressed in terms of a generating graph. For each $n$, let $\\mun$ denote the probability measure that assigns a Dirac measure to each chromatic zero of $\\Gamma_n$. Under a mild hypothesis on the generating graph, we prove that the sequence $\\mu_n$ converges to some measure $\\mu$ as $n$ tends to infinity. We call $\\mu$ the \_limiting measure of chromatic zeros associated to ${\\Gamman}{n=0}^\\infty$. In the case of the diamond hierarchical lattice we prove that the support of $\\mu$ has Hausdorff dimension two. The main techniques used come from holomorphic dynamics and more specifically the theories of activity/bifurcation currents and arithmetic dynamics. We prove a new equidistribution theorem that can be used to relate the chromatic zeros of a hierarchical lattice to the activity current of a particular marked point. We expect that this equidistribution theorem will have several other applications.
About IU Indianapolis ScholarWorks
  • Accessibility
  • Privacy Notice
  • Copyright © 2025 The Trustees of Indiana University