Related papers: Weight distribution of random linear codes and Kra…

We study the distribution of cycle lengths in models of nonuniform random permutations with cycle weights. We identify several regimes. Depending on the weights, the length of typical cycles grows like the total number $n$ of elements, or a…

The Keating-Snaith central limit theorem proves that $\Lambda_N(A)=\log\det(I-A)$, for randomly drawn $A\in \operatorname{U}(N)$, suitably normalised, tends to a complex Gaussian random variable in the large $N$ limit. The deviations of the…

We investigate the joint moments of the 2k-th power of the characteristic polynomial of random unitary matrices with the 2h-th power of the derivative of this same polynomial. We prove that for a fixed h, the moments are given by rational…

We consider random orthonormal polynomials $$ F_{n}(x)=\sum_{i=0}^{n}\xi_{i}p_{i}(x), $$ where $\xi_{0}$, \dots, $\xi_{n}$ are independent random variables with zero mean, unit variance and uniformly bounded $(2+\ep)$ moments, and…

Let $x_1,\ldots ,x_N$ be independent random points distributed according to an isotropic log-concave measure $\mu $ on ${\mathbb R}^n$, and consider the random polytope $$K_N:={\rm conv}\{ \pm x_1,\ldots ,\pm x_N\}.$$ We provide sharp…

It was recently shown that RGHW (relative generalized Hamming weight) exactly expresses the security of linear ramp secret sharing scheme. In this paper we determine the true value of the asymptotic metric for RGHW previously proposed by…

Let $\{X_i\}$ be a sequence of independent identically distributed random variables with an intermediate regularly varying (IR) right tail $\bar{F}$. Let $(N, C_1, ..., C_N)$ be a nonnegative random vector independent of the $\{X_i\}$ with…

Every k entries in a permutation can have one of k! different relative orders, called patterns. How many times does each pattern occur in a large random permutation of size n? The distribution of this k!-dimensional vector of pattern…

We establish sufficient conditions for the asymptotic normality of kernel density estimators, applied to causal linear random fields. Our conditions on the coefficients of linear random fields are weaker than known results, although our…

We develop an algorithm for computing the weight distribution of a linear $[n,k]$ code over a finite field $\mathbb{F}_q$. We represent the codes by their characteristic vector with respect to a given generator matrix and a special type of…

We discuss polynomials orthogonal with respect to a semi-classical generalised higher order Freud weight \[\omega(x;t,\lambda)=|x|^{2\lambda+1}\exp\left(tx^2-x^{2m}\right),\qquad x\in\mathbb{R},\] with parameters $\lambda > -1$,…

In this paper, based on the theory of defining sets, two classes of at most six-weight linear codes over $\mathbb{F}_p$ are constructed. The weight distributions of the linear codes are determined by means of Gaussian period and Weil sums.…

Krawtchouk's polynomials occur classically as orthogonal polynomials with respect to the binomial distribution. They may be also expressed in the form of matrices, that emerge as arrays of the values that the polynomials take. The algebraic…

A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…

We present a simple technique to compute moments of derivatives of unitary characteristic polynomials. The first part of the technique relies on an idea of Bump and Gamburd: it uses orthonormality of Schur functions over unitary groups to…

We investigate determinants of random unitary pencils (with scalar or matrix coefficients), which generalize the characteristic polynomial of a single unitary matrix. In particular we examine moments of such determinants, obtained by…

We consider the problem of estimating the support size of a discrete distribution whose minimum non-zero mass is at least $ \frac{1}{k}$. Under the independent sampling model, we show that the sample complexity, i.e., the minimal sample…

We give asymptotic formulae for random matrix averages of derivatives of characteristic polynomials over the groups USp(2N), SO(2N) and O^-(2N). These averages are used to predict the asymptotic formulae for moments of derivatives of…

We consider the logarithm of the central value $\log L(1/2)$ in the orthogonal family ${L(s,f)}_{f \in H_k}$ where $H_k$ is the set of weight $k$ Hecke-eigen cusp form for $SL_2(\mathbb{Z})$, and in the symplectic family…

Classically, a single weight on an interval of the real line leads to moments, orthogonal polynomials and tridiagonal matrices. Appropriately deforming this weight with times t=(t_1,t_2,...), leads to the standard Toda lattice and…