Related papers: Riffle shuffles with biased cuts
We study biased Maker-Breaker positional games between two players, one of whom is playing randomly against an opponent with an optimal strategy. In this work we focus on the case of Breaker playing randomly and Maker being "clever". The…
In this paper we study an experimentally-observed connection between two seemingly unrelated processes, one from computational geometry and the other from differential geometry. The first one (which we call "grid peeling") is the…
We introduce an arbitrary order, computationally efficient method to smooth corners on curves in the plane, as well as edges and vertices on surfaces in $\mathbb R^3$. The method is local, only modifying the original surface in a…
We study mixing times of the one-sided $k$-transposition shuffle. We prove that this shuffle mixes relatively slowly, even for $k$ big. Using the recent "lifting eigenvectors" technique of Dieker and Saliola and applying the $\ell^2$ bound,…
We construct families of two-dimensional Sinai billiards whose transfer operators have Ruelle resonances arbitrarily close to 1. Our method involves taking a large enough cover of an initial billiard table, and relating the transfer…
We study quasisymmetric maps, which act on the boundary of the hyperbolic plane, by looking at their action on the Farey triangulation. Our main results identify exactly which quasisymmetric maps correspond to pinched lambda lengths in…
For the class of differentiable maps of the plane and, in particular, for standard-like maps (McMillan form), a simple relation is shown between the directions of the local invariant manifolds of a generic point and its contribution to the…
In card games, in casino games with multiple decks of cards and in cryptography, one is sometimes faced with the following problem: how can a human (as opposed to a computer) shuffle a large deck of cards? The procedure we study is to break…
Linear regression with shuffled labels and with a noisy latent design matrix arises in many correspondence recovery problems. We propose a total least-squares approach to the problem of estimating the underlying true permutation and provide…
The paper establishes the property of splittability of billiard boundary sequences in n dimensional cube into subsequences of fractional parts. This reveals a new property of integrable and weak perturbated Hamilton systems: under a simple…
The overhand shuffle is one of the ``real'' card shuffling methods in the sense that some people actually use it to mix a deck of cards. A mathematical model was constructed and analyzed by Pemantle [J. Theoret. Probab. 2 (1989) 37--49] who…
Twisted bilayer graphene exhibits isolated, relatively flat electronic bands near charge neutrality when the interlayer rotation is tuned to specific magic angles. These small misalignments, typically below 1.1{\deg}, result in long-period…
Given a semisimple element in the loop Lie algebra of a reductive group, we construct a quasi-coherent sheaf on a partial resolution of the trigonometric commuting variety of the Langlands dual group. The construction uses affine Springer…
We investigate the appearance of the square of a Hamilton cycle in the model of randomly perturbed graphs, which is, for a given $\alpha \in (0,1)$, the union of any $n$-vertex graph with minimum degree $\alpha n$ and the binomial random…
We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…
This is the first of two parts of a project devoted to a geometric interpretation of the Deligne-Terasoma approach to regularized double shuffle relations. The central fact of this approach is the isomorphism between vanishing cycles of…
We investigate the twisted bilayer graphene by a two-orbital Hubbard model on the honeycomb lattice. The model is studied near 1/4 band filling by using the singular-mode functional renormalization group theory. Spin-triplet $f$-wave…
Standard perfect shuffles involve splitting a deck of $2n$ cards into two stacks and interlacing the cards from the stacks. There are two ways that this interlacing can be done, commonly referred to as an in shuffle and an out shuffle,…
In this thesis the properties of two kinds of non-uniform random recursive trees are studied. In the first model weights are assigned to each node, thus altering the attachment probabilities. We will call these trees weighted recursive…
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…