SearcharxivSearch

arXiv · 2603.22360

Toeplitz matrices from permutation displacements and the triangular kernel

Abstract

Toeplitz matrices arise naturally in harmonic analysis, operator theory, and numerical analysis. In this note we investigate Toeplitz matrices whose coefficients depend on the matrix size through a scaled kernel $a_k=f(k/n)$. We show that the empirical mean of their eigenvalues converges to a weighted integral of $f$, where the weight $1-|x|$ reflects the density of diagonals in Toeplitz matrices. We then introduce a combinatorial construction associating a Toeplitz matrix to a permutation via its displacement counts. For a uniformly random permutation, the expected matrix converges to the Toeplitz matrix generated by the triangular kernel $1-|x|$. Interestingly, the triangular kernel also appears as the covariance function of the integrated Brownian motion, providing a probabilistic interpretation of the same operator. Finally, we analyze the integral operator with kernel $(1-|x-y|)$ on $[0,1]$ and determine its eigenfunctions and eigenvalues explicitly. This operator describes the limiting spectral structure associated with the averaged Toeplitz matrices arising from permutation displacements. These results highlight a natural bridge between Toeplitz matrix theory, permutation statistics, and classical integral operators.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-Christophe Pain. 2026-03-22. Toeplitz matrices from permutation displacements and the triangular kernel. https://arxiv.org/abs/2603.22360

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR