中文
相关论文

相关论文: Is a bivariate polynomial with plus minus 1 coeffi…

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

Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…

组合数学 · 数学 2012-12-17 Jed Yang

A second order polynomial sequence is of Fibonacci-type $\mathcal{F}_{n}$ (Lucas-type $\mathcal{L}_{n}$) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Under certain conditions these polynomials are…

数论 · 数学 2022-02-17 Rigoberto Florez , J. C. Saunders

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

数论 · 数学 2021-09-23 Lucile Devin , Xianchang Meng

We present an elementary proof that the Schur polynomial corresponding to an increasing sequence of exponents (c_0,..., c_{n-1}) with c_0 = 0 is irreducible over every field of characteristic p whenever the numbers d_i = c_{i+1} - c_i are…

交换代数 · 数学 2016-02-02 Aleksander Zabłocki

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

数论 · 数学 2021-09-27 Karl Dilcher , Maciej Ulas

We extend to several variables an earlier result of ours, according to which an entire function of one variable of sufficiently small exponential type, having all derivatives of even order taking integer values at two points, is a…

复变函数 · 数学 2021-12-07 Michel Waldschmidt

In 2002, M.Ram Murty showed that if p is a prime with k-adic expansion :$p = \sum_{i = 0}^n a_i k^i$ , then the polynomial $f(x) = \sum_{i = 0}^n a_ix^i$ is irreducible in $\mathbb{Z}[x]$.When $k = 10$ , it's a result of A.Cohn. I think…

综合数学 · 数学 2023-03-01 Boyang Zhao

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

代数几何 · 数学 2009-10-12 Arnaud Bodin

We prove a recent conjecture by Ulas on reducible polynomial substitutions.

数论 · 数学 2019-08-01 Peter Müller

We study the irreducibility and Galois group of random polynomials over function fields. We prove that a random polynomial $f=y^n+\sum_{i=0}^{n-1}a_i(x)y^i\in\mathbb F_q[x][y]$ with i.i.d coefficients $a_i$ taking values in the set…

数论 · 数学 2024-07-08 Alexei Entin , Alexander Popov

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

符号计算 · 计算机科学 2024-09-17 James H. Davenport

Let $m\geq 1$ and $a_m$ be integers. Let $\alpha$ be a rational number which is not a negative integer such that $\alpha = \frac{u}{v}$ with $\gcd(u,v) = 1, v>0$. Let $\phi(x)$ belonging to $\Z[x]$ be a monic polynomial which is irreducible…

数论 · 数学 2023-06-13 Anuj Jakhar , Srinivas Kotyada , Arunabha Mukhopadhyay

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…

概率论 · 数学 2022-09-07 Jimmy He , Huy Tuan Pham , Max Wenqiang Xu

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…

经典分析与常微分方程 · 数学 2008-08-14 Steve Fisk

We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…

q-alg · 数学 2008-02-03 Dror Bar-Natan

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

交换代数 · 数学 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…

机器学习 · 统计学 2012-03-27 Péter Kövesárki

Positive and negative quadratic forms are well known and widely used. They are multivariate homogeneous polynomials of degree two taking positive or negative values respectively for any values of their arguments not all zero. In the present…

代数几何 · 数学 2015-07-20 Ruslan Sharipov

We compute the graded rank of the cohomology of the hyperplane complement associated with a quaternionic reflection group, and observe that it factors into irreducible factors with positive integer coefficients. For an irreducible group,…

表示论 · 数学 2025-10-22 Stephen Griffeth , David Guevara