Related papers: Certified Hermite Matrices from Approximate Roots
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
For a given computational problem, a certificate is a piece of data that one (the prover) attaches to the output with the aim of allowing efficient verification (by the verifier) that this output is correct. Here, we consider the minimal…
We investigate spectral conditions on Hermitian matrices of roots of unity. Our main results are conjecturally sharp upper bounds on the number of residue classes of the characteristic polynomial of such matrices modulo ideals generated by…
We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…
Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…
Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of matrix identities as hard instances for strong proof systems. A matrix identity of $d \times d$ matrices over a field $\mathbb{F}$, is a…
In this paper we give a first study of perfect copositive $n \times n$ matrices. They can be used to find rational certificates for completely positive matrices. We describe similarities and differences to classical perfect, positive…
In the present paper we give two alternate proofs of the well known theorem that the empirical distribution of the appropriately normalized roots of the $n^{th}$ monic Hermite polynomial $H_n$ converges weakly to the semicircle law, which…
Let $f_1,...,f_s \in \mathbb{K}[x_1,...,x_m]$ be a system of polynomials generating a zero-dimensional ideal $\I$, where $\mathbb{K}$ is an arbitrary algebraically closed field. We study the computation of "matrices of traces" for the…
In this paper, we give novel certificates for triangular equivalence and rank profiles. These certificates enable somebody to verify the row or column rank profiles or the whole rank profile matrix faster than recomputing them, with a…
Given a matrix $A$ with $n$ rows, a number $k<n$, and $0<\delta < 1$, $A$ is $(k,\delta)$-RIP (Restricted Isometry Property) if, for any vector $x \in \mathbb{R}^n$, with at most $k$ non-zero co-ordinates, $$(1-\delta) \|x\|_2 \leq \|A…
We describe a way to approximate the matrix elements of a real power $\alpha$ of a positive (for $\alpha \ge 0$) or non-negative (for $\alpha \in \mathbb{R}$), infinite, bounded, sparse and Hermitian matrix $W$. The approximation uses only…
Given a full column rank $M \in \Z^{\ell \times m}$ and an $F \in \Z^{n \times m}$ we present an algorithm to compute the $n \times n$ basis in Hermite form of the integer lattice comprised of all rows $p \in \Z^{1 \times n}$ such that $pF…
An algorithm to classify a general Hermitian matrix according to its signature (positive semi-definite, negative or indefinite) is presented. It builds on the Quantum Phase Estimation algorithm, which stores the sign of the eigenvalues of a…
Given a positive noncommutative polynomial $f$, equivalently a sum of Hermitian squares (SOHS), there exists a positive semidefinite Gram matrix that encrypts all the structural essence of $f$. There are no available methods for extending a…
We study the number of real zeros of finite combinations of $K+1$ consecutive normalized Hermite polynomials of the form $$ q_n(x)=\sum_{j=0}^K\gamma_j\tilde H_{n-j}(x),\quad n\ge K, $$ where $\gamma_j$, $j=0,\dots ,K$, are real numbers…
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F} \in \mathbb{K}[x]^{n \times n}$ over a field $\mathbb{K}$, we give a fast, deterministic algorithm for finding the Hermite normal form of $\mathbf{F}$ with complexity…
Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…
We propose an algorithm for producing Hermite-Pad\'e polynomials of type I for an arbitrary tuple of $m+1$ formal power series $[f_0,\dots,f_m]$, $m\geq1$, about $z=0$ ($f_j\in{\mathbb C}[[z]]$) under the assumption that the series have a…
In this paper, we give novel certificates for triangular equivalence and rank profiles. These certificates enable to verify the row or column rank profiles or the whole rank profile matrix faster than recomputing them, with a negligible…