Related papers: A fast elementary algorithm for computing the dete…
Numeric modeling of electromagnetics and acoustics frequently entails matrix-vector multiplication with block Toeplitz structure. When the corresponding block Toeplitz matrix is not highly sparse, e.g. when considering the electromagnetic…
Let $\mathcal{S}$ denote the class of analytic and univalent functions in $\mathbb{D}:=\{z\in\mathbb{C}:\, |z|<1\}$ of the form $f(z)= z+\sum_{n=2}^{\infty}a_n z^n$. In this paper, we determine sharp estimates for the Toeplitz determinants…
In this paper we derive a Toeplitz-structured closed form of the unique positive semi-definite stabilizing solution for the discrete-time algebraic Riccati equations, especially for the case that the state matrix is not stable. Based on the…
Many applications, including rank aggregation and crowd-labeling, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and columns. We consider the problem of estimating such a matrix based on…
We present a very fast algorithm for general matrix factorization of a data matrix for use in the statistical analysis of high-dimensional data via latent factors. Such data are prevalent across many application areas and generate an…
The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…
We study the limiting behavior of $\Tr U^{k(n)}$, where $U$ is a $n\times n$ random unitary matrix and $k(n)$ is a natural number that may vary with $n$ in an arbitrary way. Our analysis is based on the connection with Toeplitz…
We present a simple and convenient analytical formula for efficient exact computation of the hafnian of Toeplitz matrices of a special type. An interpretation of the obtained results is given in the language of perfect matchings and Bessel…
We present a new technique for computing Hilbert series of N=1 supersymmetric QCD in four dimensions with unitary and special unitary gauge groups. We show that the Hilbert series of this theory can be written in terms of determinants of…
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the…
Factorization of compact wavelet matrices into primitive ones has been known for more than 20 years. This method makes it possible to generate wavelet matrix coefficients and also to specify them by their first row. Recently, a new…
We describe an efficient algorithm to compute finite type invariants of type $k$ by first creating, for a given knot $K$ with $n$ crossings, a look-up table for all subdiagrams of $K$ of size $\lceil \frac{k}{2}\rceil$ indexed by dyadic…
Orthogonal systems in $\mathrm{L}_2(\mathbb{R})$, once implemented in spectral methods, enjoy a number of important advantages if their differentiation matrix is skew-symmetric and highly structured. Such systems, where the differentiation…
A quantum algorithm for computing the determinant of a unitary matrix $U\in U(N)$ is given. The algorithm requires no preparation of eigenstates of $U$ and estimates the phase of the determinant to $t$ binary digits accuracy with…
This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highly-dynamic setting, in which *arbitrarily many* edge changes may occur in each round. Our algorithm significantly improves upon prior work in…
Symmetric submodular maximization is an important class of combinatorial optimization problems, including MAX-CUT on graphs and hyper-graphs. The state-of-the-art algorithm for the problem over general constraints has an approximation ratio…
In this paper we evaluate some Toeplitz-type determinants. Let $n>1$ be an integer. We prove the following two basic identities: \begin{align*} \det{[j-k+\delta_{jk}]_{1\leq j,k\leq n}}&=1+\frac{n^2(n^2-1)}{12}, \\…
Unlike Toeplitz operators on $H^2$, truncated Toeplitz operators do not have a natural matricial characterization. Consequently, these operators are difficult to study numerically. In this note we provide criteria for a matrix with distinct…
We introduce a novel algorithm for approximating the logarithm of the determinant of a symmetric positive definite (SPD) matrix. The algorithm is randomized and approximates the traces of a small number of matrix powers of a specially…
We give a quantum-inspired $O(n^4)$ algorithm computing the Tutte polynomial of a lattice path matroid, where $n$ is the size of the ground set of the matroid. Furthermore, this can be improved to $O(n^2)$ arithmetic operations if we…