Related papers: An Asymptotic Determinant Bound on 0-1 Matrices wi…
We consider the set Sigma(R,C) of all mxn matrices having 0-1 entries and prescribed row sums R=(r_1, ..., r_m) and column sums C=(c_1, ..., c_n). We prove an asymptotic estimate for the cardinality |Sigma(R, C)| via the solution to a…
The determinant of an $N \times N$ circulant matrix $M = {\rm CIRC}[x_0, x_1, ..., x_{N-1}$] can be expanded in the form det$ ~M= \sum C_{a_0 a_1 ...a_{N-1}} x_{a_0} x_{a_1}...x_{a_{N-1}}$. By using the generating function of a restricted,…
The determinants of $\{\pm 1\}$-matrices are calculated by via the oriented hypergraphic Laplacian and summing over an incidence generalization of vertex cycle-covers. These cycle-covers are signed and partitioned into families based on…
We outline an approach recently used to prove formulae for the multiplicative constants in the asymptotics for the sine-kernel and Airy-kernel determinants appearing in random matrix theory and related areas.
Uniform asymptotic expansions are derived for the zeros of the reverse generalized Bessel polynomials of large degree $n$ and real parameter $a$. It is assumed that $-\Delta_{1} n+\frac{3}{2} \leq a \leq \Delta_{2} n$ for fixed arbitrary…
We consider an inverse problem for Schr\"odinger operators on connected equilateral graphs with standard matching conditions. We calculate the spectral determinant and prove that the asymptotic distribution of a subset of its zeros can be…
This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented,…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
We obtain nonasymptotic bounds on the spectral norm of random matrices with independent entries that improve significantly on earlier results. If $X$ is the $n\times n$ symmetric matrix with $X_{ij}\sim N(0,b_{ij}^2)$, we show that…
We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a random walk on an expander, confirming a conjecture due to Wigderson and Xiao. Our proof is based on a new multi-matrix extension of the Golden-Thompson…
A general method is presented for deriving the limiting behavior of estimators that are defined as the values of parameters optimizing an empirical criterion function. The asymptotic behavior of such estimators is typically deduced from…
New lower bounds involving sum, difference, product, and ratio sets for a set $A\subset \C$ are given. The estimates involving the sum set match, up to constants, the one obtained by Solymosi for the reals and are obtained by generalising…
We derive error bounds for CUR matrix approximation using determinant-based methods that relate local projection errors to global approximation quality. For general matrices, we establish determinant identities for bordered Gramian matrices…
This work considers normalized inverse determinant sums as a tool for analyzing the performance of division algebra based space-time codes for multiple antenna wireless systems. A general union bound based code design criterion is obtained…
The purpose of this paper is to describe asymptotic formulas for determinants of certain operators that are analogues of Wiener-Hopf operators. The determinant formulas yield information about the distribution functions for certain random…
Asymptotic solutions are derived for inhomogeneous differential equations having a large real or complex parameter and a simple turning point. They involve Scorer functions and three slowly varying analytic coefficient functions. The…
We introduce and study isomonodromy transformations of the matrix linear difference equation Y(z+1)=A(z)Y(z) with polynomial (or rational) A(z). Our main result is a construction of an isomonodromy action of Z^{m(n+1)-1} on the space of…
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
We introduce determinantal sieving, a new, remarkably powerful tool in the toolbox of algebraic FPT algorithms. Given a polynomial $P(X)$ on a set of variables $X=\{x_1,\ldots,x_n\}$ and a linear matroid $M=(X,\mathcal{I})$ of rank $k$,…
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…