Related papers: Hankel determinants of a Sturmian sequence
I study Hankel determinants of a class of sequences which can be interpreted as generalizations of the Catalan numbers and the central binomial coefficients. They follow a modular pattern with a frequent appearance of zeroes, so that the…
Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…
The paper contains an exposition of recent as well as old enough results on determinantal random point fields. We start with some general theorems including the proofs of the necessary and sufficient condition for the existence of the…
Generalizing the notion of the boundary sequence introduced by Chen and Wen, the $n$th term of the $\ell$-boundary sequence of an infinite word is the finite set of pairs $(u,v)$ of prefixes and suffixes of length $\ell$ appearing in…
The middle binomial coefficients can be interpreted as numbers of Motzkin paths which have no horizontal steps at positive heights. Assigning suitable weights gives some nice polynomial extensions. We determine the Hankel determinants and…
We examine relationships between two minors of order n of some matrices of n rows and n+r columns. This is done through a class of determinants, here called $n$-determinants, the investigation of which is our objective. We prove that…
The Hankel determinant $H_{2,1}(F_{f^{-1}}/2)$ of logarithmic coefficients is defined as: \begin{align*} H_{2,1}(F_{f^{-1}}/2):= \begin{vmatrix} \Gamma_1 & \Gamma_2 \Gamma_2 & \Gamma_3 \end{vmatrix}=\Gamma_1\Gamma_3-\Gamma^2_2, \end{align*}…
In the paper, we give the recurrent equations of the Hankel determinants of the Cantor sequence, and show that the Hankel determinants as a double sequence is 3-automatic. With the help of the Hankel determinants, we prove that the…
Two closely related discrete probability distributions are introduced. In each case the support is a set of vectors in $\mathbb{R}^n$ obtained from the partitions of the fixed positive integer $n$. These distributions arise naturally when…
In this paper, we introduce and develop the notion of spanning of integers along functions $f:\mathbb{N}\longrightarrow \mathbb{R}$. We apply this method to a class of problems that requires to determine if the equations of the form…
This paper describes the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which can be viewed as a waiting time to discover all the factors of length $n$ of the Sturmian…
We obtain asymptotics in n for the n-dimensional Hankel determinant whose symbol is the Gaussian multiplied by a step-like function. We use Riemann-Hilbert analysis of the related system of orthogonal polynomials to obtain our results.
We summarize significant classical results on (in)determinacy of measures in terms of their finite positive integer order moments. Well-known is the role of the smallest eigenvalues of Hankel matrices, starting from Hamburger's results a…
We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying iterations of a unimodal continuous map from the unit interval into itself, but it also characterizes univoque real…
Hermitian positive definite, totally positive, and nonsingular M-matrices enjoy many common properties, in particular: (A) positivity of all principal minors, (B) weak sign symmetry, (C) eigenvalue monotonicity, (D) positive stability. The…
In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…
The Hankel determinants $\left(\frac{r}{2(i+j)+r}\binom{2(i+j)+r}{i+j}\right)_{0\leq i,j \leq n-1}$ of the convolution powers of Catalan numbers were considered by Cigler and by Cigler and Krattenthaler. We evaluate these determinants for…
Given $R \subseteq \mathbb{N}$ let ${n \brace k}_R$, ${n \brack k}_R$, and $L(n,k)_R$ be the number of ways of partitioning the set $[n]$ into $k$ non-empty subsets, cycles and lists, respectively, with each block having cardinality in $R$.…
As well as arising naturally in the study of non-intersecting random paths, random spanning trees, and eigenvalues of random matrices, determinantal point processes (sometimes also called fermionic point processes) are relatively easy to…
Some Wiener--Hopf determinants on [0,s] are calculated explicitly for all s>0. Their symbols are zero on an interval and they are related to the determinant with the sine-kernel appearing in the random matrix theory. The determinants are…