相关论文: Iterating the RSK Bijection

Constant structure closed semantic systems are the systems each element of which receives its definition through the correspondent unchangeable set of other elements of the system. Discrete time means here that the definitions of the…

Recent empirical studies have identified fixed point iteration phenomena in deep neural networks, where the hidden state tends to stabilize after several layers, showing minimal change in subsequent layers. This observation has spurred the…

Resetting has been shown to reduce the completion time for a stochastic process, such as the first passage time for a diffusive searcher to find a target. The time between two consecutive resetting events is drawn from a waiting time…

We present a simple a bijection between permutations of $\{1,..., n\}$ with $k$ descents and permutation tableaux of length $n$ with $k$ columns.

In a dynamic retrieval system, documents must be ingested as they arrive, and be immediately findable by queries. Our purpose in this paper is to describe an index structure and processing regime that accommodates that requirement for…

There is a natural bijection between permutations obtainable using a stack (those avoiding the pattern 312) and permutations obtainable using a queue (those avoiding 321). This bijection is equivalent to one described by Simion and Schmidt…

How can we process a piece of recorded music to detect and visualize the onset of each instrument? A simple, interpretable approach is based on partially fixed nonnegative matrix factorization (NMF). Yet despite the method's simplicity,…

We consider the motion of a randomly accelerated particle in one dimension under stochastic resetting mechanism. Denoting the position and velocity by $x$ and $v$ respectively, we consider two different resetting protocols - (i) complete…

Bilingual lexicon induction induces the word translations by aligning independently trained word embeddings in two languages. Existing approaches generally focus on minimizing the distances between words in the aligned pairs, while…

For a fixed permutation $\sigma \in S_k$, let $N_{\sigma}$ denote the function which counts occurrences of $\sigma$ as a pattern in permutations from $S_n$. We study the expected value (and $d$-th moments) of $N_{\sigma}$ on conjugacy…

We introduce an imperative, stack-based, and reversible computational model that characterizes Two-way Bijections both implicitly, concerning their computational complexity, and with zero-garbage.

A randomisation of the Berele insertion algorithm is proposed, where the insertion of a letter to a symplectic Young tableau leads to a distribution over the set of symplectic Young tableaux. Berele's algorithm provides a bijection between…

We look into the problem of stochastic resetting with refractory periods. The model dynamics comprises diffusive and motionless phases. The diffusive phase ends at random time instants, at which the system is reset to a given position --…

We will consider iteration of an analytic self-map $f$ of the unit ball in $\mathbb{C}^N$. Many facts were established about such dynamics in the 1-dimensional case (i.e. for self-maps of the unit disk), and we will generalize some of them…

This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers $(d,L)$, we construct a bijection between permutations that avoid the patterns $d\cdots 1…

Recently, Blecher and Knopfmacher explored the notion of fixed points in integer partitions. Here, we distinguish partitions with a fixed point by which value is fixed and analyze the resulting triangle of integers. In particular, we…

Stochastic point processes with refractoriness appear frequently in the quantitative analysis of physical and biological systems, such as the generation of action potentials by nerve cells, the release and reuptake of vesicles at a synapse,…

We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…

We study the time taken by a language learner to correctly identify the meaning of all words in a lexicon under conditions where many plausible meanings can be inferred whenever a word is uttered. We show that the most basic form of…

A bijection is defined from Littlewood-Richardson tableaux to rigged configurations. It is shown that this map preserves the appropriate statistics, thereby proving a quasi-particle expression for the generalized Kostka polynomials, which…