Related papers: Determinantal Formula for Generalized Riffle Shuff…
Walks in the plane taking unit-length steps north and east from $(0,0)$ to $(n,n)$ never dropping below $y=x$ and parking cars subject to preferences are two intriguing ingredients in a formula conjectured in 2005, now famously known as the…
We develop a unified method to study spectral determinants for several different manifolds, including spheres and hemispheres, and projective spaces. This is a direct consequence of an approach based on deriving recursion relations for the…
In this note, we define the numbers of level crossings by a c{\`a}dl{\`a}g (RCLL) real function $x: [0,+\infty) \rightarrow R$ and, in analogy to the work of Bertoin and Yor [BY14] we prove that for $x$ with locally finite total variation…
The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation…
We investigate how the choice of spatial point process for generating random sampling patterns affects the numerical stability of non-uniform generalized sampling between Fourier bases and Daubechies scaling functions. Specifically, we…
We study the transition probabilities for the totally asymmetric simple exclusion process (TASEP) on the infinite integer lattice with a finite, but arbitrary number of first and second class particles. Using the Bethe ansatz we present an…
We analyse the forward error in the floating point summation of real numbers, from algorithms that do not require recourse to higher precision or better hardware. We derive informative explicit expressions, and new deterministic and…
Though parameter shift rules have drastically improved gradient estimation methods for several types of quantum circuits, leading to improved performance in downstream tasks, so far they have not been transferable to linear optics with…
A (global) determinantal representation of hypersurface in P^n is a matrix, whose entries are linear forms in homogeneous coordinates and whose determinant defines the hypersurface. We study the properties of such representations for…
We study an example of a {\em hit-and-run} random walk on the symmetric group $\mathbf S_n$. Our starting point is the well understood {\em top-to-random} shuffle. In the hit-and-run version, at each {\em single step}, after picking the…
We prove that the enumerative polynomials of generalized Stirling permutations by the statistics of plateaux, descents and ascents are partial $\gamma$-positive. Specialization of our result to the Jacobi-Stirling permutations confirms a…
The commuting probability of a finite group $G$ is the probability that two randomly chosen elements commute. Let $S\subseteq(0,1]$ denote the set of all possible commuting probabilities of finite groups. We prove that $S\cup\{0\}$ is…
We obtain an explicit determinantal formula for the multiplicity of any point on a classical Schubert variety.
Let $(P,\preceq)$ be a lattice and $f$ a complex-valued function on $P$. We define meet and join matrices on two arbitrary subsets $X$ and $Y$ of $P$ by $(X,Y)_f=(f(x_i\wedge y_j))$ and $[X,Y]_f=(f(x_i\vee x_j))$ respectively. Here we…
We define the notion of a parahoric group scheme $\mathcal G$ over a smooth projective curve, and formulate four conjectures on the structure of the stack of $\mathcal G$-bundles, which generalize to this case well-known results on…
Following the recent proposal made by Bouttier et al [Phys. Rev. E 76, 041140 (2007)], we study analytically the mobility properties of a single vacancy in the close-packed dimer model on the square lattice. Using the spanning web…
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$…
For an arbitrary finite permutation group $G$, subgroup of the symmetric group $S_\ell$, we determine the permutations involving only members of $G$ as $\ell$-patterns, i.e., avoiding all patterns in the set $S_\ell \setminus G$. The set of…
Recently Wilson [Ann. Appl. Probab. 14 (2004) 274--325] introduced an important new technique for lower bounding the mixing time of a Markov chain. In this paper we extend Wilson's technique to find lower bounds of the correct order for…
We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a…