2021
DOI: 10.48550/arxiv.2112.02147
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Hall-Littlewood polynomials, boundaries, and $p$-adic random matrices

Abstract: We prove that the boundary of the Hall-Littlewood t-deformation of the Gelfand-Tsetlin graph is parametrized by infinite integer signatures, extending results of Gorin [Gor12] and Cuenca [Cue18] on boundaries of related deformed Gelfand-Tsetlin graphs. In the special case when 1/t is a prime p we use this to recover results of Bufetov-Qiu [BQ17] and Assiotis [Ass20] on infinite p-adic random matrices, placing them in the general context of branching graphs derived from symmetric functions.Our methods rely on … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 21 publications
0
1
0
Order By: Relevance
“…However, the n = ∞ case of (1.2), which corresponds to the full slowed t-TASEP, can interpreted as the projection of Hall-Littlewood process dynamics to a row 'at infinity'. A fuller account is given in [VP21a], but the basic idea is that with the initial condition where every entry of the Gelfand-Tsetlin pattern is 0, at each time all sufficiently high rows of the Gelfand-Tsetlin pattern will yield the same partition, and the projection of the dynamics to this partition is Markovian and yields the n = ∞ case of (1.2). For a precise formulation of this statement in terms of the boundary of a branching graph, see [VP21a, Appendix A].…”
Section: Why This Difference?mentioning
confidence: 99%
“…However, the n = ∞ case of (1.2), which corresponds to the full slowed t-TASEP, can interpreted as the projection of Hall-Littlewood process dynamics to a row 'at infinity'. A fuller account is given in [VP21a], but the basic idea is that with the initial condition where every entry of the Gelfand-Tsetlin pattern is 0, at each time all sufficiently high rows of the Gelfand-Tsetlin pattern will yield the same partition, and the projection of the dynamics to this partition is Markovian and yields the n = ∞ case of (1.2). For a precise formulation of this statement in terms of the boundary of a branching graph, see [VP21a, Appendix A].…”
Section: Why This Difference?mentioning
confidence: 99%