Related papers: Factorization theorems for dominated polynomials
For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…
Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over…
Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…
We propose a new approach at Fermat's Last Theorem (FLT) solution: for each FLT equation we associate a polynomial of the same degree. The study of the roots of the polynomial allows us to investigate the FLT validity. This technique,…
We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…
We prove that the Buchweitz-Greuel-Schreyer Conjecture on the minimal rank of a matrix factorization holds for a generic polynomial of given degree and strength. The proof introduces a notion of the secondary strength of a polynomial, and…
We prove a classification of additive polynomial superfunctors, which allows us to compute some extensions of a superfunctor of the form $F \circ A$ where $F$ is a classical polynomial functor and $A$ is additive. We get a formula which…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…
We derive extensions of the monomialization theorems for morphisms of varieties in our earlier work. In this note we show that a local monomialization can be found which satisfies stronger local conditions. Some comments are made about how…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
We estimate the number $|\mathcal{A}_{\boldsymbol\lambda}|$ of elements on a nonlinear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $r$ having factorization pattern…
We introduce and investigate the category of factorization of a multiplicative, commutative, cancellative, pre-ordered monoid $A$, which we denote $\mathcal{F}(A)$. The objects of $\mathcal{F}(A)$ are factorizations of elements of $A$, and…
We demonstrate that the complete factorization of equations of motion into first-order differential equations can be obtained for real and complex scalar field theories with non-canonical dynamics.
Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…
The method of monotonization of difference schemes is being considered in the paper. The method was earlier proposed by the author for stationary problems. It is investigated in the paper more profoundly. The idea of the method is to build…
The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…
We show some elementary facts about the semantical analogue of Parikh's Splitting, which we call Factorization.
We establish a factorisation theorem for invertible, cross-symmetric, totally nonnegative matrices, and illustrate the theory by verifying that certain cases of Holte's Amazing Matrix are totally nonnegative.
Tensor expression simplification is an "ancient" topic in computer algebra, a representative of which is the canonicalization of Riemann tensor polynomials. Practically fast algorithms exist for monoterm canonicalization, but not for…
It is shown that the quantized Teichm"uller spaces have factorization properties like those required in the definition of a modular functor.