English
Related papers

Related papers: Matrix factorizations of generic polynomials

200 papers

We extend a factorization theorem by Gwo\'zdziewicz and Hejmej from the ring of formal power series to any complete regular local ring $ R $. More precisely, let $ f \in R $ and assume that its Newton polyhedron has a loose edge such that…

Algebraic Geometry · Mathematics 2018-09-11 Bernd Schober

The problem of computing a representation for a real polynomial as a sum of minimum number of squares of polynomials can be casted as finding a symmetric positive semidefinite real matrix (Gram matrix) of minimum rank subject to linear…

Optimization and Control · Mathematics 2011-01-28 Yue Ma , Lihong Zhi

This article generalizes the correspondence between matrix factorizations and maximal Cohen-Macaulay modules over hypersurface rings due to Eisenbud and Yoshino. We consider factorizations with several factors in a purely categorical…

Category Theory · Mathematics 2026-05-12 Jonas Frank , Mathias Schulze

Following the works by Lin et al. (Circuits Syst. Signal Process. 20(6): 601-618, 2001) and Liu et al. (Circuits Syst. Signal Process. 30(3): 553-566, 2011), we investigate how to factorize a class of multivariate polynomial matrices. The…

Symbolic Computation · Computer Science 2019-05-29 Dong Lu , Dingkang Wang , Fanghui Xiao

Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently introduced for homogeneous polynomials by Ananyan-Hochster in their proof of Stillman's conjecture and generalised here to other tensors, is…

Algebraic Geometry · Mathematics 2019-10-15 Arthur Bik , Jan Draisma , Rob H. Eggermont

A spectral factorization theorem is proved for polynomial rank-deficient matrix-functions. The theorem is used to construct paraunitary matrix-functions with first rows given.

Complex Variables · Mathematics 2010-08-19 Lasha Ephremidze , Edem Lagvilava

In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…

Functional Analysis · Mathematics 2008-12-09 Geraldo Botelho , Daniel Pellegrino , Pilar Rueda

In this paper, we prove a generalization of the Schmidt's subspace theorem for polynomials of higher degree in subgeneral position with respect to a projective variety over a number field. Our result improves and generalizes the previous…

Number Theory · Mathematics 2022-11-16 Si Duc Quang

We determine the Bernstein-Sato polynomials for the ideal of maximal minors of a generic m x n matrix, as well as for that of sub-maximal Pfaffians of a generic skew-symmetric matrix of odd size. As a corollary, we obtain that the Strong…

Algebraic Geometry · Mathematics 2017-08-15 András C. Lőrincz , Claudiu Raicu , Uli Walther , Jerzy Weyman

We construct a full strongly exceptional collection in the triangulated category of graded matrix factorizations of a polynomial associated to a non-degenerate regular system of weights whose smallest exponents are equal to -1. In the…

Algebraic Geometry · Mathematics 2007-08-02 Hiroshige Kajiura , Kyoji Saito , Atsushi Takahashi

Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…

Combinatorics · Mathematics 2025-10-10 Wenxia Qu , Wenston J. T. Zang

We prove continuous-valued analogues of the basic fact that Murray-von Neumann subequivalence of projections in II$_1$ factors is completely determined by tracial evaluations. We moreover use this result to solve the so-called trace problem…

Operator Algebras · Mathematics 2025-09-16 Ilijas Farah , Andrea Vaccaro

A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.

Exactly Solvable and Integrable Systems · Physics 2009-11-11 F. Musso , A. Shabat

Yui and Zagier made some fascinating conjectures on the factorization on the norm of the difference of Weber class invariants $ f(\mathfrak a_1) - f(\mathfrak a_2)$ based on their calculation in \cite{YZ}. Here $\mathfrak a_i$ belong two…

Number Theory · Mathematics 2025-03-12 Yingkun Li , Tonghai Yang , Dongxi Ye

We study two conjectures in additive combinatorics. The first is the polynomial Freiman-Ruzsa conjecture, which relates to the structure of sets with small doubling. The second is the inverse Gowers conjecture for $U^3$, which relates to…

Combinatorics · Mathematics 2010-01-20 Shachar Lovett

We give a new proof of the Hansen-Mullen irreducibility conjecture. The proof relies on an application of a (seemingly new) sufficient condition for the existence of elements of degree $n$ in the support of functions on finite fields. This…

Number Theory · Mathematics 2016-04-15 Aleksandr Tuxanidy , Qiang Wang

A new necessary and sufficient condition for the existence of minor left prime factorizations of multivariate polynomial matrices without full row rank is presented. The key idea is to establish a relationship between a matrix and its full…

Symbolic Computation · Computer Science 2020-10-15 Dong Lu , Dingkang Wang , Fanghui Xiao

This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…

Symbolic Computation · Computer Science 2020-10-15 Dong Lu , Dingkang Wang , Fanghui Xiao

We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…

Commutative Algebra · Mathematics 2024-03-07 Amichai Lampert , Tamar Ziegler

Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…

Combinatorics · Mathematics 2007-05-23 Leonid Gurvits