Related papers: Fej\'er--Riesz factorization for positive noncommu…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
In this paper, we investigate quantum Fourier analysis on subfactors and unitary fusion categories. We prove the complete positivity of the comultiplication for subfactors and derive a primary $n$-criterion of unitary categorifcation of…
Given a function $f$ on the positive half-line $\R_+$ and a sequence (finite or infinite) of points $X=\{x_k\}_{k=1}^\omega$ in $\R^n$, we define and study matrices $\kS_X(f)=\|f(|x_i-x_j|)\|_{i,j=1}^\omega$ called Schoenberg's matrices. We…
We prove that the F-signature of an affine semigroup ring of positive characteristic is always a rational number, and describe a method for computing this number. We use this method to determine the F-signature of Segre products of…
We give a new proof of a classical result which provides a one-to-one correspondence between positive definite radial kernels on a homogeneous tree and finite Borel measures on the interval $[-1,1]$. Our methods allow us to find a new…
We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…
We extend previous results about Putinar's Positivstellensatz for cylinders of type $S \times {\mathbb R}$ to sets of type $S \times {\mathbb R}^r$ in some special cases taking into account $r$ and the degree of the polynomial with respect…
It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…
Let $(X,\bullet )$ be a groupoid (binary algebra) and $Bin(X\dot{)}$ denote the collection of all groupoids defined on $X$. We introduce two methods of factorization for this binary system under the binary groupoid product \textquotedblleft…
Certificates of non-negativity such as Putinar's Positivstellensatz have been used to obtain powerful numerical techniques to solve polynomial optimization (PO) problems. Putinar's certificate uses sum-of-squares (sos) polynomials to…
In this paper we study the problem of deterministic factorization of sparse polynomials. We show that if $f \in \mathbb{F}[x_{1},x_{2},\ldots ,x_{n}]$ is a polynomial with $s$ monomials, with individual degrees of its variables bounded by…
Recently, the conditional SAGE certificate has been proposed as a sufficient condition for signomial positivity over a convex set. In this article, we show that the conditional SAGE certificate is $\textit{complete}$. That is, for any…
Let F be characteristic zero field, G a residually finite group and W a G-prime and PI F-algebra. By constructing G-graded central polynomials for W, we prove the G-graded version of Posner's theorem. More precisely, if S denotes all…
In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…
Given an element $f$ in a regular local ring, we study matrix factorizations of $f$ with $d \ge 2$ factors, that is, we study tuples of square matrices $(\varphi_1,\varphi_2,\dots,\varphi_d)$ such that their product is $f$ times an identity…
It is well known that an element of the algebra of noncommutative *-polynomials is positive in all *-representations if and only if it is a sum of squares. This provides an effective way to determine if a given *-polynomial is positive, by…
In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…
This paper introduces and systematically studies a new class of non-commutative algebras -- Weyl-type and Witt-type algebras -- generated by differential operators with exponential and generalized power function coefficients. We define the…
Sparse matrix factorization is the problem of approximating a matrix $\mathbf{Z}$ by a product of $J$ sparse factors $\mathbf{X}^{(J)} \mathbf{X}^{(J-1)} \ldots \mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in…
We design the first efficient polynomial identity testing algorithms over the nonassociative polynomial algebra. In particular, multiplication among the formal variables is commutative but it is not associative. This complements the strong…