English
Related papers

Related papers: Reducibility by polynomial functions

200 papers

We study the splitting fields of the family of polynomials $f_n(X)= X^n-X-1$. This family of polynomials has been much studied in the literature and has some remarkable properties. Serre related the function on primes $N_p(f_n)$, for a…

Number Theory · Mathematics 2022-11-01 Chandrashekhar B. Khare , Alfio Fabio La Rosa , Gabor Wiese

We show that, under reasonable assumptions, two negative roots can be eliminated from the characteristic equation of a polynomial-like iterative equation. This result gives a new case where we may lower the order of such an equation.

Classical Analysis and ODEs · Mathematics 2016-11-15 Szymon Draga

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

A degree-$d$ polynomial $p$ in $n$ variables over a field $\F$ is {\em equidistributed} if it takes on each of its $|\F|$ values close to equally often, and {\em biased} otherwise. We say that $p$ has a {\em low rank} if it can be expressed…

Combinatorics · Mathematics 2008-07-02 Tali Kaufman , Shachar Lovett

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

Algebraic Geometry · Mathematics 2008-04-15 Gennadiy Averkov

We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…

Combinatorics · Mathematics 2023-11-17 Bogdan Nica

A family of polynomials parameterized by the conjugacy classes of a finite Coxeter group is investigated. These polynomials, together with the character table of the group, determine the associated generic degrees. The polynomials are…

Representation Theory · Mathematics 2007-05-23 Dean Alvis

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

A semialgebraic bijection from the field of p-adic numbers to itself minus one point is constructed. Semialgebraic p-adic sets are classified up to semialgebraic bijection. A cell decomposition theorem for restricted analytic p-adic maps is…

Logic · Mathematics 2007-05-23 Raf Cluckers

Generalizing John Conway's construction of the Field On_2, we give the "minimal" definitions of addition and multiplication that turn the ordinals into a Field of characteristic p, for any prime p. We then analyze the structure of the…

Rings and Algebras · Mathematics 2015-02-19 Joseph DiMuro

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 construct parametric families of (monic) reducible polynomials having two roots very close to each other.

Number Theory · Mathematics 2014-05-26 Yann Bugeaud , Andrej Dujella

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Combinatorics · Mathematics 2026-01-05 Saugata Basu , Laxmi Parida

Assume that $\{a_{n};\,n\geq0\}$ is a sequence of positive numbers and $\sum a_{n}^{\,-1}<\infty$. Let $\alpha_{n}=ka_{n}$, $\beta_{n}=a_{n}+k^{2}a_{n-1}$ where $k\in(0,1)$ is a parameter, and let $\{P_{n}(x)\}$ be an orthonormal polynomial…

Mathematical Physics · Physics 2022-03-11 Pavel Stovicek

In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…

alg-geom · Mathematics 2008-02-03 F. Acquistapace , C. Andradas , F. Broglia

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

History and Overview · Mathematics 2022-02-03 Devendra Prasad

Let $K$ be a field complete with respect to a discrete valuation $v$ of residue characteristic $p$. Let $f(z) \in K[z]$ be a separable polynomial of the form $z^\ell-c.$ Given $a \in K$, we examine the Galois groups and ramification groups…

Number Theory · Mathematics 2020-07-06 Jacqueline Anderson , Spencer Hamblen , Bjorn Poonen , Laura Walton

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

Number Theory · Mathematics 2023-12-29 Max Schulz

We define a discrete closure operation for definably complete locally o-minimal structures $\mathcal M$. The pair of the underlying set of $\mathcal M$ and the discrete closure operation forms a pregeometry. We define the rank of a…

Logic · Mathematics 2022-04-06 Masato Fujita

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

Representation Theory · Mathematics 2018-03-06 Vladimir V. Kornyak
‹ Prev 1 8 9 10 Next ›