English
Related papers

Related papers: Some observations concerning reducibility of quadr…

200 papers

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

Number Theory · Mathematics 2007-05-23 I. E. Shparlinski , J. F. Voloch

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

Commutative Algebra · Mathematics 2013-11-12 Joachim von zur Gathen , Alfredo Viola , Konstantin Ziegler

The main result of this paper is the following version of the real Jacobian conjecture: "Let $F=(p,q):\R^2\to\R^2$ be a polynomial map with nowhere zero Jacobian determinant. If the degree of $p$ is less than or equal to $4$, then $F$ is…

Dynamical Systems · Mathematics 2022-10-12 F. Braun , B. Oréfice-Okamoto

We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…

Number Theory · Mathematics 2020-03-27 Samuel Porritt

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

Number Theory · Mathematics 2024-07-03 Cheuk Fung Lau

The splice quotients are an interesting class of normal surface singularities with rational homology sphere links, defined by W. Neumann and J. Wahl. If Gamma is a tree of rational curves that satisfies certain combinatorial conditions,…

Algebraic Geometry · Mathematics 2009-07-24 Elizabeth A. Sell

In this paper we analyze the irreducibility of numerical semigroups with multiplicity up to four. Our approach uses the notion of Kunz-coordinates vector of a numerical semigroup recently introduced in (Blanco-Puerto, 2011). With this tool…

Commutative Algebra · Mathematics 2011-04-15 Víctor Blanco

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

Commutative Algebra · Mathematics 2022-03-16 Sophie Frisch , Sarah Nakato , Roswitha Rissner

Let K be an algebraically closed field of characteristic zero and let f(x,y) be a nonzero polynomial of K[x,y]. We prove that if the generic element of the family $(f-\lambda)\_{\lambda}$ is a rational polynomial, and if the Jacobian J(f,g)…

Algebraic Geometry · Mathematics 2019-07-09 Abdallah Assi

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

Commutative Algebra · Mathematics 2025-07-15 Sarah Nakato , Roswitha Rissner

Consider polynomials over ${\rm GF}(2)$. We describe efficient algorithms for finding trinomials with large irreducible (and possibly primitive) factors, and give examples of trinomials having a primitive factor of degree $r$ for all…

Number Theory · Mathematics 2021-05-18 Richard P. Brent , Paul Zimmermann

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Number Theory · Mathematics 2019-08-15 Sam Porritt

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

General Mathematics · Mathematics 2016-10-07 Dhananjay P. Mehendale

We attempt to quantify the exact proportion of monic $p$-adic polynomials of degree $n$ which are irreducible. We find an exact answer to this when $n$ is prime and $p \neq n$, and also when $n = 4$ and $p \neq 2$. Our answers are rational…

Number Theory · Mathematics 2025-03-19 Isaac Rajagopal

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

Number Theory · Mathematics 2017-05-17 A. J. Irving

In this paper we describe the irreducible decomposition of the facet ideal $\F(\Delta_{m,n})$ of the chessboard complex $\Delta_{m,n}$ with $n\geq m$. We also provide some lower bounds for depth and regularity of the facet ideal…

Commutative Algebra · Mathematics 2022-09-27 Chengyao Jiang , Yakun Zhao , Hong Wang , Guangjun Zhu

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Number Theory · Mathematics 2024-09-09 Jonathan W. Bober , Lara Du , Dan Fretwell , Gene S. Kopp , Trevor D. Wooley

Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…

Algebraic Geometry · Mathematics 2013-10-22 Abdallah Assi

A $(a,b)$-coloring of a graph $G$ associates to each vertex a $b$-subset of a set of $a$ colors in such a way that the color-sets of adjacent vertices are disjoint. We define general reduction tools for $(a,b)$-coloring of graphs for $2\le…

Combinatorics · Mathematics 2023-10-06 Jean-Christophe Godin , Olivier Togni

For an odd positive integer $n\ge 5$, assuming the truth of the $abc$ conjecture, we show that for a positive proportion of pairs $(a,b)$ of integers the trinomials of the form $t^n+at+b (a,b\in \mathbb Z)$ are irreducible and their…

Number Theory · Mathematics 2008-08-05 Anirban Mukhopadhyay , M. Ram Murty , Kotyada Srinivas
‹ Prev 1 8 9 10 Next ›