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

Let $H$ be a random $k$-uniform $n$-vertex hypergraph where every $k$-tuple belongs to $H$ independently with probability $p$. We show that for some $\varepsilon_k > 0$, if $p \geq n^{-\varepsilon_k}$, then asymptotically almost surely $H$…

This work establishes a quenched (trajectory-wise) linear response formula for random intermittent dynamical systems, consisting of Liverani-Saussol-Vaienti maps with varying parameters. This result complements recent annealed (averaged)…

The most general local, classically scale invariant, perturbatively renormalizable, globally $SU(N)$ invariant Lagrangian is constructed for spin-1 fields in 4 dimensions. The total number of independent couplings is 7 and the 1-loop…

Our main result here is that the specialization at $t=1/q$ of the $Q_{km,kn}$ operators studied in [4] may be given a very simple plethystic form. This discovery yields elementary and direct derivations of several identities relating these…

We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer…

Undirected graphical models are used extensively in the biological and social sciences to encode a pattern of conditional independences between variables, where the absence of an edge between two nodes $a$ and $b$ indicates that the…

We introduce and study q-randomized Robinson-Schensted-Knuth (RSK) correspondences which interpolate between the classical (q=0) and geometric (q->1) RSK correspondences (the latter ones are sometimes also called tropical). For 0<q<1 our…

We develop a randomized Newton method capable of solving learning problems with huge dimensional feature spaces, which is a common setting in applications such as medical imaging, genomics and seismology. Our method leverages randomized…

We introduce and analyze the $S_k$ shuffle on $N$ cards, a natural generalization of the celebrated random adjacent transposition shuffle. In the $S_k$ shuffle, we choose uniformly at random a block of $k$ consecutive cards, and shuffle…

This work introduces a novel algorithm to solve large-scale eigenvalue problems and seek a small set of eigenpairs. The method, called randomized Krylov-Schur (rKS), has a simple implementation and benefits from fast and efficient…

A h-uniform hypergraph H=(V,E) is called (l,k)-orientable if there exists an assignment of each hyperedge e to exactly l of its vertices such that no vertex is assigned more than k hyperedges. Let H_{n,m,h} be a hypergraph, drawn uniformly…

Random matrix theory (RMT) is based on two assumptions: (1) matrix-element independence, and (2) base invariance. Most of the proposed generalizations keep the first assumption and violate the second. Recently, several authors presented…

This work addresses a modification of the random geometric graph (RGG) model by considering a set of points uniformly and independently distributed on the surface of a $(d-1)$-sphere with radius $r$ in a $d-$dimensional Euclidean space,…

We show that the Grassmannian independence of the super Lagrangian density, expressed in terms of the superfields defined on a (4, 2)-dimensional supermanifold, is a clear-cut proof for the Becchi-Rouet-Stora-Tyutin (BRST) and anti-BRST…

Let $V$ be a vertex algebra and $g$ an automorphism of $V$ of order $T$. We construct a sequence of associative algebras $\tilde{A}_{g,n}(V )$ for any $n\in(1/T)\mathbb{N}$, which are not depend on the conformal structure of $V$. We show…

The relativistic spinning particle model, proposed in [3,4], is analyzed in a Hamiltonian framework. The spin is simulated by extending the configuration space by introducing a light-like four vector degree of freedom. The model is heavily…

We compute the algebraic K-theory of the non-commutative ring k<x_1,...,x_n>/(m^a) when k is a perfect field of positive characteristic and m=(x_1,...,x_n). We express the answer in terms of the truncation poset Witt vectors developed in…

We study an example of a {\em hit-and-run} random walk on the symmetric group $\mathbf S_n$. Our starting point is the well understood {\em top-to-random} shuffle. In the hit-and-run version, at each {\em single step}, after picking the…

Top-$k$ queries allow end-users to focus on the most important (top-$k$) answers amongst those which satisfy the query. In traditional databases, a user defined score function assigns a score value to each tuple and a top-$k$ query returns…

We consider a problem of shuffling a deck of cards with ordered labels. Namely we split the deck of N=k^tq cards (where t>=1 is maximal) into k equally sized stacks and then take the top card off of each stack and sort them by the order of…