skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Counting, equidistribution and entropy gaps at infinity with applications to cusped Hitchin representations
Abstract We show that if an eventually positive, non-arithmetic, locally Hölder continuous potential for a topologically mixingcountable Markov shift with (BIP) has an entropy gap at infinity,then one may apply the renewal theorem of Kesseböhmer and Kombrink to obtain counting and equidistributionresults. We apply these general results to obtain counting and equidistribution results for cusped Hitchinrepresentations, and more generally for cusped Anosov representations of geometrically finite Fuchsian groups.  more » « less
Award ID(s):
1906441
PAR ID:
10474583
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
DeGruyter
Date Published:
Journal Name:
Journal für die reine und angewandte Mathematik (Crelles Journal)
Volume:
2022
Issue:
791
ISSN:
0075-4102
Page Range / eLocation ID:
1 to 51
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, International Conference and Workshops on Algorithms and Computation (WALCOM))
    We study counting problems for several types of orientations of chordal graphs: source-sink-free orientations, sink-free orientations, acyclic orientations, and bipolar orientations, and, for the latter two, we also present linear-time uniform samplers. Counting sink-free, acyclic, or bipolar orientations are known to be #P-complete for general graphs, motivating our study on a restricted, yet well-studied, graph class. Our main focus is source-sink-free orientations, a natural restricted version of sink-free orientations related to strong orientations, which we introduce in this work. These orientations are intriguing, since despite their similarity, currently known FPRAS and sampling techniques (such as Markov chains or sink-popping) that apply to sink-free orientations do not seem to apply to source-sink-free orientations. We present fast polynomialtime algorithms counting these orientations on chordal graphs. Our approach combines dynamic programming with inclusion-exclusion (going two levels deep for source-sink-free orientations and one level for sinkfree orientations) throughout the computation. Dynamic programming counting algorithms can be typically used to produce a uniformly random sample. However, due to the negative terms of the inclusion-exclusion, the typical approach to obtain a polynomial-time sampling algorithm does not apply in our case. Obtaining such an almost uniform sampling algorithm for source-sink-free orientations in chordal graphs remains an open problem. Little is known about counting or sampling of acyclic or bipolar orientations, even on restricted graph classes. We design efficient (linear-time) exact uniform sampling algorithms for these orientations on chordal graphs. These algorithms are a byproduct of our counting algorithms, but unlike in other works that provide dynamic-programming-based samplers, we produce a random orientation without computing the corresponding count, which leads to a faster running time than the counting algorithm (since it avoids manipulation of large integers). 
    more » « less
  2. ; (, Journal of the London Mathematical Society)
    Abstract In this work, we give an explicit formula for the Fourier coefficients of Eisenstein series corresponding to certain arithmetic lattices acting on hyperbolic ‐space. As a consequence, we obtain results on location of all poles of these Eisenstein series as well as their supremum norms. We use this information to get new results on counting rational points on spheres. 
    more » « less
  3. ; (, Monthly Notices of the Royal Astronomical Society)
    ABSTRACT We detail a method to measure the correspondence between dark matter (DM) models and observations of stellar populations within Local Group dwarf spheroidal galaxies (LG dSphs) that assumes no parametric stellar distribution. Solving the spherical or cylindrical Jeans equations, we calculate the consistency of DM and stellar kinematic models with stellar positions and line-of-sight velocities. Our method can be used to search for signals of standard and exotic DM distributions. Applying our methodology to the Fornax LG dSph and using statistical bootstrapping, we find: (i) that oblate or prolate cored DM haloes match the stellar data, respectively, ≃60 or ≃370 times better than oblate or prolate cusped DM haloes for isotropic and isothermal stellar velocity dispersions, (ii) that cusped spherical DM haloes and cored spherical DM haloes match the Fornax data similarly well for isotropic stellar velocity dispersions, (iii) that the semiminor to semimajor axial ratio of spheroidal DM haloes are more extreme than 80 per cent of those predicted by Lambda cold dark matter with baryon simulations, (iv) that oblate cored or cusped DM haloes are, respectively, ≃5 or ≃30 times better matches to Fornax than prolate cored or cusped DM haloes, and (v) that Fornax shows no evidence of a disc-like structure with more than two per cent of the total DM mass. We further note that the best-fitting cusped haloes universally favour the largest mass and size fit parameters. If these extreme limits are decreased, the cusped halo likelihoods decrease relative to those of cored haloes. 
    more » « less
  4. ; ; ; ; ; (, Random Structures & Algorithms)
    Efficient algorithms for approximate counting and sampling in spin systems typically apply in the so‐called high‐temperature regime, where the interaction between neighboring spins is “weak.” Instead, recent work of Jenssen, Keevash, and Perkins yields polynomial‐time algorithms in the low‐temperature regime on bounded‐degree (bipartite) expander graphs using polymer models and the cluster expansion. In order to speed up these algorithms (so the exponent in the run time does not depend on the degree bound) we present a Markov chain for polymer models and show that it is rapidly mixing under exponential decay of polymer weights. This yields, for example, an‐time sampling algorithm for the low‐temperature ferromagnetic Potts model on bounded‐degree expander graphs. Combining our results for the hard‐core and Potts models with Markov chain comparison tools, we obtain polynomial mixing time for Glauber dynamics restricted to appropriate portions of the state space. 
    more » « less
  5. (, Communications on Pure and Applied Mathematics)
    Abstract We apply new results on free boundary regularity to obtain a quantitative convergence rate for the shape optimizers of the first Dirichlet eigenvalue in periodic homogenization. We obtain a linear (with logarithmic factors) convergence rate for the optimizing eigenvalue. Large scale Lipschitz free boundary regularity of almost minimizers is used to apply the optimal homogenization theory in Lipschitz domains of Kenig et al. A key idea, to deal with the hard constraint on the volume, is a combination of a large scale almost dilation invariance with a selection principle argument. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email