Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0601348

On an identity due to ((Bump and Diaconis) and (Tracy and Widom))

Paul-Olivier Dehaye
View original source ↗Read source document ↗Export metadata ↓

Abstract

A classical question for a Toeplitz matrix with given symbol is to compute asymptotics for the determinants of its reductions to finite rank. One can also consider how those asymptotics are affected when shifting an initial set of rows and columns (or, equivalently, asymptotics of their minors). Bump and Diaconis (Toeplitz minors, J. Combin. Theory Ser. A, 97 (2002), pp. 252--271) obtained a formula for such shifts involving Laguerre polynomials and sums over symmetric groups. They also showed how the Heine identity extends for such minors, which makes this question relevant to Random Matrix Theory. Independently, Tracy and Widom (On the limit of some Toeplitz-like determinants, SIAM J. Matrix Anal. Appl., 23 (2002), pp. 1194--1196) used the Wiener-Hopf factorization to express those shifts in terms of products of infinite matrices. We show directly why those two expressions are equal and uncover some structure in both formulas that was unknown to their authors. We introduce a mysterious differential operator on symmetric functions that is very similar to vertex operators. We show that the Bump-Diaconis-Tracy- Widom identity is a differentiated version of the classical Jacobi-Trudi identity.

Explore related subjects

math.COmath.FA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul-Olivier Dehaye. 2008-06-27. On an identity due to ((Bump and Diaconis) and (Tracy and Widom)). https://arxiv.org/abs/math/0601348

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗