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

We consider numeration systems based on a $d$-tuple $\mathbf{U}=(U_1,\ldots,U_d)$ of sequences of integers and we define $(\mathbf{U},\mathbb{K})$-regular sequences through $\mathbb{K}$-recognizable formal series, where $\mathbb{K}$ is any…

In this article, using kernel convolution of order based dependent Dirichlet process (Griffin and Steel (2006)) we construct a nonstationary, nonseparable, nonparametric space-time process, which, as we show, satisfies desirable properties,…

The Schwarz Waveform Relaxation algorithm (SWR) exchanges the waveform of boundary value between neighbouring sub-domains, which provides a more efficient way than the other Schwarz algorithms to realize distributed computation. However,…

Let $X_1,~X_2,\cdots$ be a sequence of i.i.d random variables which are supposed to be observed in sequence. The $n$th value in the sequence is a $k-record~value$ if exactly $k$ of the first $n$ values (including $X_n$) are at least as…

Small-scale intermittency is studied as the deviation of the probability distributions of pseudodissipation, dissipation and enstrophy in turbulence from those of a Gaussian random velocity field. This deviation is quantified using…

It has been recently demonstrated, [3], that according to the principle of release of constraints, absence of shear stresses in the Euler equations must be compensated by additional degrees of freedom, and that led to a Reynolds-type…

Random motions on the line and on the plane with space-varying velocities are considered and analyzed in this paper. On the line we investigate symmetric and asymmetric telegraph processes with space-dependent velocities and we are able to…

It is known that the Schur expansion of a skew Schur function runs over the interval of partitions, equipped with dominance order, defined by the least and the most dominant Littlewood-Richardson filling of the skew shape. We characterise…

Frequently, randomly organized data is needed to avoid an anomalous operation of other algorithms and computational processes. An analogy is that a deck of cards is ordered within the pack, but before a game of poker or solitaire the deck…

We study the relations between the invariants $\tau_{RT}$, $\tau_{HKR}$, and $\tau_L$ of Reshetikhin-Turaev, Hennings-Kauffman-Radford, and Lyubashenko, respectively. In particular, we discuss explicitly how $\tau_L$ specializes to…

Let $S(k)$ be the scattering matrix for a Schr\"odinger operator (Laplacian plus potential) on $\RR^n$ with compactly supported smooth potential. It is well known that $S(k)$ is unitary and that the spectrum of $S(k)$ accumulates on the…

The Shirley reduced basis (SRB) represents the periodic parts of Bloch functions as linear combi- nations of eigenvectors taken from a coarse sample of the Brillouin zone, orthogonalized and reduced through proper orthogonal decomposition.…

We construct meta-intransitive systems of independent random variables of any finite order from basic tuple of random variables which generalize intransitive dice. Under this construction, the equality of some linear functional is…

The phenomenology of the scaling behavior of higher order structure functions of velocity differences across a scale $R$ in turbulence should be built around the irreducible representations of the rotation symmetry group. Every irreducible…

The HRT (Heil-Ramanathan-Topiwala) conjecture asks whether a finite collection of time-frequency shifts of a non-zero square integrable function on $\mathbb{R}$ is linearly independent. This longstanding conjecture remains largely open even…

We consider the construction of refined Chern-Simons torus knot invariants by M. Aganagic and S. Shakirov from the DAHA viewpoint of I. Cherednik. We give a proof of Cherednik's conjecture on the stabilization of superpolynomials, and then…

The well-known Gilbert-Shannon-Reeds model for riffle shuffles assumes that the cards are initially cut 'about in half' and then riffled together. We analyze a natural variant where the initial cut is biased. Extending results of Fulman…

A rearrangement of $n$ independent uniform $[0,1]$ random variables is a sequence of $n$ random variables $Y_1,...,Y_n$ whose vector of order statistics has the same distribution as that for the $n$ uniforms. We consider rearrangements…

We present a new continuous Lyapunov Redesign (LR) methodology for the robust stabilization of a class of uncertain time-delay systems that is based on the so-called Super Twisting Algorithm. The main feature of the proposed approach is…

Random reshuffling with momentum (RRM) corresponds to the SGD optimizer with momentum option enabled, as found in many machine learning libraries like PyTorch and TensorFlow. Despite its widespread use, the convergence properties of RRM do…