中文
相关论文

相关论文: Characterization of polynomials

200 篇论文

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

数论 · 数学 2025-12-24 Rishu Garg , Jitender Singh

We consider a certain left action by the monoid $SL_2(\mathbf{N}_0)$ on the set of divisor pairs $\mathcal{D}_f := \{ (m, n) \in \mathbf{N}_0 \times \mathbf{N}_0 : m \lvert f(n) \}$ where $f \in \mathbf{Z}[x]$ is a polynomial with integer…

数论 · 数学 2024-05-07 Anton Shakov

Let $f(x) = (x^{2}+1)^{n} - a x^{n} \in \mathbb{Z}[x]$ and assume $f(x)$ is irreducible. Let $\theta$ be a root of $f(x)$, set $K= \mathbb{Q}(\theta)$, and denote by $\mathbb{Z}_{K}$ the ring of integers of $K$. The index of $f$, denoted…

数论 · 数学 2026-02-18 Rupam Barman , Anuj Narode , Vinay Wagh

A sequence of nonzero integers $f = (f_1, f_2, \dots)$ is ``binomid'' if every $f$-binomid coefficient $\left[\! \begin{array}{c} n \\ k \end{array}\! \right]_f$ is an integer. Those terms are the generalized binomial coefficients: \[…

数论 · 数学 2023-02-07 Daniel B. Shapiro

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…

代数几何 · 数学 2019-05-08 Mateusz Masternak

In 1934, Whitney raised the question of how to recognize whether a function f defined on a closed subset X of Euclidean space is the restriction of a function that is continuously differentiable to order p. A necessary and sufficient…

代数几何 · 数学 2007-05-23 E. Bierstone , P. D. Milman , W. Pawlucki

Let R denote the reals, and let h: R^n --> R be a continuous, piecewise-polynomial function. The Pierce-Birkhoff conjecture (1956) is that any such h is representable in the form sup_i inf_j f_{ij}, for some finite collection of polynomials…

代数几何 · 数学 2010-02-02 Charles N. Delzell

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

数论 · 数学 2025-11-19 Oleksiy Klurman , Vlad Matei

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…

数论 · 数学 2007-05-23 Arnaud Bodin , Pierre Dèbes , Salah Najib

We classify the polynomials with integral coefficients that, when evaluated on a group element of finite order $n$, define a unit in the integral group ring for infinitely many positive integers $n$. We show that this happens if and only if…

环与代数 · 数学 2014-10-10 Osnel Broche , Ángel del Río

In 1952, Littlewood stated a conjecture about the average growth of spherical derivatives of polynomials, and showed that it would imply that for entire function of finite order, "most" preimages of almost all points are concentrated in a…

复变函数 · 数学 2019-10-30 Lukas Geyer

For a field $L$ of characteristic $p$, a polynomial $f \in \overline{\mathbb{F}}_p[x]$ and $\alpha, \beta \in L$, let $\mathrm{Prep}(f;\alpha,\beta)$ be the set of all $\lambda \in \overline{L}$ such that both $\alpha$ and $\beta$ are…

数论 · 数学 2025-10-14 Jungin Lee , GyeongHyeon Nam

Let $f$ be sampled uniformly at random from the set of degree $n$ polynomials whose coefficients lie in $\{ \pm 1\}$. A folklore conjecture, known to hold under GRH, states that the probability that $f$ is irreducible tends to $1$ as $n$…

数论 · 数学 2024-01-09 Lior Bary-Soroker , David Hokken , Gady Kozma , Bjorn Poonen

Starting from the expression for the superdeterminant of $ (xI-M)$, where $M$ is an arbitrary supermatrix , we propose a definition for the corresponding characteristic polynomial and we prove that each supermatrix satisfies its…

高能物理 - 理论 · 物理学 2015-06-26 L. F. Urrutia , N. Morales

An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…

数论 · 数学 2017-04-13 Yaotsu Chang , Chong-Dao Lee , Chia-an Liu

The main purpose of this paper is solve polynomial equations that are satisfied by (generalized) polynomials. More exactly, we deal with the following problem: let $\mathbb{F}$ be a field with $\mathrm{char}(\mathbb{F})=0$ and $P\in…

交换代数 · 数学 2021-09-08 Eszter Gselmann

An integer-valued multiplicative function $f$ is said to be polynomially-defined if there is a nonconstant separable polynomial $F(T)\in \mathbb{Z}[T]$ with $f(p)=F(p)$ for all primes $p$. We study the distribution in coprime residue…

数论 · 数学 2023-05-31 Paul Pollack , Akash Singha Roy

We derive an identity that relates a class of multiple integrals involving Vandermonde polynomials to divided differences. Alternatively the identity can be viewed as an integral formula for divided differences. As part of the derivation we…

数值分析 · 数学 2026-03-20 Michael S. Floater

Let $f(T)$ be a monic polynomial of degree $d$ with coefficients in a finite field $\mathbb{F}_q$. Extending earlier results in the literature, but now allowing $(q,2d)>1$, we give a criterion for $f$ to satisfy the following property: for…

代数几何 · 数学 2024-06-04 Kaloyan Slavov

In 1942 I. J. Schoenberg proved that a function is positive definite in the unit sphere if and only if this function is a positive linear combination of the Gegenbauer polynomials. In this paper we extend Schoenberg's theorem for…

度量几何 · 数学 2014-09-17 Oleg R. Musin