Related papers: An Asymptotic Determinant Bound on 0-1 Matrices wi…
We provide non-asymptotic bounds for first and higher order inclusion probabilities of the rejective sampling model with various size parameters. Further we derive bounds in the semi-definite ordering for matrices that collect (conditional)…
In this paper, we consider classes of decision tables with 0-1-decisions closed relative to removal of attributes (columns) and changing decisions assigned to rows. For tables from an arbitrary closed class, we study the dependence of the…
Motivated by fast matrix multiplication and recent connections between asymptotic tensor rank and fine-grained complexity, we revisit classical tools from the matrix multiplication literature and develop a framework for obtaining improved…
Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…
In this paper, we give an alternative proof for the asymptotic stability of solitons for nonlinear Schr\"odinger equations with internal modes. The novel idea is to use "refined profiles" developed by the authors for the analysis of small…
Identification-robust hypothesis tests are commonly based on the continuous updating GMM objective function. When the number of moment conditions grows proportionally with the sample size, the large-dimensional weighting matrix prohibits…
We obtain asymptotics of large Hankel determinants whose weight depends on a one-cut regular potential and any number of Fisher-Hartwig singularities. This generalises two results: 1) a result of Berestycki, Webb and Wong [5] for root-type…
Permanents of random matrices with independent and identically distributed (i.i.d.) entries have extensively studied in literature and convergence and concentration properties are known under varying assumptions on the distributions. In…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
A central tool in the study of nonhomogeneous random matrices, the noncommutative Khintchine inequality, yields a nonasymptotic bound on the spectral norm of general Gaussian random matrices $X=\sum_i g_i A_i$ where $g_i$ are independent…
We give a method for taking microscopic limits of normal matrix ensembles. We apply this method to study the behaviour near certain types of singular points on the boundary of the droplet. Our investigation includes ensembles without…
The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…
We work out a generalization of the Szeg\"o limit theorems on the determinant of large matrices. We focus on matrices with nonzero leading principal minors and elements that decay to zero exponentially fast with the distance from the main…
In this paper, we prove a local limit theorem and a refined continuity correction for the negative binomial distribution. We present two applications of the results. First, we find the asymptotics of the median for a…
This paper presents a Cramer-Rao bound (CRB) for the estimation of parameters confined to an arbitrary set. Unlike existing results that rely on equality or inequality constraints, manifold structures, or the nonsingularity of the Fisher…
We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We…
Central limit theorems are established for the sum, over a spatial region, of observations from a linear process on a $d$-dimensional lattice. This region need not be rectangular, but can be irregularly-shaped. Separate results are…
Hyperasymptotics is an analytical method that incorporates exponentially small contributions into asymptotic approximations, thereby expanding their domain of validity, improving accuracy, and providing deeper insight into the underlying…
A recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, states that the maximum of the permanent of a matrix whose rows are unit vectors in l_p is attained either for the identity matrix I or for a constant…
We represent the number of mxn non-negative integer matrices (contingency tables) with prescribed row sums and column sums as the expected value of the permanent of a non-negative random matrix with exponentially distributed entries. We…