相关论文: Shuffle Invariance of the Super-RSK Algorithm

English title: Eigenvalues of Symmetrized Shuffling Operators The random-to-random shuffling operator explains, for example, the evolution of a deck of cards subject to the following random process: draw a card randomly from the deck and…

Part I of this series (arXiv:2602.09029) develops a sharp Gaussian (LAN/GDP) limit theory for neighboring shuffle experiments when the local randomizer is fixed and has full support bounded away from zero. The present paper characterizes…

We investigate Lie symmetry algebra of the Benney-Roskes/Zakharov-Rubenchik systems. The invariance algebra turns out to be infinite-dimensional. We also find several exact solutions of periodic, line-soliton and stationary types.

We present experimental results for Rayleigh-Benard convection with rotation about a vertical axis at dimensionless rotation rates in the range 0 to 250 and upto 20% above the onset. Critical Rayleigh numbers and wavenumbers agree with…

This work constructs Jonson-Lindenstrauss embeddings with best accuracy, as measured by variance, mean-squared error and exponential concentration of the length distortion. Lower bounds for any data and embedding dimensions are determined,…

Variational inequalities have gained significant attention in machine learning and optimization research. While stochastic methods for solving these problems typically assume independent data sampling, we investigate an alternative approach…

In this article the construction of a stationary random knot is proposed. The corresponding smooth random curve has no self-intersections in deterministic moments of time and changes its topological type at random moments.

Using the complete orthonormal basis sets of nonrelativistic and quasirelativistic orbitals introduced by the author in previous papers for particles with arbitrary spin the new analytical relations for the -component relativistic tensor…

A triangle $T^{(r)}$ in an $r$-uniform hypergraph is a set of $r+1$ edges such that $r$ of them share a common $(r-1)$-set of vertices and the last edge contains the remaining vertex from each of the first $r$ edges. Our main result is that…

Based on sketching techniques, we propose two randomized algorithms for tensor ring (TR) decomposition. Specifically, by defining new tensor products and investigating their properties, we apply the Kronecker sub-sampled randomized Fourier…

Algebraic realizations of supersymmetry through SU(m,n) type superalgebras are developed. We show their applications to a bilocal quark-antiquark or a quark-diquark systems. A new scheme based on SU(6/1) is fully exploited and the bilocal…

This paper studies statistics of riffle shuffles by relating them to random word statistics with the use of inverse shuffles. Asymptotic normality of the number of descents and inversions in riffle shuffles with convergence rates of order…

A model is discussed where all operators are constructed from a quantum scalar field whose energy spectrum takes on all real values. The Schr\"odinger picture wave function depends upon space and time coordinates for each particle, as well…

We analyze the convergence rates of stochastic gradient algorithms for smooth finite-sum minimax optimization and show that, for many such algorithms, sampling the data points without replacement leads to faster convergence compared to…

We study the shape of the Young diagram \lambda associated via the Robinson-Schensted-Knuth algorithm to a random permutation in S_n such that the length of the longest decreasing subsequence is not bigger than a fixed number d; in other…

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of random Tikhonov regularization path and decompose the tracking error of…

A $k$-uniform hypergraph with $n$ vertices is an $(n,k,\ell)$-omitting system if it does not contain two edges whose intersection has size exactly $\ell$. If in addition it does not contain two edges whose intersection has size greater than…

Through dualities on representations on tensor powers and symmetric powers respectively, the partition algebra and multiset partition algebra have been used to study long-standing questions in the representation theory of the symmetric…

Consider a sequence X_1, X_2,... of i.i.d. uniform random variables taking values in the alphabet set {1,2,...,d}. A k-superpattern is a realization of X_1,...,X_t that contains, as an embedded subsequence, each of the non-order-isomorphic…

We construct all independent local scalar monomials in the Riemann tensor at arbitrary dimension, for the special regime of static, spherically symmetric geometries. Compared to general spaces, their number is significantly reduced: the…