English
Related papers

Related papers: Factorization of bivariate sparse polynomials

200 papers

Let $n \neq 8$ be a positive integer such that $n+1 \neq 2^u$ for any integer $u\geq 2$. Let $\phi(x)$ belonging to $\mathbb{Z}[x]$ be a monic polynomial which is irreducible modulo all primes less than or equal to $n+1$. Let $a_j(x)$ with…

Number Theory · Mathematics 2023-06-07 Anuj Jakhar , Ravi Kalwaniya

We refine and extend a result by Tuitman on the supports of a Bezout identity satisfied by a finite sequence of sparse Laurent polynomials without common zeroes in the toric variety associated to their supports. When the number of these…

Algebraic Geometry · Mathematics 2025-06-03 Carlos D'Andrea , Gabriela Jeronimo

In this paper, we prove the Farrell-Jones Conjecture for the solvable Baumslag-Solitar groups with coefficients in an additive category. We also extend our results to groups of the form, Z[1/p] semidirect product with any virtually cyclic…

Geometric Topology · Mathematics 2014-01-13 Tom Farrell , Xiaolei Wu

We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring $Z[[x]]$ of formal power series with integer coefficients. For $n,m\ge 1$ and $p$ prime, we show that $p^n+p^m\beta x+\alpha x^2$ is…

Commutative Algebra · Mathematics 2023-10-24 Daniel Birmajer , Juan Gil , Michael Weiner

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…

Combinatorics · Mathematics 2007-05-23 Ki Hang Kim , Fred W. Roush

The author in [7] was proved the generalized remainder and quotient theorems of polynomial in one indeterminate where the divisor is complete factorization to linear factors. In this paper we give the formula for the generalized remainder…

Numerical Analysis · Mathematics 2015-06-23 Wiwat Wanicharpichat

This paper investigates whether or not polynomials that are irreducible over $\mathbb{Q}$ and $\mathbb{Z}$ can remain irreducible under substitution by all quadratic polynomials. It answers this question in the negative in the degree 2 and…

Number Theory · Mathematics 2025-06-18 Lara Du

The author introduces a conjecture about Makar-Limanov invariants of affine unique factorization domains over a field of characteristic zero. Then the author finds that the conjecture does not always hold when $\mathbbm{k}$ is not…

Commutative Algebra · Mathematics 2020-10-13 Ziqi Liu

We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…

Combinatorics · Mathematics 2007-05-23 V. Farmaki , S. Negrepontis

We develop first steps in the study of factorizations of elements in ultraproducts of commutative cancellative monoids into irreducible elements. A complete characterization of the (multi-)sets of lengths in such objects is given. As…

Commutative Algebra · Mathematics 2023-11-29 Daniel Windisch

We consider a Bertrand type estimate for primes splitting completely. As one of its applications, we show the finiteness of trivial solutions of Diophantine equation about the factorial function over number fields except for the case the…

Number Theory · Mathematics 2019-07-25 Wataru Takeda

Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero. In the paper we give a criterion of nearly irreducibility for a given polynomial f in…

Algebraic Geometry · Mathematics 2019-05-08 Mateusz Masternak

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

Number Theory · Mathematics 2020-04-02 Biswajit Koley , A. Satyanarayana Reddy

We give a new proof of Fatou's theorem: {\em if an algebraic function has a power series expansion with bounded integer coefficients, then it must be a rational function.} This result is applied to show that for any non--trivial completely…

Number Theory · Mathematics 2008-06-11 Michael Coons , Peter Borwein

A classical theorem of Wonenburger, Djokovic, Hoffmann and Paige states that an element of the general linear group of a finite-dimensional vector space is the product of two involutions if and only if it is similar to its inverse. We give…

Rings and Algebras · Mathematics 2023-03-03 Clément de Seguins Pazzis

Gathering different results from singularity theory, geometry and combinatorics, we show that the spectrum at infinity of a tame Laurent polynomial counts lattice points in polytopes and we deduce an effective algorithm in order to compute…

Combinatorics · Mathematics 2018-12-12 Antoine Douai

Using the recent proof of the polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p^n$ by Gowers, Green, Manners, and Tao, we prove a version of the polynomial Freiman-Ruzsa conjecture over function fields. In particular, we prove that if…

Number Theory · Mathematics 2025-10-09 Thomas F. Bloom

In the 1920's, Ritt studied the operation of functional composition g o h(x) = g(h(x)) on complex rational functions. In the case of polynomials, he described all the ways in which a polynomial can have multiple `prime factorizations' with…

Number Theory · Mathematics 2007-10-11 Michael E. Zieve

A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.

Complex Variables · Mathematics 2010-11-17 Lasha Ephremidze

A necessary condition for uniqueness of factorizations of elements of a finite group $G$ with factors belonging to a union of some conjugacy classes of $G$ is given. This condition is sufficient if the number of factors belonging to each…

Group Theory · Mathematics 2011-05-11 Vik. S. Kulikov