Related papers: Sparse Nullstellensatz, resultants and determinant…
In our recent work \cite{StojnicCSetam09,StojnicUpper10} we considered solving under-determined systems of linear equations with sparse solutions. In a large dimensional and statistical context we proved results related to performance of a…
We introduce non-associative skew Laurent polynomial rings and characterize when they are simple. Thereby, we generalize results by Jordan, Voskoglou, and Nystedt and \"Oinert.
Tucker decomposition is the cornerstone of modern machine learning on tensorial data analysis, which have attracted considerable attention for multiway feature extraction, compressive sensing, and tensor completion. The most challenging…
Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…
We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…
We use the multiplicative structure of the Koszul resolution to give short and simple proofs of some known estimates for the total dimension of the cohomology of spaces which admit free torus actions and analogous results for filtered…
Let $M$ denote a finite volume, non-compact Riemann surface without elliptic points, and let $B$ denote the Lax-Phillips scattering operator. Using the superzeta function approach due to Voros, we define a Hurwitz-type zeta function…
The principal aim in this paper is to develop an effective and unified approach to the computation of traces of resolvents (and resolvent differences), Fredholm determinants, $\zeta$-functions, and $\zeta$-function regularized determinants…
If $f$ is a positive definite form, Reznick's Positivstellensatz [Mathematische Zeitschrift. 220 (1995), pp. 75--97] states that there exists $k\in\mathbf{N}$ such that ${\| x \|^{2k}_2}f$ is a sum of squares of polynomials. Assuming that…
A formula expressing the fermionic determinant (a large order polynomial) as an infinite product of smaller determinants is derived and discussed. These smaller determinants are of a fixed size, independent of the size of the lattice and…
Let $W$ be a finite Coxeter group and $V$ its reflection representation. The orbit space $\mathcal{M}_W= V/W$ has the remarkable Saito flat metric defined as a Lie derivative of the $W$-invariant bilinear form $g$. We find determinant of…
In this paper, we obtain several new classes of irreducible polynomials having integer coefficients whose zeros lie inside an open disk around the origin or outside a closed annular region in the complex plane. Such irreducible polynomials…
Decimal expansions of classical constants such as $\sqrt2$, $\pi$ and $\zeta(3)$ have long been a source of difficult questions. In the case of Laurent series with coefficients in a finite field, where no carry-over difficulties appear, the…
We consider systems of Laurent polynomials with support on a fixed point configuration. In the non-defective case, the closure of the locus of coefficients giving a non-degenerate multiple root of the system is defined by a polynomial…
Monotone operators, especially in the form of subdifferential operators, are of basic importance in optimization. It is well known since Minty, Rockafellar, and Bertsekas-Eckstein that in Hilbert space, monotone operators can be understood…
In [Jalowy, Kabluchko, Marynych, arXiv:2504.11593v1, 2025], the authors discuss a user-friendly approach to determine the limiting empirical zero distribution of a sequence of real-rooted polynomials, as the degree goes to $\infty$. In this…
We establish various certifying determinantal representation results for a polynomial that contains as a factor a prescribed multivariable polynomials that is strictly stable on a tube domain. The proofs use a Cayley transform in…
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a…
We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…
Subresultant is a powerful tool for developing various algorithms in computer algebra. Subresultants for polynomials in standard basis (i.e., power basis) have been well studied so far. With the popularity of basis-preserving algorithms,…