Related papers: Certified Hermite Matrices from Approximate Roots
To cater to the needs of (Zero Knowledge) proofs for (mathematical) proofs, we describe a method to transform formal sentences in 2x2-matrices over multivariate polynomials with integer coefficients, such that usual proof-steps like…
We explore the consequences of an ideal I of real polynomials having a real radical initial ideal, both for the geometry of the real variety of I and as an application to sums of squares representations of polynomials. We show that if…
We study algorithms for approximating the permanent of a random matrix when the entries are slightly biased away from zero. This question is motivated by the goal of understanding the classical complexity of linear optics and \emph{boson…
Let $X=X(n,q)$ be the set of $n\times n$ Hermitian matrices over $\mathbb{F}_{q^2}$. It is well known that $X$ gives rise to a metric translation association scheme whose classes are induced by the rank metric. We study $d$-codes in this…
We strengthen the classical approximation theorems of Weierstrass, Runge and Mergelyan by showing the polynomial and rational approximants can be taken to have a simple geometric structure. In particular, when approximating a function $f$…
Number fields and their rings of integers, which generalize the rational numbers and the integers, are foundational objects in number theory. There are several computer algebra systems and databases concerned with the computational aspects…
Let $\mathbb{K}$ be a field and $I$ be a square-free monomial ideal in the polynomial ring $\mathbb{K}[x_1, \ldots, x_n]$. The Green-Lazarsfeld index, $\mathrm{index}(I)$, counts the number of steps to reach to a syzygy minimally generated…
The probability for two monic polynomials of a positive degree n with coefficients in the finite field F_q to be relatively prime turns out to be identical with the probability for an n x n Hankel matrix over F_q to be nonsingular.…
We present a complex frame of eleven vectors in 4-space and prove that it defines injective measurements. That is, any rank-one $4\times 4$ Hermitian matrix is uniquely determined by its values as a Hermitian form on this collection of…
Let $\delta(\Pc) = (\delta_0, \delta_1,..., \delta_d)$ be the $\delta$-vector of an integral polytope $\Pc \subset \RR^N$ of dimension $d$. Following the previous work of characterizing the $\delta$-vectors with $\sum_{i=0}^d \delta_i \leq…
For any closed $K\subseteq\mathbb{R}^n$, in [P.\ J.\ di\,Dio, K.\ Schm\"udgen: $K$-Positivity Preserver and their Generators, SIAM J.\ Appl.\ Algebra Geom.\ 9 (2025), 794--824] all $K$-positivity preserver have been characterized, i.e., all…
We derive some Positivstellensatz\"e for noncommutative rational expressions from the Positivstellensatz\"e for noncommutative polynomials. Specifically, we show that if a noncommutative rational expression is positive on a polynomially…
We discuss optimization problems over convex cones in which membership is difficult to verify directly. In the standard theory of duality, vectors in the dual cone $K^*$ are associated with separating hyperplanes and interpreted as…
We study implicit regularization when optimizing an underdetermined quadratic objective over a matrix $X$ with gradient descent on a factorization of $X$. We conjecture and provide empirical and theoretical evidence that with small enough…
We construct natural representations of the Connes-Kreimer Lie algebras on rooted trees/Feynman graphs arising from Hecke correspondences in the categories $\LRF, \LFG$ constructed by K. Kremnizer and the author. We thus obtain the…
Randomized Hadamard Transforms (RHTs) have emerged as a computationally efficient alternative to the use of dense unstructured random matrices across a range of domains in computer science and machine learning. For several applications such…
Certificates to a linear algebra computation are additional data structures for each output, which can be used by a-possibly randomized- verification algorithm that proves the correctness of each output. Wiede-mann's algorithm projects the…
In this document, some elements of the theory and algorithmics corresponding to the existence and computability of approximate joint eigenpairs for finite collections of matrices with applications to model order reduction, are presented.…
In classical and real algebraic geometry there are several notions of the radical of an ideal I. There is the vanishing radical defined as the set of all real polynomials vanishing on the real zero set of I, and the real radical defined as…
We prove that the point process of the eigenvalues of real or complex non-Hermitian matrices $X$ with independent, identically distributed entries is hyperuniform: the variance of the number of eigenvalues in a subdomain $\Omega$ of the…