English
Related papers

Related papers: Irreducibility algorithm for the Weierstrass polyn…

200 papers

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh

Let $F\in \mathbb{K}[X, Y ]$ be a polynomial of total degree $D$ defined over a perfect field $\mathbb{K}$ of characteristic zero or greater than $D$. Assuming $F$ separable with respect to $Y$ , we provide an algorithm that computes the…

Algebraic Geometry · Mathematics 2018-12-05 Adrien Poteaux , Martin Weimann

We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…

Commutative Algebra · Mathematics 2019-02-04 Michel Hickel , Mickaël Matusinski

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

Combinatorics · Mathematics 2025-07-23 Niels Lubbes , Mehdi Makhul , Josef Schicho , Audie Warren

We classify the irreducible components of the Hilbert scheme of $n$ points on non-reduced algebraic plane curves, and give a formula for the multiplicities of the irreducible components. The irreducible components are indexed by partitions…

Algebraic Geometry · Mathematics 2023-10-24 Yuze Luan

Germs of plane curve singularities can be classified accordingly to their equisingularity type. For singularities over C, this important data coincides with the topological class. In this paper, we characterise a family of singularities,…

Algebraic Geometry · Mathematics 2019-11-14 Adrien Poteaux , Martin Weimann

We study certain kind of polynomials associated with Lissajous curves, called Chebyshev-Lissajous polynomials. We investigate their irreducibilities over the real numbers and complex numbers, thus comfirming two conjectures proposed by…

Number Theory · Mathematics 2022-04-04 Hanxiong Zhang

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

Number Theory · Mathematics 2007-05-23 Anca Iuliana Bonciocat , Alexandru Zaharescu

We show that the roots of a Weierstrass polynomial on several variables are power series with rational exponents of bounded denominators, whose Newton diagrams are contained in an S-cone. As an application, in Section 4 we deal with some…

Commutative Algebra · Mathematics 2007-05-23 M. J. Soto , J. L. Vicente

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…

Number Theory · Mathematics 2014-07-02 Won-Ho Ri , Gum-Chol Myong , Ryul Kim , Chang-Il Rim

We compute the Weierstrass semigroup at one totally ramified place for Kummer extensions defined by $y^m=f(x)^{\lambda}$ where $f(x)$ is a separable polynomial over $\mathbb{F}_q$. In addition, we compute the Weierstrass semigroup at two…

Algebraic Geometry · Mathematics 2020-01-29 Ariane M. Masuda , Luciane Quoos , Alonso Sepúlveda

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

Number Theory · Mathematics 2017-01-30 D. R. Heath-Brown , Giacomo Micheli

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Number Theory · Mathematics 2008-11-26 Xiang-dong Hou , Gary L. Mullen

We provide a very effective and explicit algorithm of finding a Puiseux expansion of a cuspidal singularity of a plane curve, when this singularity is given in a parametric form.

Algebraic Geometry · Mathematics 2009-12-08 Maciej Borodzik

The paper is an introduction to the use of the classical Newton-Puiseux procedure, oriented to an algorithmic description of it. This procedure enables to get polynomial approximations for parameterizations of branches of an algebraic plane…

Algebraic Geometry · Mathematics 2022-06-14 Stefano Canino , Alessandro Gimigliano , Monica Idà

We give an explicit formula for the exponents (i.e. the spectra up to the shift by one) of an irreducible plane curve singularity in terms of Puiseux pairs. As an application we prove in this case Hertling's conjecture that the variance…

Algebraic Geometry · Mathematics 2007-05-23 Morihiko Saito

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

Number Theory · Mathematics 2018-11-21 Domingo Gómez-Pérez , László Mérai , Igor E. Shparlinski

In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…

Commutative Algebra · Mathematics 2021-07-08 Vikramjeet Singh Chandel , Uma Dayal

An explicit expression for the cofactor related to an irreducible invariant algebraic curve of a polynomial dynamical system in the plane is derived. A sufficient condition for a polynomial dynamical system in the plane to have a finite…

Dynamical Systems · Mathematics 2021-02-23 Maria V. Demina

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

Symbolic Computation · Computer Science 2008-10-29 Laurent Busé , Bernard Mourrain
‹ Prev 1 2 3 10 Next ›