Tilted biorthogonal ensembles, Grothendieck random partitions, and determinantal tests

We study probability measures on partitions based on symmetric Grothendieck polynomials. These deformations of Schur polynomials introduced in the K-theory of Grassmannians share many common properties. Our Grothendieck measures are analogs of the Schur measures on partitions introduced by Okounkov (arXiv:math/9907127 [math.RT]). Despite the similarity of determinantal formulas for the probability weights of Schur and Grothendieck measures, we demonstrate that Grothendieck measures are \emph{not} determinantal point processes. This question is related to the principal minor assignment problem in algebraic geometry, and we employ a determinantal test first obtained by Nanson in 1897 for the $4\times4$ problem. We also propose a procedure for getting Nanson-like determinantal tests for matrices of any size $n\ge4$ which appear new for $n\ge 5$. By placing the Grothendieck measures into a new framework of tilted biorthogonal ensembles generalizing a rich class of determinantal processes introduced by Borodin (arXiv:math/9804027 [math.CA]), we identify Grothendieck random partitions as a cross-section of a Schur process, a determinantal process in two dimensions. This identification expresses the correlation functions of Grothendieck measures through sums of Fredholm determinants, which are not immediately suitable for asymptotic analysis. A more direct approach allows us to obtain a limit shape result for the Grothendieck random partitions. The limit shape curve is not particularly explicit as it arises as a cross-section of the limit shape surface for the Schur process. The gradient of this surface is expressed through the argument of a complex root of a cubic equation.

One of the earliest studied ensembles of random partitions based on symmetric functions is the Schur measure introduced in [Oko01].The Schur measure probability weights have the form 1≤i<j≤N (y i − y j ) s λ (y 1 ,...,y N ) . (1.1) Here λ = (λ 1 ≥ . . .≥ λ N ≥ 0) are integer partitions which we think of as our random objects, x i , y j ≥ 0 with x i y j < 1 are parameters of the measure.The quantities s λ (x 1 , . . ., x N ) and s λ (y 1 , . . ., y N ) in (1.1) are the well-known Schur symmetric polynomials in the variables x 1 , . . ., x N and y 1 , . . ., y N , respectively, indexed by the same partition λ.The probability normalizing constant Z = N i,j=1 (1−x i y j ) −1 has a product form thanks to the Cauchy summation identity for Schur polynomials.
The Schur measures are particularly tractable thanks to their determinantal structure, which allows expressing correlation functions ρ(a 1 , . . ., a m ) := Prob (the random set {λ i + N − i} ⊂ Z ≥0 contains each a 1 , . . ., a m ) (1.2) of an arbitrary order m as m × m determinants det[K(a i , a j )] m i,j=1 of a fixed correlation kernel K(a, b), where a, b ∈ Z ≥0 .The kernel has a double contour integral form, readily amenable to asymptotic analysis by steepest descent.
While these more general symmetric polynomials and rational functions share many properties with the Schur polynomials, the technique of determinantal point processes does not straightforwardly extend.This has led to several interesting alternative approaches, including eigenoperators [BC14] and duality [BCS14], which brought multiple contour integral formulas for expectations of observables.Recently [IMS21] presented a direct mapping between q-Whittaker and cylindric Schur measures [Bor07] preserving specific observables.Since the latter measures are determinantal, this allows for employing determinantal process methods for the asymptotic analysis of these observables.

Grothendieck measures on partitions
Our primary focus is on Grothendieck measures on partitions whose probability weights are expressed through the Grothendieck symmetric polynomials: 1≤i<j≤n (y i − y j ) G λ (y 1 ,...,y N ) .
(1.3)Here x i , y j , and β are parameters such that x i , y j ≥ 0, x i y j < 1, and β ≤ min 1≤i≤N (x −1 i , y i ).The latter condition implies that the probability weights are nonnegative.The Grothendieck symmetric polynomials G λ (x 1 , . . ., x N ) and G λ (y 1 , . . ., y N ) are one-parameter deformations of the Schur polynomials appearing in the K-theory of Grassmannians.The normalizing constant is Z ′ = N i=1 (1 − x i β) N −1 N i,j=1 (1 − x i y j ) −1 .When β = 0, the Grothendieck measure (1.3) reduces to the Schur measure (1.1).We refer to [LS82], [Buc02], [FK94], [Yel17], [CP21], and [HJK + 21] for details, properties, and various multiparameter generalizations of Grothendieck polynomials.All methods of the present paper apply in a setting when there are multiple β j 's (see the polynomials G λ and G λ in (3.3) in the text).However, in the Introduction and asymptotic analysis, we restrict to the case of the homogeneous β j 's.
In this paper, we obtain two main results for the Grothendieck measures: • We show that despite the determinant representation of their probability weights, Grothendieck measures do not possess a determinantal structure of correlations.This observation may appear unexpected given the similarity of Grothendieck probability weights compared to the Schur measures.
• We establish a link between Grothendieck random partitions and Schur processes, the latter being determinantal point processes on a two-dimensional lattice.We perform this connection within an extended framework of tilted biorthogonal ensembles, which we introduce.This connection provides an essential structure for the Grothendieck measures.It enables us to derive formulas expressing their correlations through sums of Fredholm determinants and prove limit shape results.
We formulate these results in the remainder of the Introduction.
Remark 1.1.It was observed in [Bor17,Sections 8.3 and 8.4] that the q = 0 specialization of spin Hall-Littlewood polynomials produces determinantal partition functions of vertex models which resemble the Grothendieck polynomials G λ in (1.3).Most of the machinery for computing expectations of observables of the form q height breaks down for q = 0, so it is not immediately clear whether vertex models are applicable in the analysis of Grothendieck measures.Moreover, limit shape results are not yet established for random partitions with spin Hall-Littlewood weights or their q = 0 degenerations (see, however, [Ahn20] for limit shapes of Macdonald random partitions in another regime, as q, t → 1).

Absence of determinantal structure
Theorem 1.2.For certain fixed N and values of parameters x i , y j , and β, the correlations (1.2) of the Grothendieck measures do not possess a determinantal form.That is, there does not exist a function K : Z 2 ≥0 → C for which ρ(a 1 , . . ., a m ) = det[K(a i , a j )] m i,j=1 for all m and all pairwise distinct a 1 , . . ., a m ∈ Z ≥0 .
We show the nonexistence of a correlation kernel K by constructing an explicit polynomial in the correlation functions ρ(a 1 , . . ., a m ), which vanishes identically if the correlation functions have a determinantal form (we call such polynomials determinantal tests).We then show that for a specific choice of parameters, N = 2, x i = y j = 1/2, β = −1, the determinantal test does not vanish.While for Theorem 1.2, we only need a specific choice of parameters, we expect the absence of determinantal structure to hold for generic parameters in the Grothendieck measures.
The problem of finding a kernel representing all correlations ρ(a 1 , . . ., a m ) in a determinantal form is the same as the well-known principal minor assignment problem in algebraic geometry.This problem seeks an n × n matrix whose all principal (diagonal) minors are given, but such an underlying matrix does not exist for all choices of (prospective) principal minors.Therefore, one has to find relations between principal minors.These relations are polynomial, and each may be used as a determinantal test.The variety of n × n principal minors becomes complicated already for n = 4 (it is minimally generated by 65 polynomials of degree 12), but for Theorem 1.2, it suffices to show that one generating polynomial does not vanish.In fact, the determinantal test we employ in our proof was written down by Nanson in 1897 for 4 × 4 matrices [Nan97].In Section 4.2, we discuss the rich history of the principal minor assignment problem and several instances of its rediscovery within the study of determinantal point processes.In Sections 4.3 and 4.4, we present a self-contained derivation of the Nanson's determinantal test and suggest a generalization of the Nanson's test to matrices of arbitrary size.This generalization appears new.

Tilted biorthogonal ensembles
To connect Grothendieck measures to Schur processes, which are determinantal processes on the two-dimensional integer lattice, we consider a more general framework of tilted biorthogonal ensembles, which is inspired by a talk of Kenyon [Ken20].The ordinary biorthogonal ensembles introduced in [Bor98] are measures on partitions with probability weights of the form where Φ i , Ψ j are given functions, and Z is the normalizing constant.Biorthogonal ensembles are determinantal processes on Z ≥0 in the same sense as the Schur measures.Moreover, when Φ i (k) = x k i , Ψ j (k) = y k j , the weights (1.4) coincide with (1.1).We "tilt" the biorthogonal ensemble (1.4) by inserting j-dependent difference operators into the determinants.1When Φ i (k) = x k i , Ψ j (k) = y k j , the action of these operators results in the factors (1 − βx i ) j−1 and (1 − βy −1 i ) N −j in (1.3).In general, we apply the operator (D) j−1 to Φ i (ℓ j ), where Here and throughout the paper, 1 A stands for the indicator of an event or a condition A. We arrive at the following measure on partitions: For details, we refer to Section 2.1 in the text.
The action of D is the same as the multiplication by the matrix T β (k, l) := 1 l=k − β 1 l=k−1 , and D † is the multiplication by T β on the opposite side.Using this, we identify (Theorem 2.3) the joint distribution of (ℓ 1 > . . .> ℓ N ) under the tilted biorthogonal ensemble with that of the points (x 1 1 > . . .> x N N ) in the two-dimensional ensemble {x m j : 1 ≤ m, j ≤ N } which has probability weights proportional to The two-dimensional process has probability weights given by products of determinants.Thus, it is determinantal thanks to the well-known Eynard-Mehta theorem [EM98], [BR05], see also [Bor11a,Theorem 4.2].
The above identification allows us to write down certain Fredholm determinantal formulas for marginal distributions and correlation functions of tilted biorthogonal ensembles; see Section 2.5 and Proposition 2.7 in particular.
When Φ i (k) = x k i and Ψ j (k) = y k j for all i, j, the two-dimensional determinantal process (1.6) becomes the Schur process whose correlation kernel has a double contour integral form [OR03].The particular specializations of the Schur process parameters are given in Section 3.3 in the text.Our Schur process has nonnegative probability weights only for β < 0, and this is the case we restrict to in our asymptotic analysis (see Section 1.5 below).The case β = 0 is covered by standard results on Schur measures.It is plausible that our results on the Grothendieck limit shape still apply to values of β > 0, even if probabilities in the twodimensional process are negative, as long as the Grothendieck probability weights (1.3) remain nonnegative.See Conjecture 5.10 for details.
Remark 1.3 (Application to the five-vertex model).In [Ken20], Kenyon expressed certain distributions arising in the five-vertex model (see also [dGKW21]) as tilted biorthogonal ensembles.It would be very interesting to apply our results to the asymptotic analysis of the five-vertex model, but there are three clear obstacles.First, the two-dimensional process for the five-vertex model is not the Schur process but rather a multiparameter analog of the more complicated model of lozenge tilings of the hexagon (see, e.g., [Gor08], [Pet14] for the determinantal structure of the original tilings of the hexagon).One does not have as elegant expressions for the correlation kernel in the case of multiple parameters.Second, the probability weights in the two-dimensional process are complex-valued.This makes probabilistic identification of limit shapes problematic; see also the discussion in Section 5.4.4 below.Third, for the five-vertex model, the multiple parameters x i , y j are solutions to the Bethe equations.This makes a potential asymptotic analysis even more intricate (see, however, [Pri03] and [BL17] for a related analysis of TASEP on the ring).

Limit shape
Consider Grothendieck random partitions (1.3) with homogeneous parameters x i ≡ x > 0, y j ≡ y > 0, such that xy < 1 and β < 0. Let us draw Young diagrams of our Grothendieck random partitions in the (u, v) coordinate system rotated by 45 • , see Figure 1, left.Each partition is encoded by a piecewise linear function v = W N (u) with derivatives ±1 and integer maxima and minima.Since our partitions have at most N parts, we almost surely have Theorem 1.4.Fix the parameters x, y, β as above.There exists a continuous, piecewise differentiable, 1-Lipschitz function where the convergence is pointwise in probability.See Figure 1, right, for an illustration.
Figure 1: Left: The Young diagram for λ = (6, 6, 5, 3, 1, 1) in the coordinate system rotated by 45 • .The diagonal line v = u + 2N represents the upper boundary of the shape of λ.Right: An example of a limit shape W(u) of the Grothendieck random partition for x = 1/3, y = 1/5, and β = −25.We added a horizontal line to highlight the staircase frozen facet where the limit shape W(u) is horizontal.An exact sample of a random partition corresponding to the limit shape on the right is given in Figure 9, right (see also Section 5.5 for a discussion of how to sample Grothendieck random partitions).
The first limit shape result for random partitions (with Plancherel measure, which is a particular case of Schur measures) was obtained by Logan-Shepp [LS77] and Vershik-Kerov [VK77].We do not have an analytic formula for our shapes W(u) in contrast to this classical VKLS shape.Let us briefly describe how W(u) is related to the limit surface of the Schur process.We used this connection to numerically plot all our examples; see Section 5.4 for details and more discussion.
Let {x m j : 1 ≤ m, j ≤ N } be distributed according to the Schur process as in (1.6).Define the height function H N (a, t) := #{j : x t j ≥ a}, where (a, t) ∈ Z ≥0 × {1, . . ., N }.Using the standard steepest descent analysis of the correlation kernel of the Schur process (dating back to [OR03], see also [Oko02, Section 3]), one can show that H N has a limit shape H(ξ, τ ) = lim The gradient of H is expressed through arguments of the complex root z c = z c (ξ, τ ) of a certain cubic equation depending on (ξ, τ ) and our parameters (x, y, β), see (5.7) and (5.9) for the formulas.
The identification between Grothendieck random partitions and the slice (x 1 1 > . . .> x N N ) of the Schur process (see Section 1.4 above) helps to express the Grothendieck limit shape W(u) through H(ξ, τ ).Namely, let L(τ ) be an auxiliary function defined from the implicit equation In other words, the three-dimensional parametric curve (L(τ ), τ, τ ) is the cross-section of the Schur process limit shape surface η = H(ξ, τ ) in the (ξ, τ, η) coordinates by the plane η = τ .From the Schur process limit shape result, we have Then the Grothendieck limit shape curve (u, W(u)) as in Figure 1, right, has the following parametrization through L(τ ): The functions L(τ ) and W(u) satisfy differential equations involving the root z c (ξ, τ ), see (5.17)-(5.18).However, the implicit equation (1.7) turns out to be more convenient for plotting the shapes.
The flat, "frozen", facets of the Schur limit shape surface (where the gradient is at a vertex of its allowed triangle, see (5.5)) lead to the three possible flat facets of W(u), where W ′ (u) is equal to −1, 0, or 1, respectively.The derivatives ±1 occur when W(u) = |u| outside of the curved part of the limit shape.The facet W ′ (u) = 0 always arises for sufficiently negative β (Lemma 5.6).In this facet, the random partition develops the deterministic frozen staircase behavior, that is, λ i = λ i+1 + 1 for all i in some interval of order N .See the horizontal part of the limit shape in Figure 1, right.
Besides limit shapes, the study of random partitions often involves fluctuations in various regimes (at the edge, in the bulk, and global Gaussian fluctuations).It would be interesting to obtain fluctuation results for Grothendieck random partitions in these regimes and compare them to the classical case of the Plancherel random partitions [BDJ99], [Joh01], [BOO00], [IO02].The tilted nature of the cross-section leading to Grothendieck measures seems to be affecting all Grothendieck fluctuations except the edge ones.Indeed, for any fixed k, (λ 1 , . . ., λ k ) have the same joint distribution as (µ 1 1 , . . ., µ k k ), where the partitions µ 1 , . . ., µ k for a Schur process.Moreover, we have |µ j j − µ 1 j | ≤ j for all j (see Section 5.3.3 for details).Therefore, we expect that the joint distribution of (λ j − cN )/(σN 1/3 ), j = 1, . . ., k, should converge to the Airy 2 point process, just like for the Plancherel measure.We also expect that the bulk fluctuations are not given by the same discrete sine process as in the Plancherel case.It would be interesting to compute the correlations of the Gaussian limit, and compare them to the Plancherel case.

Outline
In Section 2, we introduce the framework of tilted biorthogonal ensembles and show that they are cross-sections of two-dimensional determinantal processes.The correlation kernel of the latter is given by the Eynard-Mehta theorem.In Section 3, we specialize tilted biorthogonal ensembles to Grothendieck measures on partitions and write down the correlation kernel of the corresponding two-dimensional Schur process in a double contour integral form (specializing the results of [OR03]).In Section 4, we prove Theorem 1.2 that Grothendieck measures are not determinantal point processes.Section 4.2 provides a brief historical account of the relation between the determinantal structure of probability measures and the principal minor assignment problem.Finally, in Section 5, we establish limit shape results for Schur processes and Grothendieck random partitions and illustrate these results by several plots and exact sampling simulations.

Acknowledgments
We are grateful to Richard Kenyon, Grigori Olshanski, Bernd Sturmfels, Alexander Povolotsky, and Damir Yeliussizov for helpful discussions at various stages of the project.LP is grateful to Promit Ghosal for bringing attention to Grothendieck measures in 2018.We appreciate the comments from the anonymous reviewer, which have led to the discussion of sampling of Grothendieck random partitions in Section 5.5.

Tilted biorthogonal ensembles
In this section, we present the main framework for measures on particle configurations in Z ≥0 given by a certain product of determinants, and discuss their characteristics.

Definition of the ensemble
Fix N , and let Φ k , Ψ k , k = 1, . . ., N , be arbitrary complex-valued functions on Z ≥0 .Fix additional complex parameters β 1 , β 2 , . . ., β N −1 .Let us define the following operators acting on finitely supported functions on Z ≥0 : is the identity operator.Assign the following weights to N -point configurations on Z ≥0 : where X = (ℓ 1 > ℓ 2 > . . .> ℓ N ≥ 0).If the number of points in X is not N , then set W ⃗ β (X) = 0. Assume that the series for the partition function for the weights (2.3), converges and is nonzero.
Definition 2.1.The normalized weights define a probability measure on N -particle configurations on Z ≥0 .We call this measure the ⃗ β-tilted N -point biorthogonal ensemble.
The term "probability measure" here refers to the fact that the sum of the normalized weights is equal to 1.The weights are generally complex-valued but become nonnegative real numbers in the specializations we discuss later.
When β j ≡ 0, the operators (2.1) become identity operators, and the tilted biorthogonal ensemble turns into the usual biorthogonal ensemble with probability weights proportional to (2.5) Biorthogonal ensembles were introduced and studied in [Bor98], see also [Bor11a, Section 4] for a summary of formulas.

Normalization
Let us compute the normalizing constant Z ⃗ β : Proposition 2.2.We have where (2.7) Proof.Observe that for any 0 ≤ a ≤ b, we have the following summation by parts: We have where we moved each of the operators D to the other function and observed that the presence of the determinants eliminates the boundary terms arising from (2.8).Writing , we can use the Cauchy-Binet summation to replace the sum of products of two determinants over ℓ 1 > ℓ 2 > . . .> ℓ N ≥ 0 by the determinant of single sums.

Two-dimensional process
We will show in Section 4 below that a ⃗ β-tilted N -point biorthogonal ensemble on Z ≥0 is not necessarily a determinantal point process, even though its probability weights are products of determinants.
On the other hand, each ⃗ β-tilted biorthogonal ensemble can be embedded into a twodimensional determinantal point process on X := Z ≥0 × {1, . . ., N }.A similar construction for TASEP first appeared in [BFPS07] (and was later exploited to construct the KPZ fixed point [MQR21]).The embedding which we describe below in this subsection is suggested in the talk by Kenyon [Ken20].This process lives on particle configurations X 2d = {x m j : 1 ≤ m, j ≤ N } satisfying One readily sees that (2.10) Using the given notation, assign (possibly complex) weights to configurations X 2d : In the proof of the next statement and throughout the rest of the section, we use the notation " * " for discrete convolution of functions on Z ≥0 , and assume that all series thus arising converge absolutely.For example, we write (f * h)(x) = ∞ y=0 f (x, y)h(y) for functions f (x, y) and h(x).See also [Bor11a,Section 4] for further examples of this notation.
Theorem 2.3.The normalizing constant of the two-dimensional distribution For complex-valued probabilities, the coincidence of marginal distributions means that for any finitely supported function f in N variables, we have (2.12) Proof of Theorem 2.3.By the Cauchy-Binet summation, we have Next, for any function h(y) on Z ≥0 we have (h y h(y).By (2.7), this implies the first claim about the normalizing constant.
The second claim essentially follows from the LGV (Lindstrom-Gessel-Viennot) lemma, which expresses the partition function of nonintersecting path collections in a determinantal form [Lin73], [GV85].By the first claim, it suffices to prove (2.12) for unnormalized weights 3) are multilinear in (Φ 1 , . . ., Φ N ; Ψ 1 , . . ., Ψ N ), so it suffices to prove the summation identity in the case of delta functions where is the same as the distribution of the nonintersecting path ensemble on the graph shown in Figure 2, where the paths connect k 1 , . . ., k N to k ′ 1 , . . ., k ′ N .Then the marginal distribution of ℓ 1 , . . ., ℓ N can be expressed through the product of two determinants: One for the nonintersecting paths connecting k 1 , . . ., k N to ℓ 1 , . . ., ℓ N , and the other one for the nonintersecting paths from ℓ 1 , . . ., ℓ N to k ′ 1 , . . ., k ′ N .These determinants are immediately identified with the two determinants in (2.3), and so we are done.
The directed graph with vertices Z ≥0 × {1, . . ., N } and edges which can be vertical (with weight 1) or diagonal (with weight −β m , m = 1, . . ., N ).We consider an ensemble of The particles x m j encode the intersections of the paths with the m-th horizontal line, m = 1, . . ., N .

Determinantal kernel
The two-dimensional ensemble X 2d defined in Section 2.3 is a determinantal point process.This means that for any p ≥ 1 and pairwise distinct points (y i , t i ) ∈ Z ≥0 × {1, . . ., N }, i = 1, . . ., p, we have Here K 2d ⃗ β (x, t; y, s) is a function called the correlation kernel.Both the determinantal structure and an expression for the correlation kernel follow from the well-known Eynard-Mehta theorem [EM98], [BR05], see also [Bor11a, Theorem 4.2].
Proposition 2.4.The correlation kernel (2.13) for the point process X 2d has the form Proof.By [Bor11a, Theorem 4.2], the correlation kernel has the form As in the proof of Theorem 2.3, we can rewrite the convolutions with the T β 's as applications of the difference operators (2.1): This completes the proof.
Note that the variables t, s ∈ {1, . . ., N } in the correlation kernel (2.14) correspond to the vertical coordinates in Figure 2 which increases from top to bottom.We use this convention throughout the rest of the paper.
Remark 2.5.From the fact that x j j = ℓ j , j = 1, . . ., N , as joint distributions (where the x j j 's come from M 2d ⃗ β and the ℓ j 's come from M ⃗ β ), one may think that the probabilities M ⃗ β are expressed through the correlation kernel (2.15)However, identity (2.15) is generally false when ℓ i+1 = ℓ i + 1 for some i.Indeed, this is because the correlation event in the right-hand side of (2.15) includes more configurations of nonintersecting paths (as in Figure 2) than just the ones with x j j = ℓ j for all j = 1, . . ., N .One can check that if ℓ j − ℓ j+1 ≥ 2 for all j = 1, . . ., N , then identity (2.15) holds.

Marginals and correlations of the tilted biorthogonal ensemble
Fix k ≥ 1 and be a fixed integer vector, and also let

4). Using Theorem 2.3 and Proposition 2.4, we can express the probability M
in a polynomial way.We use the following statement adapted to our space X = Z ≥0 × {1, . . ., N }: Lemma 2.6 ([Sos00, Theorem 2]).Fix a finite number of disjoint subsets of X and denote them by B 1 , . . ., B p .Let B = B 1 ∪ . . .∪ B p .For a determinantal point process on X with kernel K, let # B i be the random number of points of the process which belong to B i .Then we have the following identity of generating functions in z 1 , . . ., z p : where 1 is the identity operator, in the right-hand side there is a Fredholm determinant, and χ B , χ B i are the indicator functions of these subsets.
In our applications, the sets B i will be finite, and thus the Fredholm determinants in (2.16) are simply finite-dimensional determinants of the corresponding block matrices.In general, the right-hand side of (2.16) is an infinite series, see, for example, [Sos00, Remark 3].
To illustrate the general formula of Proposition 2.7 below, let us first look at the case k = 1.For fixed a and i, the event Indeed, for ℓ i = x i i = a, we need to have exactly N − i points of the configuration X 2d to the left of a, and exactly one point at a. Thus, we can write by Lemma 2.6: where [z N −i w] is the operator of taking the coefficient of a polynomial by z N −i w.The matrix in the right-hand side (2.18) has dimensions (a + 1) × (a + 1) and looks as , where we abbreviated K(x; y) = K 2d ⃗ β (x, i; y, i).Finally, to get the correlation function, we simply have to sum (2.18) over all i = 1, . . ., N : (2.19) Notice that this is a polynomial in the entries K 2d ⃗ β (x, t; y, s) of the correlation kernel (2.14).The next statement for general k follows from an argument for several points which is analogous to the above computations: Proposition 2.7.For arbitrary k ≥ 1 and I = {i 1 < . . .< i k }, the marginal distribution of X I under M ⃗ β has the form (2.20) Here the square matrix has dimensions k p=1 (a ip + 1), the union of all the sets is denoted by , and the determinant is a polynomial in the entries of the correlation kernel K 2d ⃗ β .The correlation functions of M ⃗ β are finite sums of determinants of the form (2.20).Namely, for any k and any pairwise distinct a 1 , . . ., a k ∈ Z ≥0 , we have

Grothendieck random partitions
Here, we specialize the setup of ⃗ β-tilted biorthogonal ensembles developed in Section 2 to Grothendieck random partitions.A crucial feature in this special case is that the corresponding two-dimensional ensemble X 2d becomes the well-known Schur process introduced in [OR03].
Let us denote 1≤i<j≤N (y i − y j ) .
(3.3) Since λ j + N − j ≥ N − j and in the matrix elements in G λ there are N − j factors of the form (1 − β r y −1 i ), we see that both G λ and G λ are symmetric polynomials in N variables.We thus see that the ⃗ β-tilted biorthogonal ensemble with the specialization (3.1) has the form We call (3.4) the (multiparameter) Grothendieck measure on partitions.This distribution is analogous to the Schur measure introduced in [Oko01] which is a particular case of M ⃗ β;Gr for β r ≡ 0.
Note that the probability weights (3.4) may be complex-valued.In Section 3.2 below we discuss conditions on the parameters x i , y j , β r which make the weights nonnegative real.

Grothendieck polynomials and positivity
Here, we comment on the relations between the polynomials G λ , G λ and Grothendieck polynomials appearing in the literature.We also discuss the nonnegativity of the measure M ⃗ β;Gr (3.4) on partitions.
The sum to one property of the Grothendieck measure M ⃗ β;Gr (3.4) is equivalent to the following Cauchy-type summation identity for the polynomials (3.3): It is instructive to compare this identity to Cauchy identities for Grothendieck symmetric functions, for example, see [Yel17,(36)] or [HJK + 21, Corollary 3.6].The latter identities involve sums of products in the form G λ g λ , where g λ are the dual Grothendieck symmetric functions.The products in the right-hand side of these summation identities have the form , and a possible analogue in our case would be ∞ i,j=1 1−x i β j 1−x i y j .However, in this paper, we will not explore a symmetric function extension of the identity (3.7).
Let us now discuss the nonnegativity of the probability weights M ⃗ β;Gr (3.4).Using the tableau formula for G λ (for example, [HJK + 21, Corollary 4.5]) and the relation (3.6) between G λ and G λ , we see that the probability weights M ⃗ β;Gr (λ) are nonnegative for all λ when the parameters satisfy Indeed, under (3.8) we have nonnegativity (and even Schur-nonnegativity, cf.[HJK + 21, Theorem 4.3]) of G λ and G λ , as well as the convergence of the series (3.7).Furthermore, we can extend the nonnegativity range of the Grothendieck measures to certain positive values of β r : Proposition 3.1.Let x i , y j ≥ 0 and β r ≤ x −1 i , β r ≤ y j for all i, j, r.Then the Grothendieck polynomials G λ (x 1 , . . ., x N ) and G λ (y 1 , . . ., y N ) defined by (3.3) are nonnegative.
Proof.We consider only the case G λ , as G λ is completely analogous.For a nonnegative function f on Z ≥0 we have under our conditions: Therefore, replacing β r by x −1 r in the application of D k can only decrease the result.The Grothendieck polynomial G λ (x 1 , . . ., x N ) is obtained by applying the operators D (r) k to the Schur polynomial s λ (x 1 , . . ., x N ): for all r .On the other hand, when β r = x −1 r for all r, the matrix in the numerator in G λ (3.3) becomes triangular, and we have det x Cancelling the product over i, j with the denominator in G λ , we see that after the substitution, the resulting expression G λ (x 1 , . . ., x N ) βr=x −1 r for all r is clearly nonnegative.This completes the proof.Proposition 3.1 implies that the Grothendieck probability weights M ⃗ β;Gr (λ) are nonnegative for all λ when the parameters satisfy the extended conditions 3.3 Two-dimensional Schur process and its correlation kernel By Theorem 2.3, the Grothendieck measure is embedded into the two-dimensional ensemble X 2d (2.9).Our specialization (3.1) implies that X 2d is distributed as the Schur process.Schur processes are a vast family of determinantal point processes on the two-dimensional lattice introduced and studied in [OR03].
Assume that the parameters satisfy (3.8), and define µ m i := x m i + i − N , i, m = 1, . . ., N , where the particles x m i come from the two-dimensional ensemble X 2d .Clearly, each µ m = (µ m 1 ≥ . . .≥ µ m N ≥ 0) is a partition with at most N parts.From (2.10)-(2.11)we conclude that the probability weight of the tuple of partitions (µ 1 , . . ., µ N ) is Here (µ m ) ′ /(µ m+1 ) ′ denote skew transposed partitions, and we used a basic property of skew Schur functions evaluated at a single variable (for example, see [Mac95, Chapter I.5]): From Theorem 2.3 we immediately get: Proposition 3.2.The Grothendieck measure M ⃗ β;Gr (λ) (3.4) is embedded into the Schur process (3.10) in the sense that the joint distributions of the integer N -tuples {λ i } i=1,...,N and {µ i i } i=1,...,N coincide.Remark 3.3.While the Schur process (3.10) is not a nonnegative measure for β r > 0, the Grothendieck measures (3.4) are still nonnegative probability measures under the more relaxed conditions (3.9).Consequently, we will primarily focus on the case when the parameters satisfy the more restrictive conditions (3.8).However, below in Section 5.4 we will also consider the question of limit shapes for Grothendieck measures with positive β r 's (which do not correspond to nonnegative Schur processes).
As shown in [OR03], the correlation kernel of the Schur process (3.10) has a double contour integral form.The alternative proof of this result given in [BR05, Theorem 2.2] proceeds from the general kernel K 2d ⃗ β (2.14) and involves an explicit inverse matrix G −1 ( ⃗ β) which is available thanks to the Cauchy determinant.Let us record this double contour integral kernel: Proposition 3.4.The correlation kernel for the Schur process X 2d = {x m i : 1 ≤ m, i ≤ N } containing the Grothendieck measure M ⃗ β;Gr (3.4) has the form where a, b ∈ Z ≥0 , t, s ∈ {1, . . ., N }, and the integration contours in (3.11) are positively oriented simple closed curves around 0 satisfying the following conditions: (1) |z| > |w| for t ≤ s and |z| < |w| for t > s; (2) On the contours it must be that |β r | < |z| < x −1 i and |w| > y i for all i and r.
The integration contours in Proposition 3.4 exist only under certain conditions on the parameters x i , y j , and β r , for example, it must be that |β r | < x −1 i for all i, r.When these conditions on the parameters are violated, we should deform the integration contours to take the same residues.In other words, we can analytically continue the kernel by declaring that the double contour integral in (3.11) is always equal to the sum of the same residues: first take the sum of the residues in w at 0, all y i 's, and at z if t > s; then take the sum of the residues of the resulting expression in z at 0 and all β r 's.Proof of Proposition 3.4.It is well-known that determinantal correlation kernels for the Schur measures and processes have double contour integral form, see [Oko01], [OR03].Namely, the generating function for the Schur process kernel has the form a,b∈Z where Φ(t, z) are is a function which is read off from the specializations in the Schur process, and the generating series in (3.13) is expanded differently depending on whether t ≤ s or t > s.This difference in expansion is that we assume either |z| > |w| or |z| < |w|, which can be ultimately traced back to the normal ordering of the fermionic operators ψ(z), ψ * (w) in the notation of [OR03, Section 2.3.4].Formula (3.13) is the same as [OR03, Theorem 1], up to switching from half-integers to integers in the indices a, b.
Let us remark that it is not immediate how to adapt the generating function (3.13) to a particular specialization of the Schur process (that is, how to select the integration contours to pick out the correct coefficients).In general, one could use the contour integrals from [Joh00] (see also [BG16, Remark 2 after Theorem 5.3]) or [BR05, Theorem 2.2], but here for convenience let us briefly record a "user's manual" for such an adaptation.There are three principles: • First, start with the Schur measures (t = s).By [Oko01, Theorem 2], the contours must satisfy |z| > |w| for t = s.
• Second, on the integration contours for all t, s, all denominators in the integrand should expand as geometric series in a natural way as • The first two principles allow to select the integration contours for t = s, and it only remains to determine their ordering (|z| > |w| or |z| < |w|) for t ̸ = s.This is done by inspecting how the specializations of the Schur measures at t = s change with t.
Let us implement these principles for our Schur process (3.10).Its graphical representation is given in Figure 3.Each µ t distributed as the Schur measure with probability weights ∝ s µ t (x 1 , . . ., x N )s µ t (− βt , . . ., − βN−1 ; y 1 , . . ., y N ). (3.14) Here the notation − βi means that these are "dual" parameters, that is, they correspond to transpositions of the Young diagrams.Moreover, we unified a number of these "dual" parameters with the usual parameters y i in the second Schur function (see, e.g., [BG16, Section 2] for details).The weights (3.14) follows from the weights (3.10) and the skew Cauchy identity for Schur functions.Now, from (3.14) and [Oko01, Theorem 2], we see that the functions in the integrand for t = s are given by where is the single-variable Cauchy kernel for a specialization ρ of Schur functions.The second equality in (3.15) follows from the Cauchy identity, and is precisely the expression (3.12) for F t (z).Thus, using the first two principles above, we get all the conditions on the contours in our Proposition 3.4 for t = s.In particular, the second condition |β r | < |z| < x −1 i , |w| > y i follows from requiring the expansion of as geometric series.Observe that to get the integral (3.11), we also needed to shift the indices (a, b) by N − 1 2 compared to formulas in [Oko01], [OR03].Indeed, in these references the point configuration associated to a partition µ is µ i − i + 1 2 i∈Z ≥1 , while we work with {µ i + N − i} N i=1 .Extending our formula (3.11) to t ̸ = s in a natural way leaves only the question of the ordering of the integration contours (|z| > |w| or |z| < |w|) for t ̸ = s.This can be resolved by comparing (3.15) with [OR03,(20)].We see that H − βt,...,− βN−1 ;y 1 ,...,y N (z −1 ) should be matched to the product m<t ϕ + [m](z −1 ).In the latter product, increasing t will increase the number of factors, which is opposite to how the number of factors depends on t in (3.15).Thus, we must choose |z| > |w| for t ≤ s, which is opposite to [OR03, Theorem 1].This completes the proof.

Absence of determinantal structure
The Grothendieck measure M ⃗ β;Gr (3.4) has probability weights expressed as products of two determinants.This structure is very similar to that of biorthogonal ensembles (2.5), which are well-known determinantal point processes.However, this section shows that the Grothendieck measures are not determinantal point processes.This question is deeply linked to the principal minor assignment problem from linear algebra and algebraic geometry.We describe this problem in Section 4.1, and discuss its long history in Section 4.2.Then in Section 4.3, we present a self-contained derivation of a determinantal test for minors of a 4 × 4 matrix originally obtained by Nanson in 1897 [Nan97], and in Section 4.4 we extend this test to matrices of arbitrary size.Finally, in Section 4.5, we apply the original Nanson's test to show that the Grothendieck measures are not determinantal.

Principal minor assignment problem
Let A be an n×n complex matrix.To it, we associate 2 n principal minors , where I runs over all subsets of {1, . . ., n}, and |I| is the number of elements in I.This includes the empty minor A ∅ = 1.The map C n 2 → C 2 n , A → (A I ) I⊆{1,...,n} , is called the affine principal minor map.The (affine) principal minor assignment problem [HS02], [LS09] aims to characterize the image under this map in C 2 n .Denote this image by A n ⊂ C 2 n .This complex algebraic variety is closed and has dimension n 2 − n + 1 [Sto24], [LS09].
For n ≤ 3, the dimension of A n is equal to 2 n −1, (full available dimension because A ∅ = 1), but starting with n = 4, A n becomes very complicated.Indeed, by [LS09, Theorem 2], the prime ideal of the (13-dimensional) variety A 4 is minimally generated by 65 polynomials of degree 12 in the A I 's.
Let us translate the principal minor assignment problem into the language of point processes.Let M be a point process on Z ≥0 , that is, a probability measure on point configurations in Z ≥0 .This measure may have complex weights, but has to be normalized to have total probability mass 1, and has to be bounded in absolute value by a nonnegative probability measure on point configurations in Z ≥0 .The base space for the point process may be arbitrary and is not necessarily finite, and here we take Z ≥0 for an easier future application.For each finite subset I ⊂ Z ≥0 consider the correlation function ρ I = M (the random point configuration contains all points from I) .
It is natural to ask whether the point process M is determinantal, that is, whether there exists a kernel K(x, y), x, y ∈ Z ≥0 , such that for any finite I ⊂ Z ≥0 we have ρ I = det[K(a, b)] a,b∈I .A clear necessary condition for the process to be determinantal is as follows: Proposition 4.1.If the process M is determinantal, then for any n ≥ 1 and any n-point subset J ⊂ Z ≥0 , the vector (ρ I : I ⊆ J) ∈ C 2 n belongs to the image A n under the principal minor map.
Thus, if for some n and some n-point J ⊂ Z ≥0 the vector (ρ I : I ⊆ J) ∈ C 2 n does not belong to A n , then the process M is not determinantal.Due to the complicated nature of A n for n ≥ 4, checking that a vector belongs to A n is hard.However, to show that some vector (ρ I ) does not belong to A n , it suffices to find a polynomial in the ideal of A n that does not vanish on (ρ I ).This leads us to the following definition: Definition 4.2.Fix n ≥ 4. A determinantal test of order n is any element in the ideal of A n , that is, a polynomial in the indeterminates (A I : I ⊂ {1, . . ., n}) which vanishes if the A I 's are principal minors of some matrix A.
Thus, to show that the process M is not determinantal, it suffices to show that there exists J ⊂ Z ≥0 and a determinantal test which does not vanish on the vector (ρ I : I ⊂ J).Let us describe an example of such a test of order 4 which we call the Nanson's test as it first appeared in 1897 in [Nan97].First, we need another definition: Definition 4.3.Let A = (a ij ) be a complex n × n matrix, and fix I ⊆ {1, . . ., n} with |I| = k ≥ 2. For a k-cycle π ∈ S n with support I (there are (k − 1)! such cycles), define t π (A) := i : i̸ =π(i) a i,π(i) .Let the cycle-sum [LS09] be The cycle-sums are the same as cluster functions in the terminology of [TW98], and they can be expressed through the principal minors A I as follows: where the sum is taken over all set partitions of I into exactly m nonempty parts.For example, T {1,2,3} = a 12 a 23 a 31 + a 13 a 21 a 32 where we abbreviated T ij = T {i,j} , and so on.By (4.2), N 4 is also a polynomial in the indeterminates A I .
One readily verifies (for example, using computer algebra) that N 4 is indeed a determinantal test: Proposition 4.5.If for all I ⊆ {1, 2, 3, 4} we replace the indeterminates T I 's in (4.3) by the cycle-sums (4.1) coming from a 4 × 4 matrix A, then the polynomial N 4 (4.3)vanishes identically.
We apply Nanson's test N 4 to show that the Grothendieck measures are not determinantal in Section 4.5 below.

On the history of the principal minor assignment problem
Let us briefly discuss the rich history and variants of the principal minor assignment problem.Within this history, we can observe at least two instances where similar questions were independently formulated and addressed in the context of algebra (on the original principal minor assignment) and probability (concerning determinantal processes).We hope that these two research avenues will become increasingly aware of one another.
The problem itself dates to the late 19th century work of MacMahon [Mac94], with initial results due to Muir [Mui94] [Mui98] and Nanson [Nan97].In particular, Nanson has partially solved the 4 × 4 principal minor assignment problem, and obtained the determinantal test N 4 (4.3).He also obtained four other tests algebraically independent from N 4 (which enter the list of 65 polynomials in Lin-Sturmfels [LS09]).The question of relations on principal minors is investigated by Stouffer [Sto24], and in particular he showed that the dimension of A n is n 2 − n + 1.
Another question related to the principal minor assignment problem, when it has a solution, concerns the relationship between two n × n complex matrices A, B with the same principal minors.Under various natural conditions, it has been shown that the matrix A should be diagonally conjugate either to B, or to B transpose .Here "diagonally conjugate" means A = DBD −1 , where D is a nondegenerate diagonal matrix.This question was first addressed in the context of the principal minors assignment problem by Loewy [Loe86].More recently, Stevens [Ste21] and Mantelos [Man23] investigated essentially the same question within the context of determinantal processes, seemingly unaware of Loewy's work.
Griffin-Tsatsomeros [GT06] proposed algorithms for finding the solution of the principal minor assignment problem (that is, the matrix A), which are computationally fast for particular subclasses of matrices.While this does not yield explicit polynomial determinantal tests, an algorithm can be used to (numerically) demonstrate that a point process is not determinantal.In our application to Grothendieck measures in Section 4.5 below we do not use an algorithm like in [GT06], but rather perform a symbolic computation based on the Nanson's test N 4 .
A particularly well-understood case of the principal minor assignment problem assumes that the initial complex n × n matrix A is Hermitian symmetric.Holtz-Sturmfels [HS07] and Oeding [Oed11] use the additional hyperdeterminantal structure of the variety formed by principal minors to solve the assignment problem set-theoretically.More recently, Al Ahmadieh and Vinzant [AAV21], [AAV22] considered the principal minor assignment problem over other rings and explored connections to stable polynomials.These latter works represent the current state of the art of the principal minor assignment problem from an algebraic perspective.In particular, [AAV22, Theorem 8.1] is a strong and unexpected negative result.
Finally, let us mention that there are several natural generalizations of the principal minor assignment problem, as considered by Borodin-Rains [BR05, Section 4] and independently by Lin-Sturmfels [LS09] (unaware at the time of the work by Borodin-Rains).These variants allow more general conditional and/or Pfaffian structure of the correlation functions ρ I .A conditional determinantal process, by definition, has correlation functions ρ I = det [K(a, b)] a,b∈I∪S , where S = {n + 1, . . ., n + m}, and I ⊆ {1, . . ., n}.In other words, it is a usual determinantal process on {1, . . ., n, n + 1, . . ., n + m} conditioned to have particles at each of the points n + 1, . . ., n + m.In the terminology of [LS09], the conditional determinantal structure is the same as the projective principal minor assignment problem, a more natural setting for algebraic geometry.The projective variety analog of A n for n = 4 is more complicated, with 718 generating polynomials.The Pfaffian and conditional Pfaffian structures (considered in [BR05]; they are motivated, in particular, by real and quaternionic random matrix ensembles) are defined similarly to the determinantal ones, but with determinants replaced by Pfaffians.The n = 4 conditional Pfaffian (projective) variety analog of A n is even more complicated than the determinantal one, and experimentation suggests [BR05] that a corresponding test could have degree 1146.
It would be interesting to develop determinantal and Pfaffian tests for conditional processes (as well as for further generalizations involving, for example, α-determinants and permanents), but we leave these directions for future work.

A self-contained derivation of Nanson's determinantal test
Here we present a self-contained derivation of Nanson's determinantal test polynomial N 4 (4.3).This argument differs slightly from Nanson's original work [Nan97] and was obtained independently by the second author (unaware of the principal minor assignment problem) over a decade ago [Pet11].Here we see another instance of the disconnect between the principal minor assignment problem and determinantal processes (complementing the two cases discussed in Section 4.2 above).In Section 4.4 below, we discuss how our derivation of N 4 can be adapted to obtain Nanson-like higher-order determinantal tests.
We aim to explain where the polynomial N 4 (4.3)comes from.Checking that it is indeed a determinantal test is a direct verification (Proposition 4.5), and we do not focus on this here.
Assume that we are given the cluster functions T I (4.2),where I runs over subsets of {1, 2, 3, 4} with ≥ 2 elements.The T I 's are polynomials in the minors A I , but working with the T I 's is much more convenient.Let us use the T I 's to try finding the matrix elements a ij of the original matrix A.
Throughout the rest of this section, we will abbreviate expressions like T {1,2} as T 12 .Note that all the T I 's are symmetric in the indices.Assume that a 1i ̸ = 0 for all i = 2, 3, 4, and conjugate the matrix by the diagonal matrix with the entries d i = 1 i=1 + a 1i 1 i̸ =1 .Then we have for the conjugated matrix (denoted by Ã = (ã ij )): With this notation, we have T 1i = ãi1 and The second identity in (4.5) is by the definition of the cluster function (4.1), simplified thanks to (4.4).Equations (4.5) allow to find ãij T 1j and ãji T 1i as two distinct roots of a quadratic equation.We thus have ãij where we denoted Observe that R ij contains an unknown sign that we cannot determine a priori (it may also depend on i and j), but up to sign R ij is symmetric in i, j.
Let us substitute (4.6) into the following identity (which is again an instance of (4.1)): As a result, we obtain the following identity involving three square roots R 23 , R 34 , R 24 with unknown signs: Note that (4.7) does not contain the matrix elements ã.Thus, it is an algebraic (but not yet polynomial) identity on the cluster functions T I .Simplifying (4.7), we see that The left-hand side contains three summands with irrationalities R 24 R 34 , R 23 R 34 , and R 23 R 24 with uncertain signs.By choosing all possible eight combinations of the signs for R 23 , R 34 , R 24 , we see that there are only four possible combinations of signs in (4.8).Thus, by multiplying together all these four expressions with different signs, we can get rid of irrationality and obtain a polynomial in the T I 's: (4.9) Clearly, expanding the left-hand side of (4.9) squares all the quantities R ij .Thus, the resulting identity is polynomial in the T I 's, and, moreover, all unknown signs present in the R's disappear.
One can check (for example, using computer algebra) that the resulting polynomial (4.9) in the T I 's has 19 summands, and it is symmetric in the indices 1, 2, 3, 4. One can also verify that this polynomial divided by the common factor 256T 2 12 T 2 13 T 2 14 is exactly the same as the Nanson's test N 4 (4.3).This concludes our derivation of the Nanson's determinantal test of order four.

Procedure for higher-order Nanson tests
Adapting the derivation of the test N 4 given in Section 4.3 above, one can produce concrete determinantal tests N n for minors of general n × n matrices, where n ≥ 4. Let us explain the necessary steps for general n without going into full detail.We have from (4.1): (4.10) For every i < j, let us substitute the solutions (4.6), so (4.10) becomes Here the sum is also over (n − 1)-cycles σ on {2, . . ., n}, and "⟳" means that the product is cyclic in the sense that n + 1 is identified with 2. We see that (4.11) is an algebraic identity on the T I 's which does not contain the matrix elements ãij .
Opening up the parentheses in (4.11), one readily sees that all terms with an odd number of the factors R ij cancel out, while the terms with an even number of the factors R ij appear twice.Therefore, we can continue (4.11) as Here RHS is a sum over non-oriented (n − 1) cycles τ on {2, . . ., n}, where the summands are (n − 1)-fold cyclic products of the quantities T 1ij and R ij with a nonzero even number of the R's, and each such monomial has coefficient ±1.More precisely, the sign is determined by the number of descents τ (i) > τ (i + 1) in τ for which the monomial contains R τ (i)τ (i+1) (and not T 1τ (i)τ (i+1) ).Next, in RHS there are n−1 2 possible elements R ij , and each of them contains an unknown sign in front of the square root.Let us take the product over those of the 2 ( n−1 2 ) possible sign combinations which lead to the different RHS's.Expanding this product removes all irrationalities and unknown signs, and produces a polynomial (denoted by N n ) in the cluster functions T I , where I runs over subsets of {1, . . ., n} with ≥ 2 elements.We call N n the Nanson-like determinantal test of order n.
For example, for n = 5 identity (4.12) has the form (recall that the quantities T 1ij and R ij are symmetric in i, j): In the right-hand side, there are 2 ( 42 ) = 64 possible signs in the R ij 's, but they lead to "only" 32 distinct identities.Multiplying all these 32 expressions similarly to (4.9) and recalling the definition of the R's leads to a polynomial in the T I 's with no irrationality.This produces the determinantal test N 5 .

Application to Grothendieck measures and proof of Theorem 1.2
In this subsection we employ the Nanson determinantal test N 4 to prove Theorem 1.2 from Introduction.That is, we will show that the Grothendieck measure on partitions M ⃗ β;Gr (λ) (3.4) is not determinantal as a point process on Z ≥0 with points ℓ j = λ N +N −j, j = 1, . . ., N .
To compute one-point correlations, we employ Proposition 2.7 and the correlation kernel K 2d ⃗ β;Gr of the ambient Schur process (Proposition 3.4).We have by Proposition 2.7 (specifically, by its particular case (2.19)) This yields formulas for ρ Gr {i} , i = 0, 1, 2, 3, namely, Remark 4.6.These one-point correlation functions ρ Gr {i} can be also computed without using the finite-dimensional Fredholm-like determinants (4.14).Namely, and the infinite sum is explicit because the summands have the form (4.13).However, this simplification of correlation functions works only for small N and small order of correlation functions.We will use the full two-dimensional determinantal kernel to obtain asymptotics of Grothendieck random partitions in Section 3 below.
Plugging the correlation functions (4.13), (4.15) into the Nanson test (4.3)(with the help of the representation of cluster functions via minors (4.2)), we find where P 14 (xy) is a certain degree 14 polynomial in the single variable xy.We see that N 4 vanishes at β = 0, as it should be because then the Grothendieck measure reduces to the Schur measure which is determinantal.On the other hand, for β ̸ = 0 the test does not vanish in general.For example, at x = y = 1/2, we have where Q 3 , Q 5 , Q 7 , Q 9 are certain polynomials in β of degrees 3, 5, 7, 9, respectively.Since the Nanson determinantal test does not vanish for these values of x, y, β, this implies Theorem 1.2 from Introduction.

Limit shape of Grothendieck random partitions
In this section we employ the standard steepest descent asymptotic analysis of the correlation kernel of the Schur process (for example, explained in [Oko02, Section 3]) to derive the limit shape result for Grothendieck random partitions.

Limit shape of the Schur process
In this subsection we assume that all the parameters x i , y j , β r are homogeneous and satisfy (3.8), that is, for all i, j, r we have x > 0, y > 0, xy < 1, β < 0. (5.1) We require the parameters be nonzero, otherwise the measure degenerates and may not produce asymptotic limit shapes.Under conditions (5.1), the Schur process M 2d ⃗ β;Gr (3.10) is a well-defined probability measure on integer arrays With each such array, we associate a height function on Z ≥0 × {1, . . ., N } as follows: In words, H N (a, t) is the number of particles of the configuration X 2d at level t which are to the right of a.In particular, we have (5.3) The following limit shape result for the Schur process can be obtained in a standard manner via the steepest descent analysis of the correlation kernel K 2d ⃗ β;Gr (3.11)-(3.12).We refer to [OR03], [OR07], [BF14], [Dui13], [KPS19] for similar steepest descent arguments.
Throughout the rest of this subsection we will give an idea of proof of Theorem 5.1 together with the necessary formulas for the gradient ∇H.The integrand in the kernel K 2d (5.6) The critical point equation ∂ ∂z S(z; ξ, τ ) = 0 is equivalent to a cubic polynomial equation on z: (5.7) The region in the (ξ, τ ) plane where (5.7) has two complex conjugate nonreal roots is called the liquid region L. Inside it, the gradient ∇H(ξ, τ ) belongs to the interior of the triangle (5.5).
In Figure 4, L is the region inside the frozen boundary curve which we denote by ∂L.For (ξ, τ ) ∈ L, denote by z c = z c (ξ, τ ) the unique root of (5.7) in the upper half complex plane.This is a critical point of the function S (5.6).
We forgot a standard steepest descent analysis of the kernel K 2d ⃗ β;Gr which would constitute a detailed proof of Theorem 5.1.Instead, we briefly explain how to derive explicit formulas for the gradient ∇H.We need only the a priori assumption (which would follow from the steepest descent) that this gradient depends on the critical point z c in a harmonic way when z c belongs to the upper half-plane.When the point (ξ, τ ) approaches the boundary of the liquid region, the critical points z c and zc merge and become a real double critical point which is a double root of the cubic equation (5.7).Therefore, the frozen boundary curve ∂L can be obtained in parametric form by solving the equations ∂ ∂z S(z; ξ, τ ) = ∂ 2 ∂z 2 S(z; ξ, τ ) = 0, (5.8) in (ξ, τ ), and taking z c = zc ∈ R as a parameter.Equivalently, ∂L is the discriminant curve of the cubic equation (5.7).See (5.20) below for this parametrization of the frozen boundary curve (we do not an explicit parametrization just yet).
We are only interested in the "physical" part of the frozen boundary which lives in the half-infinite rectangle (ξ, τ ) ∈ [0, ∞) × [0, 1], and so not all values of z c = zc ∈ R correspond to points of the frozen boundary ∂L.Modulo this remark, we get the following trichotomy of the frozen zones: Proposition 5.2 (Frozen zone trichotomy).Depending on the location of the double critical point, we have: • If ∂L is adjacent to zones Ia or Ib, then z c = zc > 0.
• If ∂L is adjacent to zone II, then β < z c = zc < 0.
• If ∂L is adjacent to zone III, then z = zc < β.
Parts of ∂L bounding zones Ia-b are asymptotically formed by up-diagonal paths.In particular, the slope of these parts of ∂L in the (ξ, τ ) coordinates cannot exceed 1.One can check that in Figure 4, the rightmost part of the frozen boundary ∂L is not linear and has slope slightly less than 1.On the other hand, the boundaries of zones II and III are not formed by our up-diagonal paths.Instead, one should use suitably chosen "dual paths" defined through the complement of the particle configuration X 2d = {x m j }.Using Proposition 5.2, one can show that inside the liquid region, we have the following expressions for the gradient of the limit shape in terms of the critical point z c (ξ, τ ): (5.9) That is, 1 + ∂ ξ H and −∂ τ H are the normalized angles of the triangle in the complex plane with vertices 0, β, and z c , adjacent to 0 and z c , respectively (recall that both partial derivatives are negative).See Figure 5 for an illustration.
Remark 5.3.From the cubic equation ∂ ∂z S(z; ξ, τ ) = 0, one can readily check that the complex critical point z c (ξ, τ ) satisfies the following version of the complex Burgers equation: We refer to [KO07] for general details on how the complex Burgers equation arises for limit shapes of planar dimer models.

From Schur to Grothendieck limit shapes
From the limit shape result for the Schur process (Theorem 5.1 above), we readily get the limit shape of Grothendieck random partitions.Indeed, recall from Proposition 3.2 that the shifted random variables ℓ i = λ i + N − i, i = 1, . . ., N , under the Grothendieck measure M ⃗ β;Gr (3.4) are equal in distribution to the particle coordinates x i i = µ i i + N − i corresponding to the random partitions under the Schur process M 2d ⃗ β;Gr (3.10).The Schur process possesses a limit shape, so when i grows proportionally to N , the random variables x i i also scale proportionally to N .More precisely, Theorem 5.1 and the observation (5.3) imply that for all τ ∈ [0, 1] we have where the convergence is in probability.Here L(τ ) is a weakly decreasing function satisfying the equation H (L(τ ), τ ) = τ for all τ ∈ [0, 1], (5.12) where H(ξ, τ ) is the limit shape of the Schur process.In other words, the shape L(τ ) is the cross-section of the Schur process limit shape surface η = H(ξ, τ ) in the (ξ, τ, η) coordinates by the plane η = τ .
Proof.Observe that H(ξ, τ ) strictly decreases in ξ as long as H ̸ = 0, 1.Indeed, H is strictly monotone in the liquid region thanks to the first of the identities in (5.9).In the frozen zones, we have ∂ ξ H = 0 only in zones Ia-b, and there we have H = 0 in Ia or H = 1 in Ib.Indeed, ∂ ξ H = 0 implies z c (ξ, τ ) ∈ R, see (5.9).Since we only consider the "physical" part (ξ, τ ) ∈ [0, ∞) × [0, 1], it follows that (ξ, τ ) must lie on the frozen boundary.This implies that the function L(τ ) is determined by (5.12) uniquely for τ ̸ = 0, 1, and is continuous.For τ = 0, is it natural to set L(0) = max{ξ : H(ξ, 0) = 0} by continuity.For τ = 1, it suffices to show that (L(τ ), τ ) for τ close to 1 must belong to the frozen zone III and not Ib.For τ = 1, the critical point equation (5.7) has a root z = β independently of ξ.The discriminant of the remaining quadratic equation is negative for In particular, the discriminant is positive for ξ close to zero, so the point (ξ, τ ) = (0, 1) lies in a frozen zone.By looking at the value of z c = zc at a point of the adjacent frozen boundary, one can verify that the neighborhood of (ξ, τ ) = (0, 1) is always in zone III.Thus, H(ξ, 1) is strictly monotone in ξ in this neighborhood.Setting L(1) = 0, we get the continuity of L(τ ) at τ = 0, as desired.
In particular, the shift by τ − 1 in (5.13) comes from λ i = ℓ i + i − N , i = 1, . . ., N .When we need to indicate the dependence of L(τ ) on the parameters, we will write L(τ | x, y, β).
To help visualize the Grothendieck limit shape determined by the function L(τ ), we employ the coordinate system rotated by 45 • (for illustration, see Figure 1, left, in the Introduction).In this way, Young diagrams and their limit shapes become functions W(u), u ∈ R, satisfying were first considered in connection with the Vershik-Kerov-Logan-Shepp (VKLS) limit shape of Plancherel random partitions, see [LS77], [VK77].
Let the pre-limit continuous Young diagrams W N (u) correspond to the Grothendieck random partitions with parameters (x, y, β).The convergence (5.13) in Theorem 5.5 implies the pointwise convergence in probability as N → +∞ of the rescaled functions 1 N W N (uN ) to a limit shape.This limit shape is a continuous Young diagram u → W(u) which has parametric form In Section 5.4 below we present graphs of the limit shapes (5.16) for several choices of parameters (x, y, β) of the Grothendieck measure.

Properties of Grothendieck limit shapes
Here let us make several general observations in connection with the limit shape result for Grothendieck random partitions (Theorem 5.5).

Differential equations
Differentiating (5.12) in τ , we see that L(τ ) satisfies the differential equation L ′ (τ ) = 1−∂τ H(L(τ ),τ ) ∂ ξ H(L(τ ),τ ) .In terms of the critical point, with the help of (5.9), this equation has the form (5.17) Here z c = z c (ξ, τ ) is the root of the cubic equation (5.7) in the upper half plane if (ξ, τ ) belongs to the liquid region.When (ξ, τ ) is in a frozen zone, z c should be taken real such that the arguments in (5.9) give the gradient ∇H in this frozen zone.We refer to the trichotomy in Proposition 5.2, see also Figure 4 for an illustration.The limit shape continuous Young diagram W(u) (5.16) in the 45 • rotated coordinate system satisfies a more symmetric differential equation (5.18) We remark that the root z c (ξ, τ ) of the cubic equation (5.7) depends on (ξ, τ ) in a nonlinear and somewhat implicit manner.Therefore, it may be challenging to extract useful information about the Grothendieck limit shape from the differential equations (5.17)-(5.18).Even for producing the plots in Section 5.4 below we relied not on these differential equations, but rather on the original implicit equation (5.12).

Staircase frozen facet
Observe that when (ξ, τ ) is in the frozen zone II, we have ∇H = (−1, −1), which corresponds to taking z c from (β, 0).Thus, in this frozen zone we have from (5.17) and (5.18): Notice that for (5.19) to hold, the point (L(τ ), τ ) of the Grothendieck limit shape must belong to the frozen zone II.In fact, this is possible for certain choices of the parameters (x, y, β), namely, when β is sufficiently large in the absolute value: Lemma 5.6.Let the parameters (x, y, β) satisfy (5.1).For any fixed x, y, there exists β 0 < 0 such that for all all β < β 0 , the frozen zone II extends through the whole horizontal strip ξ > 0, 0 < τ < 1 in the (ξ, τ ) coordinates.See Figure 6 for an illustration.Proof.An explicit of the frozen boundary curve by z ∈ R is obtained by solving the double critical point equations (5.8).This parametrization has the form (5.20)One can check the following facts about the frozen boundary curve ∂L in the whole space (ξ, τ ) ∈ R 2 : • ∂L is tangent to the horizontal coordinate line at a unique point (ξ, 1) with ξ > 0. This point corresponds to z = β which is a double zero of τ − 1. Substituting z = β into ξ produces a positive quantity.
• ∂L is tangent to the vertical coordinate line at a unique point (0, τ ) with τ < 1.This point corresponds to z → ∞.Taking this limit in τ shows that the tangent point has τ < 1.
• The slope of the curve ∂L in the coordinates (ξ, 1 − τ ) (as in Figure 4) is which changes sign only at z = β and z = ∞.
• For z = y and z = 1/x, the curve ∂L goes to infinity in two different asymptotic directions.
For z → y we have ξ, 1 − τ → −∞, and for z → 1/x we have ξ, 1 − τ → +∞.Each of these asymptotic directions has degree 2, that is, there are exactly two components of ∂L escaping to infinity in each of the first and the third quadrants in the coordinates (ξ, 1 − τ ).Now let us look at the "cusp" point of ∂L, that is, where the third derivative of S(z; ξ, τ ) vanishes along with the first two.In Figure 4, the cusp is at the tip of the frozen zone II.Let us show that the cusp point is always unique and exists in the full space (ξ, τ ) ∈ R 2 .Take ∂ 3 ∂z 3 S(z; ξ, τ ), and substitute into it ξ, τ as in (5.20).We obtain a rational function in z and the parameters (x, y, β) whose numerator is a cubic polynomial which is manifestly negative.Therefore, there is a unique real root z of P(z), and it corresponds to the cusp point.
The polynomial P 0 (z) has a unique real root, denote it by z 0 .Clearly, the root of P(z) becomes close to z 0 as β → −∞.Next, for z = z 0 , we have Since P 0 (− y/x) > 0 and the coefficient by z 3 in P 0 is negative, we see that y − xz 2 0 > 0. This inequality implies that the cusp point of ∂L goes to infinity along the main diagonal in the first quadrant in the coordinates (ξ, 1 − τ ).
We conclude that for large β, four components of the frozen boundary escape as ξ, 1 − τ → +∞, and two components escape as ξ, 1 − τ → −∞.Together with the tangence properties observed at the beginning of the proof, this implies that each horizontal line at height τ , τ ∈ [0, 1], intersects the frozen boundary precisely four times.The frozen zone II is between the middle two intersections.This completes the proof.By Lemma 5.6, if |β| is sufficiently large and β < 0, the limit shape of the Grothendieck random partition always has a part where the derivative satisfies (5.19).In particular, the density of the particles ℓ i is 1 2 .We call the part of the Grothendieck limit shape where (5.19) holds the staircase frozen facet.
Let us discuss how the partition λ looks in the staircase facet.For the two-dimensional Schur process, in zone II the up-diagonal paths are densely packed and move diagonally.In terms of the particle configuration X 2d = {x m i : 1 ≤ m, i ≤ N }, this means that Thus, for the coordinates λ i and ℓ i = λ i + N − i of the Grothendieck random partition, where ℓ i = x i i in distribution (Proposition 3.2), we have in the staircase facet: Thus, in this facet, the Young diagram λ locally looks like a staircase with no fluctuations.This justifies the name "staircase frozen facet".In the 45 • rotated coordinates, the limit shape W(u | x, y, β) of λ is horizontal in this facet.We refer to Section 5.4 for illustrations of staircase facets.

Reduction to Schur measures and Plancherel limit shapes
Observe that for all β ≤ 0, under the Schur process M 2d (5.21) When β = 0, the weights (−β) of the diagonal edges in the directed graph in Figure 2 vanish.Thus, for β = 0, all up-diagonal paths must go vertically, and almost surely µ m = µ N for all m = 1, . . ., N .This implies that for fixed x, y and as β ↗ 0, the limit shape W(u | x, y, β) of the Grothendieck random partition λ i = µ i i converges to that of the Schur measure (5.21).Denote the latter limit shape by S τ =1 (u).It depends on the parameters x, y only through their product, and is independent of β.
On the other hand, the marginal distribution of the partition µ 1 is the following Schur measure: ( where (− β, . . ., − β) is the dual specialization (e.g., see [BG16, Section 2] for the definition).Denote the limit shape of µ 1 by S τ =0 (u).It depends on all our parameters x, y, β.

Grothendieck limit shape plots
The limit shape surface H(ξ, τ ) of the two-dimensional Schur process has the normal vector ∇H(ξ, τ ).This gradient is expressed through the solution z c (ξ, τ ) to the cubic equation (5.7), see (5.9).However, H(ξ, τ ) itself is not explicit, making it necessary to employ numerical integration to graph the surface.This is achieved by integrating the gradient along the ξ direction, starting from +∞ and moving towards the point (ξ, τ ).
Recall that the Grothendieck limit shape L(τ ) is the cross-section of the Schur process limit shape surface η = H(ξ, τ ) in the (ξ, τ, η) coordinates, at the plane η = τ .This cross-section is not explicit either.Therefore, we need to solve numerically the implicit equation (5.12) to get the desired function L(τ ).After obtaining L(τ ), we use it to graph the shape W(u) in the coordinate system rotated by 45 • using the parametric representation (5.16).
We remark that the differential equations (5.17) and (5.18) for L(τ ) or W(u), respectively, are not very useful for graphing directly, as they cannot be solved explicitly.While a numerical solution of these differential equations is possible, it would require specific convergence estimates, which we avoid with our more direct approach.
We implement a cubic equation solver in Python to find the roots z c (ξ, τ ) along a regular grid of (ξ, τ ), utilizing the code from [KH17].Then (also with Python) we perform direct numerical integration of the ξ-gradient of the height function (5.9).After that we solve the implicit equation (5.12).This procedure yields the values of W(u) along a non-regular grid in u, which is sufficient for graphing the limit shape of Grothendieck random partitions.Our Python code is available at [GP23].
Remark 5.9.Here we do not perform probabilistic simulations of Grothendieck random partitions, but rather focus on numerically graphing the Grothendieck limit shapes which exist due to Theorem 5.5.
Next we descibe the resulting plots of Grothendieck limit shapes.The images are located at the end of the paper.5.4.1 Basic example (x = 1/3, y = 1/5, β = −6) First, we take the same parameters as in Figure 4.In Figure 7, the left pane displays the limit shape surface H for the Schur process (red), the plane η = τ (blue), and the curve (L(τ ), τ, τ ) in the cross-section.The top right pane shows the projection of the cross-section onto the bottom coordinate plane (ξ, 1 − τ ), and also includes the frozen boundary curve.The frozen boundary is the same as in Figure 4.The bottom right pane presents the limit shape of Grothendieck random partitions in the coordinates (u, W(u)).The limit shape W(u) always lies below the line u + 2, as the number of nonzero parts in the Grothendieck random partition is limited to at most N .5.4.2Large negative beta (x = 1/3, y = 1/5, β = −25) Second, we consider the case of large negative β.In the top left pane in Figure 8, we have zoomed in around the flat section of the surface H (red).The blue plane corresponds to η = τ , and the black meshed plane extends the zone II frozen facet of H which has ∇H = (−1, −1).We see that the intersection of the blue plane with the red surface is a straight line in this neighborhood.The bottom left pane displays the projection of the cross-section, similar to Figure 7.By Lemma 5.6, the black curve must traverse through zone II.On the right pane, we added a horizontal line to highlight the staircase frozen facet where the limit shape W(u) is horizontal.

Plancherel-like behavior for small negative beta
In Figures 10 and 11 we numerically support Conjecture 5.7 that the rescaled Grothendieck limit shape converges to the VKLS shape Ω(u) (5.23) as x, y → 0 such that β ≪ x.In Figure 10

Plancherel-like behavior for large negative beta
In Figure 12, we consider the regime of Conjecture 5.8, and take x = y = 1/40, β = −120, so −βy = 3.The Grothendieck limit shape W(u) has a staircase frozen facet, and to the right of it we observe a curved part of size O( √ xy).Zooming in, we see that this part of W(u) does not seem to be close to the shifted and scaled VKLS shape, see Figure 12, right.5.4.5 Positive beta (x = 1/3, y = 1/5, β = 1/12) By Proposition 3.1, the Grothendieck measure M ⃗ β;Gr (λ) on partitions is also nonnegative for 0 ≤ β < min(x −1 , y).Setting β > 0 makes the corresponding two-dimensional Schur process (3.10) a signed probability measure.However, in this case we can still define the surface H(ξ, τ ) using the root z c (ξ, τ ) of the cubic equation (5.7).Then we can define the curve L(τ ) as the solution of the implicit equation (5.12), and finally obtain a shape W(u) via (5.16).This leads to the following conjecture: Conjecture 5.10.The curve W(u) = W(u | x, y, β) is well-defined by the procedure described above for all β < min(x −1 , y).Moreover, this curve W(u) is the limit shape of the random where T (N + s − 1) j means the j-th part of the shape of the Young tableau.
Proof.The joint distribution of the shapes of the semistandard Young tableaux T (N + s − 1), s = 1, . . ., N , is given by the Schur process M 2d ⃗ β;Gr (3.10) (with homogeneous parameters), where the shape of T (N + s − 1) is µ N −s+1 .Indeed, this statement follows from the general Schur dynamics result [Bor11b, Theorem 10] (where instead of the push-block dynamics one can use the Robinson-Schensted-Knuth one, cf.[BP16b], [MP17]).With this identification, the desired claim follows from Proposition 3.2. .See Section 5.5 for a discussion of the sampling mechanism.We observe that the samples follow the limit shapes from Figures 7 and 8, as it should be.In particular, notice the staircase frozen facet on the right plot.On the right, we added the shifted and scaled VKLS shape (given by (5.24) with Ω (K) replaced by Ω (5.23)).The Grothendieck limit shape apparently is not close to the shifted and scaled VKLS shape.See Section 5.4 for more detail.

Figure 4 :
Figure 4: An example of the frozen boundary curve in the (ξ, τ ) coordinates, and an example of several up-diagonal paths as in Figure2serving as the level lines for the pre-limit height function H N (5.2).There are no up-diagonal paths in the frozen zones Ia-b, so ∇H = (0, 0).In zone II, the paths go diagonally, so ∇H = (−1, −1).Finally, in zone III, the paths go vertically, so ∇H = (−1, 0).These frozen zone gradients correspond to the vertices of the triangle (5.5).In this example, we have x = 1/3, y = 1/5, β = −6.For other values of parameters, zones Ib and II may be present.Zone III is always present, see Lemma 5.4 below.
u) = |u| for all large enough |u|.(5.14) Define the norm of a continuous Young diagram by u) − |u|) du.(5.15)Before the limit, the functions W N (u) corresponding to Young diagrams λ with at most N rows are piecewise linear with derivatives ±1 and integer maxima and minima.Note that ∥W N ∥ = |λ| is the number of boxes in the Young diagram.The space of all functions satisfying (5.14) is called the space of continuous Young diagrams by Kerov, see [Ker03, Chapter 4]. 3 Young diagrams in the coordinate system rotated by 45 • .16) This parametric form follows from the change of coordinates from (τ, L(τ ) + τ − 1) to (u, W(u)) under the 45 • rotation.When we need to indicate the dependence of W(u) on the parameters of the Grothendieck measure, we will write W(u | x, y, β).Thus, we have established Theorem 1.4 from the Introduction.

Figure 9 :
Figure9: Exact samples of the Grothendieck random partitions with N = 50 and parameters x = 1/3, y = 1/5, and β = −6 (left plot) or β = −25 (right plot).See Section 5.5 for a discussion of the sampling mechanism.We observe that the samples follow the limit shapes from Figures7 and 8, as it should be.In particular, notice the staircase frozen facet on the right plot.

Figure 12 :
Figure12: Graphs with x = y = 1/40 and β = −120.On the right, we added the shifted and scaled VKLS shape (given by (5.24) with Ω (K) replaced by Ω (5.23)).The Grothendieck limit shape apparently is not close to the shifted and scaled VKLS shape.See Section 5.4 for more detail.
The first author is partially supported by International Laboratory of Cluster Geometry, NRU HSE, ag.number 075-15-2021-608.The work of the second author was partially supported by the NSF grants DMS-1664617 and DMS-2153869 as well as by DMS-1928930 (in connection with the program "Universality and Integrability in Random Matrix Theory and Interacting Particle Systems" hosted by the Mathematical Sciences Research Institute in Berkeley, California, during the Fall 2021 semester) and by the Simons Collaboration Grant for Mathematicians 709055.