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

Random polymers via orthogonal Whittaker and symplectic Schur functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
3
1
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 3 publications
(5 reference statements)
0
6
0
Order By: Relevance
“…This process can be represented by Figure 1 where the interaction → is now reflection and the interaction is now a weighted indicator function. The zero-temperature limit of the field of log partition functions is the field of point-to-line last passage percolation times {G(i, j) : i + j ≤ n + 1} (see [6,7]) and it is natural to expect that {G(i, j) : i + j ≤ n + 1} is the invariant measure of {X ij : i+j ≤ n+1}. However, we do not prove this because the discontinuities in the drifts means that the conditions for Lemma 14 are no longer satisfied.…”
Section: Zero-temperature Limitsmentioning
confidence: 99%
See 1 more Smart Citation
“…This process can be represented by Figure 1 where the interaction → is now reflection and the interaction is now a weighted indicator function. The zero-temperature limit of the field of log partition functions is the field of point-to-line last passage percolation times {G(i, j) : i + j ≤ n + 1} (see [6,7]) and it is natural to expect that {G(i, j) : i + j ≤ n + 1} is the invariant measure of {X ij : i+j ≤ n+1}. However, we do not prove this because the discontinuities in the drifts means that the conditions for Lemma 14 are no longer satisfied.…”
Section: Zero-temperature Limitsmentioning
confidence: 99%
“…where {W (β) ij : i + j ≤ n + 1} are random variables with inverse gamma distributions and rates β −1 (α i + β j ). As β → ∞, the left hand side converges almost surely by Laplace's Theorem and the right hand side converges by [6,7] to give, sup 0=s0≤...≤sn<∞…”
Section: Zero-temperature Limitsmentioning
confidence: 99%
“…Furthermore, such a piecewise linear description is naturally prone to be extended to generic Young-diagram-shaped input arrays (not necessarily rectangular). The latter aspect was useful to study last passage percolation models with point-to-line and point-to-half-line path geometries and/or various symmetries on the input weights: this lead to new exact formulas for such models in terms of all the irreducible characters of the classical groups, in particular symplectic and orthogonal Schur polynomials [Bis18;BZ19b;BZ19c]. The Burge correspondence is, in the classical combinatorial description, a variant of the RSK mapping that bijectively transforms a non-negative integer matrix into a pair of semistandard Young tableaux of the same shape, through a column insertion algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…(2.5) † Notice that (1.11) and (1.12) have now been obtained directly via the standard Robinson-Schensted-Knuth correspondence, avoiding the route of the zero temperature limit, see [Bis18,BZ19b].…”
Section: From Determinants To Fredholm Determinantsmentioning
confidence: 99%