English
Related papers

Related papers: On a Fejer-Riesz factorization of generalized trig…

200 papers

One relates factorization of bivariate polynomials to singularities of projective plane curves. One proves that adjoint polynomials permit to solve the recombinations of the modular factors induced by the absolute and rational…

Algebraic Geometry · Mathematics 2012-02-20 Martin Weimann

To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…

Quantum Algebra · Mathematics 2009-11-11 Israel Gelfand , Sergei Gelfand , Vladimir Retakh , Robert Lee Wilson

We consider Rota-Baxter algebras of meromorphic forms with poles along a (singular) hypersurface in a smooth projective variety and the associated Birkhoff factorization for algebra homomorphisms from a commutative Hopf algebra. In the case…

Mathematical Physics · Physics 2016-07-25 Matilde Marcolli , Xiang Ni

Let $z_1, \dots, z_m$ be $m$ distinct complex numbers, normalized to $|z_k| = 1$, and consider the polynomial $$ p_{m}(z) = \prod_{k=1}^{m}{(z-z_k)}.$$ We define a sequence of polynomials in a greedy fashion, $$ p_{N+1}(z) = p_{N}(z)…

Classical Analysis and ODEs · Mathematics 2021-09-16 Stefan Steinerberger

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

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

Combinatorics · Mathematics 2019-12-10 Bo Lin , Ngoc Mai Tran

Rational transformations of polynomials are extensively studied in the context of finite fields, especially for the construction of irreducible polynomials. In this paper, we consider the factorization of rational transformations with…

Number Theory · Mathematics 2023-09-06 Max Schulz

Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…

Optimization and Control · Mathematics 2025-02-18 Adam Brown , Kanstantsin Pashkovich , Levent Tunçel

Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…

Classical Analysis and ODEs · Mathematics 2007-05-23 Margherita Barile , Fiorella Barone , Wlodzimierz M. Tulczyjew

Let $A$ be a matrix with nonnegative real entries. A nonnegative factorization of size $k$ is a representation of $A$ as a sum of $k$ nonnegative rank-one matrices. The space of all such factorizations is a bounded semialgebraic set, and we…

Combinatorics · Mathematics 2018-04-06 Yaroslav Shitov

Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…

Quantum Algebra · Mathematics 2014-10-20 Simon Lentner , Daniel Nett

We consider functions $f$ of two real variables, given as trigonometric functions over a finite set $F$ of frequencies. This set is assumed to be closed under rotations in the frequency plane of angle $\frac{2k\pi}{M}$ for some integer $M$.…

Numerical Analysis · Mathematics 2016-12-02 Jean-Paul Gauthier , Dario Prandi

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

Number Theory · Mathematics 2007-05-23 Jean-Claude Evard

We use generating functions to relate the expected values of polynomial factorization statistics over $\mathbb{F}_q$ to the cohomology of ordered configurations in $\mathbb{R}^3$ as a representation of the symmetric group. Our methods lead…

Representation Theory · Mathematics 2018-02-02 Trevor Hyde

This paper considers some work done by the author and Catlin [CD1,CD2,CD3] concerning positivity conditions for bihomogeneous polynomials and metrics on bundles over certain complex manifolds. It presents a simpler proof of a special case…

Complex Variables · Mathematics 2016-09-07 John P. D'Angelo

Given a standard graded polynomial ring $R=k[x_1,...,x_n]$ over a field $k$ of characteristic zero and a graded $k$-subalgebra $A=k[f_1,...,f_m]\subset R$, one relates the module $\Omega_{A/k}$ of K\"ahler $k$-differentials of $A$ to the…

Commutative Algebra · Mathematics 2016-06-14 Isabel Bermejo , Philippe Gimenez , Aron Simis

Let R be a complete discrete valuation ring with maximal ideal generated by pi. Let f(X) in R[X] be a monic polynomial with nonzero discriminant Delta(f). Let s >= v_pi(Delta(f)) + 1. Suppose given a factorisation of f(X) in (R/pi^s R)[X]…

Commutative Algebra · Mathematics 2014-07-31 Juliane Deissler

Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…

Numerical Analysis · Mathematics 2021-03-09 Wenyuan Wu , Zhonggang Zeng

Using the Riesz-Feller fractional derivative, we apply the factorization algorithm to the fractional quantum harmonic oscillator along the lines previously proposed by Olivar-Romero and Rosas-Ortiz, extending their results. We solve the…

Mathematical Physics · Physics 2020-06-22 Haret C. Rosu , Stefan C. Mancas

We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…

Computational Complexity · Computer Science 2016-07-12 Anand Kumar Narayanan