Related papers: Determinantal Formula for Generalized Riffle Shuff…
Let $H$ be a linear algebraic group over an algebraically closed field of characteristic $p>0$. We prove that any "exponential map" for $H$ induces a bijection between the variety of $r$-tuples of commuting $[p]$-nilpotent elements in…
We discuss the generalization of the connection between the determinant of an operator entering a quadratic form and the associated Gaussian path-integral valid for grassmann variables to the paragrassmann case [$\theta^{p+1}=0$ with $p=1$…
In this paper we describe a general method to derive formulas relating the gap probability of some classical determinantal random point process (Airy, Pearcey and Hermite) with the gap probability of the processes related to the same…
In this paper, we generalise the formula for the fourth moment of a random determinant to account for entries with asymmetric distribution. We also derive the second moment of a random Gram determinant.
Using earlier results we prove a formula for the number $W_{(n,k)}$ of 2-stack sortable permutations of length $n$ with $k$ runs, or in other words, $k-1$ descents. This formula will yield the suprising fact that there are as many 2-stack…
This note provides formula for determinant and inverse of r-circulant matrices with general sequences of third order. In other words, the study combines many papers in the literature.
Under binary matrices we mean matrices whose entries take one of two values. In this paper, explicit formulae for calculating the determinant of some type of binary Toeplitz matrices are obtained. Examples of the application of the…
This paper is about the study of F-transforms based on overlap and grouping maps, residual and co-residual implicator over complete lattice from both constructive and axiomatic approaches. Further, the duality, basic properties, and the…
The classification of flag-transitive generalised quadrangles is a long-standing open problem at the interface of finite geometry and permutation group theory. Given that all known flag-transitive generalised quadrangles are also…
We prove central limit theorems for the number of descents and the number of inversions after a shelf-shuffle. In particular, we bound the convergence rate for the number of inversions independently of the number of shelves. Along the way,…
A randomly perturbed graph $G^p = G_\alpha \cup G(n,p)$ is obtained by taking a deterministic $n$-vertex graph $G_\alpha = (V, E)$ with minimum degree $\delta(G)\geq \alpha n$ and adding the edges of the binomial random graph $G(n,p)$…
We present an LLT-type formula for a general power of the nabla operator applied to the Cauchy product for the modified Macdonald polynomials, and use it to deduce a new proof of the generalized shuffle theorem describing $\nabla^k e_n$,…
We consider a random walk of $n$ steps starting at $x_0=0$ with a double exponential (Laplace) jump distribution. We compute exactly the distribution $p_{k,n}(\Delta)$ of the gap $d_{k,n}$ between the $k^{\rm th}$ and $(k+1)^{\rm th}$…
Within the Hamiltonian formulation of Lattice gauge theories, prepotentials, belonging to the fundamental representation of the gauge group and defined locally at each site of the lattice, enables us to construct local loop operators and…
We investigate the dynamics of a generalized survival probability $S(t,R)$ defined with respect to an arbitrary reference level $R$ (rather than the average) in equilibrium step fluctuations. The exponential decay at large time scales of…
In this paper, the association scheme defined on the flags of a finite generalized quadrangle is considered. All possible fusions of this scheme are listed, and a full description for those of classes 2 and 3 is given. Furthermore, it is…
This paper provides a unifying view of a wide range of problems of interest in machine learning by framing them as the minimization of functionals defined on the space of probability measures. In particular, we show that generative…
The escape probability $\xi_{x}$ from a site $x$ of a one-dimensional disordered lattice with trapping is treated as a discrete dynamical evolution by random iterations over nonlinear maps parametrized by the right and left jump…
A standard Gelfand-Tsetlin pattern of depth $n$ is a configuration of particles in $\{1,...,n\} \times \R$. For each $r \in \{1,...,n\}$, $\{r\} \times \R$ is referred to as the $r^\text{th}$ level of the pattern. A standard Gelfand-Tsetlin…
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…