Related papers: Random Words, Toeplitz Determinants and Integrable…
We introduce a two-parameter family of birational maps, which reduces to a family previously found by Demskoi, Tran, van der Kamp and Quispel (DTKQ) when one of the parameters is set to zero. The study of the singularity confinement pattern…
A higher dimensional analogue of the dispersionless KP hierarchy is introduced. In addition to the two-dimensional ``phase space'' variables $(k,x)$ of the dispersionless KP hierarchy, this hierarchy has extra spatial dimensions…
We apply a discrete version of the methodology in \cite{gauss} to obtain a recursive asymptotic expansion for $\esp[h(W)]$ in terms of Poisson expectations, where $W$ is a sum of independent integer-valued random variables and $h$ is a…
The Fourier-Bessel expansion of a function on a circular disc yields a simple series representation for the end-to-end probability distribution function w(R,phi) encountered in a planar persistent random walk, where the direction taken in a…
The \hbar-dependent KP hierarchy is a formulation of the KP hierarchy that depends on the Planck constant \hbar and reduces to the dispersionless KP hierarchy as \hbar -> 0. A recursive construction of its solutions on the basis of a…
This thesis deals with the geometric and integrable aspects associated with random matrix models. Its purpose is to provide various applications of random matrix theory, from algebraic geometry to partial differential equations of…
The Hirota-Miwa equation (also known as the discrete KP equation, or the octahedron recurrence) is a bilinear partial difference equation in three independent variables. It is integrable in the sense that it arises as the compatibility…
Gessel's famous Bessel determinant formula gives the generating function of the number of permutations without increasing subsequences of a given length. Ekhad and Zeilberger proposed the challenge of finding a suitable generalization for…
Distribution matching and dematching (DM/invDM) are key functions in probabilistic shaping (PS). Recently techniques for low complexity implementation of DM/invDM have been well studied. Our previously proposed hierarchical DM (HiDM) is one…
What is the connection of random matrices with integrable systems? Is this connection really useful? The answer to these questions leads to a new and unifying approach to the theory of random matrices. Introducing an appropriate time…
We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string. This algorithm is based on the Hunt-Szymanski algorithm,…
Extending the usual Ginzburg-Landau theory for the random-field Ising model, the possibility of dimensional reduction is reconsidered. A renormalization group for the probability distribution of magnetic impurities is applied. New…
We show that the generating series of some Hodge integrals involving one or two partitions are tau-functions of the KP hierarchy or the 2-Toda hierarchy respectively. We also formulate a conjecture on the connection between relative…
We compute the expansion of the cohomology class of the permutahedral variety in the basis of Schubert classes. The resulting structure constants $a_w$ are expressed as a sum of \emph{normalized} mixed Eulerian numbers indexed naturally by…
Recursive list decoding is considered for Reed-Muller (RM) codes. The algorithm repeatedly relegates itself to the shorter RM codes by recalculating the posterior probabilities of their symbols. Intermediate decodings are only performed…
For a sample of Exponentially distributed durations we aim at point estimation and a confidence interval for its parameter. A duration is only observed if it has ended within a certain time interval, determined by a Uniform distribution.…
We report some properties of heavy-tailed Sibuya-like distributions related to thinning, self-decomposability and branching processes. Extension of the thinning operation of on-negative integer-valued random variables to scaling by…
We investigate the role of continuous reductions and continuous relativisation in the context of higher randomness. We define a higher analogue of Turing reducibility and show that it interacts well with higher randomness, for example with…
This work aims at solving the problems with intractable sparsity-inducing norms that are often encountered in various machine learning tasks, such as multi-task learning, subspace clustering, feature selection, robust principal component…
We study the distributional behavior of additive arithmetic functions evaluated at integers drawn from the harmonic distribution. Our main result shows that a broad family of such functions converges in law to conditioned Dickman-type…