Related papers: Riffle shuffles with biased cuts
Since the seminal work of Sinai one studies chaotic properties of planar billiards tables. Among them is the study of decay of correlations for these tables. There are examples in the literature of tables with exponential and even…
In this paper, we use the eigenvalues of the random to random card shuffle to prove a sharp upper bound for the total variation mixing time. Combined with the lower bound due to Subag, we prove that this walk exhibits cutoff at $\frac{3}{4}…
We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…
The adjoint action of a finite group of Lie type on its Lie algebra is studied. A simple formula is conjectured for the number of split semisimple orbits of a given genus. This conjecture is proved for type A, and partial results are…
Many features of classical Lie theory generalize to the broader context of algebras over Hopf operads. However, this idea remains largely to be developed systematically. Quasi-shuffle algebras provide for example an interesting illustration…
The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham. In the same paper, its eigenvalues and stationary distributions for some classes of graphs are identified. We further study…
We consider systems of "pinned balls," i.e., balls that have fixed positions and pseudo-velocities. Pseudo-velocities change according to the same rules as those for velocities of totally elastic collisions between moving balls. The times…
We give a beautiful explicit example of a convex plane curve such that the outer billiard has a given finite number of invariant curves. Moreover, the dynamics on these curves is a standard shift. This example can be considered as an outer…
We investigate the regularity of invariant curves of rotation number $1/2$ for a special class of symplectic twist maps of the annulus, billiard maps. We construct strictly convex smooth tables close to the circle having singular (i.e. not…
External magnetic field profiles leading to equidistant and partially equidistant bilayer graphene spectra within the tight-binding model are obtained. This is achieved by implementing the integral and differential versions of the…
The quasi-shuffle product and mixable shuffle product are both generalizations of the shuffle product and have both been studied quite extensively recently. We relate these two generalizations and realize quasi-shuffle product algebras as…
We consider the issue of the slice invariance of refined topological string amplitudes, which means that they are independent of the choice of the preferred direction of the refined topological vertex. We work out two examples. The first…
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…
We unify and extend previous bijections on plane quadrangulations to bipartite and quasibipartite plane maps. Starting from a bipartite plane map with a distinguished edge and two distinguished corners (in the same face or in two different…
In this article we study a small random perturbation of a linear recurrence equation. If all the roots of its corresponding characteristic equation have modulus strictly less than one, the random linear recurrence goes exponentially fast to…
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…
We give shuffle algebra realization of positive part of quantum affine superalgebra $U_{v}(\widehat{\mathfrak{D}}(2,1;\theta))$ associated to any simple root systems. We also determine the shuffle algebra associated to…
Consider the Aldous--Pitman fragmentation process [Ann Probab, 26(4):1703--1726, 1998] of a Brownian continuum random tree ${\cal T}^{\mathrm{br}}$. The associated cut tree cut$({\cal T}^{\mathrm{br}})$, introduced by Bertoin and Miermont…
We propose a modification to the random destruction of graphs: Given a finite network with a distinguished set of sources and targets, remove (cut) vertices at random, discarding components that do not contain a source node. We investigate…
In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…