相关论文: The shuffle conjecture

The complexity and decidability of various decision problems involving the shuffle operation are studied. The following three problems are all shown to be $NP$-complete: given a nondeterministic finite automaton (NFA) $M$, and two words $u$…

We introduce parking assortments, a generalization of parking functions with cars of assorted lengths. In this setting, there are $n\in\mathbb{N}$ cars of lengths $\mathbf{y}=(y_1,y_2,\ldots,y_n)\in\mathbb{N}^n$ entering a one-way street…

A continuous-time random walk in the quarter plane with homogeneous transition rates is considered. Given a non-negative reward function on the state space, we are interested in the expected stationary performance. Since a direct derivation…

We initiate the study of the Macdonald intersection polynomials $\operatorname{I}_{\mu^{(1)},\dots,\mu^{(k)}}[X;q,t]$, which are indexed by $k$-tuples of partitions $\mu^{(1)},\dots,\mu^{(k)}$. These polynomials are conjectured to be equal…

Consider $n$ cars $C_1, C_2, \ldots, C_n$ that want to park in a parking lot with parking spaces $1,2,\ldots,n$ that appear in order. Each car $C_i$ has a parking preference $\alpha_i \in \{1,2,\ldots,n\}$. The cars appear in order, if…

We conjecture a formula for the symmetric function $\frac{[n-k]_t}{[n]_t}\Delta_{h_m}\Delta_{e_{n-k}}\omega(p_n)$ in terms of decorated partially labelled square paths. This can be seen as a generalization of the square conjecture of Loehr…

It is one of the main properties of uniformly hyperbolic dynamics that points of two distinct trajectories cannot be uniformly close one to another. This characteristics of hyperbolic dynamics is called expansivity. Hirsch, Pugh and Shub,…

We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $\epsilon$-close to those of simple random walk. We assume that the environment is balanced in one fixed…

The purpose of this note is to collect in one place a few results about simple random walk and Brownian motion which are often useful. These include standard results such as Beurling estimates, large deviation estimates, and a method for…

Collatz Conjecture is one of the most famous, for its simple form, proposed more than eighty years ago. This paper presents a full attempt to prove the affirmative answer to the question proposed by the conjecture. In the first section, we…

We consider a generalized riffle shuffle on the colored permutation group $G_{p, n}$ and derive a determinantal formula for the probability of finding descents at given positions, proof of which is based on the bijection between the set of…

Type A affine shuffles are compared with riffle shuffles followed by a cut. Although these probability measures on the symmetric group S_n are different, they both satisfy a convolution property. Strong evidence is given that when the…

The mathematics of shuffling a deck of $2n$ cards with two "perfect shuffles" was brought into clarity by Diaconis, Graham and Kantor. Here we consider a generalisation of this problem, with a so-called "many handed dealer" shuffling $kn$…

This paper studies statistics of riffle shuffles by relating them to random word statistics with the use of inverse shuffles. Asymptotic normality of the number of descents and inversions in riffle shuffles with convergence rates of order…

Two sets $A$ and $B$ of points in the plane are \emph{mutually avoiding} if no line generated by any two points in $A$ intersects the convex hull of $B$, and vice versa. In 1994, Aronov, Erd\H os, Goddard, Kleitman, Klugerman, Pach, and…

A new formula for the probability that a standard Brownian motion stays between two linear boundaries is proved. A simple algorithm is deduced. Uniform precision estimates are computed. Different implementations have been made available…

We consider one-dimensional random walks in random environment which are transient to the right. Our main interest is in the study of the sub-ballistic regime, where at time $n$ the particle is typically at a distance of order $O(n^\kappa)$…

Pick $n$ points $Z_0,...,Z_{n-1}$ uniformly and independently at random in a compact convex set $H$ with non empty interior of the plane, and let $Q^n_H$ be the probability that the $Z_i$'s are the vertices of a convex polygon. Blaschke…

We introduce a new type of card shuffle called one-sided transpositions. At each step a card is chosen uniformly from the pack and then transposed with another card chosen uniformly from below it. This defines a random walk on the symmetric…

A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…