Related papers: Shuffle Invariance of the Super-RSK Algorithm

We consider a variant of regression problem, where the correspondence between input and output data is not available. Such shuffled data is commonly observed in many real world problems. Taking flow cytometry as an example, the measuring…

Randomized algorithms and data structures are often analyzed under the assumption of access to a perfect source of randomness. The most fundamental metric used to measure how "random" a hash function or a random number generator is, is its…

In this work, we develop efficient solvers for linear inverse problems based on randomized singular value decomposition (RSVD). This is achieved by combining RSVD with classical regularization methods, e.g., truncated singular value…

We determine fundamental systems of invariants for complex solvable rigid Lie algebras having nonsplit nilradicals of characteristic sequence $(3,1,..,1)$, these algebras being the natural followers of solvable algebras having Heisenberg…

Let H be a subgroup of a finite group G. We use Markov chains to quantify how large r should be so that the decomposition of the r tensor power of the representation of G on cosets on H behaves (after renormalization) like the regular…

We define and construct the "canonical reduced word" of a boolean permutation, and show that the RSK tableaux for that permutation can be read off directly from this reduced word. We also describe those tableaux that can correspond to…

Starting from N=2 supersymmetric theories in 2 dimensions, we formulate a novel time-dependent supersymmetric quantum theory where the R-charge is twisted along the time. The invariance of the supersymmetric index under variations of the…

Building off of recent results on Keisler's order, we show that consistently, $\leq_{SP}$ has infinitely many classes. In particular, we define the property of $\leq k$-type amalgamation for simple theories, for each $2 \leq k < \omega$. If…

We prove the following: Fix an integer $k\geq 2$, and let $T$ be a real number with $T\geq 1.5$. Let $\cH=(V,\cE_2\cup \cE_3\cup\dots\cup\cE_k)$ be a non-uniform hypergraph with the vertex set $V$ and the set $\cE_i$ of edges of size…

For almost all tuples $(x_1,\dots,x_n)$ of complex numbers, a strong version of Schanuel's Conjecture is true: the $2n$ numbers $x_1,\dots,x_n, {\mathrm e}^{x_1},\dots, {\mathrm e}^{x_n}$ are algebraically independent. Similar statements…

We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…

This paper considers the $(n,k)$-Bernoulli--Laplace model in the case when there are two urns, the total number of red and white balls is the same, and the number of selections $k$ at each step is on the same asymptotic order as the number…

We study a family of shuffling operators on the symmetric group $S_n$, which includes the top-to-random shuffle. The general shuffling scheme consists of removing one card at a time from the deck (according to some probability distribution)…

Using the skew-Hopf pairing, we obtain $\mathcal{R}$-matrix for the two-parameter quantum algebra $U_{v,t}$. We further construct a strict monoidal functor $\mathcal{T}$ from the tangle category $(\mathrm{OTa},\otimes, \emptyset)$ to the…

In principle particle spins can be measured from their production cross sections once their mass is approximately known. The method works in practice because spins are quantized and cross sections depend strongly on spins. It can be used to…

Suppose $A\subset \mathbb{R}$ of size $k$ has distinct consecutive $r$--differences, that is for $1 \leq i \leq k -r$, the $r$--tuples $$(a_{i+1} - a_i , \ldots , a_{i+r} - a_{i + r -1})$$ are distinct. Then for any finite $B \subset…

One of the most widely used methods for eigenvalue computation is the $QR$ iteration with Wilkinson's shift: here the shift $s$ is the eigenvalue of the bottom $2\times 2$ principal minor closest to the corner entry. It has been a…

We study the k-wise independent relaxation of the usual model G(N,p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probability p, however, it is only required that the distribution of any…

A turbulent flow is characterized by velocity fluctuations excited in an extremely broad interval of wave numbers $k> \Lambda_{f}$ where $\Lambda_{f}$ is a relatively small set of the wave-vectors where energy is pumped into fluid by…

We consider an efficient computational framework for speeding up several machine learning algorithms with almost no loss of accuracy. The proposed framework relies on projections via structured matrices that we call Structured Spinners,…