Related papers: Robinson-Schensted-Knuth algorithm, jeu de taquin …

Randomized methods, such as the randomized SVD (singular value decomposition) and Nystr\"om approximation, are an effective way to compute low-rank approximations of large matrices. Motivated by applications to operator learning, Boull\'e…

We study the ergodic properties of two classes of random dynamical systems: a type of Markov chain which we call the \textit{alternating random walk} and a certain stochastic billiard system which describes the motion of a free-moving rough…

Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. We examine how the sign property is transferred by the skew Robinson-Schensted correspondence…

In arXiv:1808.06095 we have introduced the Knuth class of the word recording a sequence of locations for repeated internal insertion operations in the Sagan-Stanley skew RSK correspondence, with no prescribed external insertion of new…

The randomized Kaczmarz (RK) method is an iterative method for approximating the least-squares solution of large linear systems of equations. The standard RK method uses sequential updates, making parallel computation difficult. Here, we…

We consider an infinite system of coupled stochastic differential equations (SDE) describing dynamics of the following infinite particle system. Each partricle is characterised by its position $x\in \mathbb{R}^{d}$ and internal parameter…

For a class of dynamical systems, called the axiom-A systems, Sinai, Ruelle and Bowen showed the existence of an invariant measure (SRB measure) weakly attracting the temporal average of any initial distribution that is absolutely…

We introduce the concept of entanglement features of unitary gates, as a collection of exponentiated entanglement entropies over all bipartitions of input and output channels. We obtained the general formula for time-dependent $n$th-Renyi…

The Randomized Kaczmarz method (RK) is a stochastic iterative method for solving linear systems that has recently grown in popularity due to its speed and low memory requirement. Selectable Set Randomized Kaczmarz (SSRK) is an variant of RK…

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.

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…

We study spherically symmetric spacetimes for matter distributions with isotropic pressures. We generate new exact solutions to the Einstein field equations which also contains isotropic pressures. We develop an algorithm that produces a…

Cylindric Young tableaux are combinatorial objects that first appeared in the 1990s. A natural extension of the classical notion of a Young tableau, they have since been used several times, most notably by Gessel and Krattenthaler and by…

We study invariant measures for random countable (finite or infinite) conformal iterated function systems (IFS) with arbitrary overlaps. We do not assume any type of separation condition. We prove, under a mild assumption of finite entropy,…

This paper extends the deterministic Lyapunov-based stabilization framework to random hyperbolic systems of conservation laws, where uncertainties arise in boundary controls and initial data. Building on the finite volume discretization…

We present a novel $Q$-learning algorithm tailored to solve distributionally robust Markov decision problems where the corresponding ambiguity set of transition probabilities for the underlying Markov decision process is a Wasserstein ball…

The Berele row-insertion is a symplectic analogue of the Schensted row-insertion. In the present paper, we provide it with a representation theoretical interpretation via the quantum symmetric pairs of type $A\mathrm{II}$. As applications,…

A Dynkin game is considered for stochastic differential equations with random coefficients. We first apply Qiu and Tang's maximum principle for backward stochastic partial differential equations to generalize Krylov estimate for the…

We propose a new and generic approach for detecting multiple change-points in dynamic networks with Markov formation, termed random interval distillation (RID). By collecting random intervals with sufficient strength of signals and…

We examine a wide class of stochastic approximation algorithms for solving (stochastic) nonlinear problems on Riemannian manifolds. Such algorithms arise naturally in the study of Riemannian optimization, game theory and optimal transport,…