Related papers: Motion Polynomials Admitting a Factorization with …

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.

We consider the numerical irreducible decomposition of a positive dimensional solution set of a polynomial system into irreducible factors. Path tracking techniques computing loops around singularities connect points on the same irreducible…

We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…

We introduce the notion of numerical functors to generalise Eilenberg & MacLane's polynomial functors to modules over a binomial base ring. After shewing how these functors are encoded by modules over a certain ring, we record a precise…

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ where $K$ is a field. In this paper, we give some properties of $n$-matrix factorizations of polynomials in $R$. We also derive some results giving some lower bounds on the number of $n$-matrix factors…

This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative…

We consider a statistical model for matrix factorization in a regime where the rank of the two hidden matrix factors grows linearly with their dimension and their product is corrupted by additive noise. Despite various approaches,…

We classify two-variable polynomials which are rational of simple type. These are precisely the two-variable polynomials with trivial homological monodromy.

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

We define a ring whose elements are rational functions, whose addition is polynomial multiplication, and whose multiplication is a convolution operation. It is then show that this ring's endomorphisms exhibit a strong classification.…

A method of reducing general quaternion functions of first degree, i.e., linear quaternion functions, to quaternary canonical form is given. Linear quaternion functions, once reduced to canonical form, can be maintained in this form under…

We study how the field of definition of a rational function changes under iteration. We provide a complete classification of polynomials with the property that the field of definition of one of their iterates drops in degree (over a given…

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ and $S=$ $K[y_{1},y_{2},\cdots, y_{m}]$ where $K$ is a field. %commutative ring with unity. In this paper, we propose a method showing how to obtain $3$-matrix factors for a given polynomial using either…

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…

In this paper, we construct families of polynomials defined by recurrence relations related to mean-zero random walks. We show these families of polynomials can be used to approximate $z^n$ by a polynomial of degree $\sim \sqrt{n}$ in…

This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…

Polynomial networks and factorization machines are two recently-proposed models that can efficiently use feature interactions in classification and regression tasks. In this paper, we revisit both models from a unified perspective. Based on…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

We show how rational function approximations to the logarithm, such as $\log z \approx (z^2 - 1)/(z^2 + 6z + 1)$, can be turned into fast algorithms for approximating the determinant of a very large matrix. We empirically demonstrate that…

We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…