相关论文: Irreducibility of hypersurfaces

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. In order to count the decomposables, one wants to know, under a suitable normalization, the number of equal-degree collisions of…

We give a criterion for a quasi-ordinary polynomial to be irreducible. The criterion is based on the notion of approximate roots and that of generalized Newton polygons.

Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot…

We consider the equation $P(Q(x_1,\ldots,x_\nu))=Q(P(x_1),\ldots,P(x_\nu))$ in polynomials over the field of complex numbers and prove that if ${\rm deg}(P)>1$, then it is only solvable in polynomials that are affinely conjugate to…

In this paper we prove that decomposable forms, or homogeneous polynomials $F(x_1, \cdots, x_n)$ with integer coefficients which split completely into linear factors over $\mathbb{C}$, take on infinitely many square-free values subject to…

In this paper, we give error bounds on the number of monic irreducible polynomials $a_0+a_1x+\dots+a_{n-1}x^{n-1}+x^n$ over a finite field $\mathbb{F}_q$ of degree $n$ with $(a_0, a_1, \dots, a_{n-1}, 1)$ lying in a fixed affine algebraic…

A surface automorphism is strongly irreducible if every essential simple closed curve in the surface has nontrivial geometric intersection with its image. We show that a three-manifold admits only finitely many inequivalent surface bundle…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

We show that $0,1$-polynomials of high degree and few terms are irreducible with high probability. Formally, let $k\in\mathbb{N}$ and $F(x)=1+\sum_{i=1}^kx^{n_i}$, where $ 0<n_1<\cdots<n_k\leq N. $ Then we show that…

We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

We describe a congruence property of solvable polynomials over Q, based on the irreducibility of cyclotomic polynomials over number fields that meet certain conditions.

Given two polynomials $P(\underline x)$, $Q(\underline x)$ in one or more variables and with integer coefficients, how does the property that they are coprime relate to their values $P(\underline n), Q(\underline n)$ at integer points…

We sharpen and generalize the dimension growth bounds for the number of points of bounded height lying on an irreducible algebraic variety of degree $d$, over any global field. In particular, we focus on the affine hypersurface situation by…

In this article we investigate the coprimeness properties of one and two-dimensional discrete equations, in a situation where the equations are decomposable into several factors of polynomials. After experimenting on a simple equation, we…

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)…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…