相关论文: On a factorization result of \c{S}tef\u{a}nescu
In this paper some classes of local polynomial functions on abelian groups are characterized by the properties of their variety. For this characterization we introduce a numerical quantity depending on the variety of the local polynomial…
Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…
Factorization machines and polynomial networks are supervised polynomial models based on an efficient low-rank decomposition. We extend these models to the multi-output setting, i.e., for learning vector-valued functions, with application…
The method of \emph{random integral representation}, that is, the method of representing a given probability measure as the probability distribution of some random integral, was quite successful in the past few decades. In this note we will…
This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…
We study the question up to which power an irreducible integer-valued polynomial that is not absolutely irreducible can factor uniquely. For example, for integer-valued polynomials over principal ideal domains with square-free denominator,…
We establish the equidistribution of the sequence of the averaged pullbacks of a Dirac measure at any value in $\mathbb{C}\setminus\{0\}$ under the derivatives of the iterations of a polynomials $f\in\mathbb{C}[z]$ of degree more than one…
For all simple and finite extension of a valued field, we prove that its defect is the product of the effective degrees of the complete set of key polynomials associated. As a consequence, we obtain a local uniformization theorem for…
Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…
We show that, for a certain class of partitions and an even number of variables of which half are reciprocals of the other half, Schur polynomials can be factorized into products of odd and even orthogonal characters. We also obtain related…
A classical result of Littlewood gives a factorisation for the Schur function at a set of variables "twisted" by a primitive $t$-th root of unity, characterised by the core and quotient of the indexing partition. While somewhat neglected,…
An analytic proof is proposed of Wiener's theorem on factorization of positive definite matrix-functions.
We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…
Working over an algebraically closed field $k$ of any characteristic, we determine the matrix factorizations for the --- suitably graded --- triangle singularities $f=x^a+y^b+z^c$ of domestic type, that is, we assume that $(a,b,c)$ are…
We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…
Recently, a factorization theorem was proposed for partonic flavor evolution as defined by the net flavor of the Winner-Take-All axis of a jet. We validate the factorization theorem through explicit calculation at two-loop order, and in the…
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
I explain a direct approach to differentiation and integration. Instead of relying on the general notions of real numbers, limits and continuity, we treat functions as the primary objects of our theory, and view differentiation as division…
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.
We present a new algorithm for the computation of the irreducible factors of degree at most $d$, with multiplicity, of multivariate lacunary polynomials over fields of characteristic zero. The algorithm reduces this computation to the…