中文
相关论文

相关论文: Monochromatic Sums and Products of Polynomials

200 篇论文

In this article, we will explore a recent method of Alweiss \cite{key-1} using ultrafilter technique to study monochromatic partition regular structure of the form $\left\{ x,y,x+y,x\cdot y\right\} $ over rationals, which is recently proved…

组合数学 · 数学 2022-12-29 Sayan Goswami

In this paper, we study arithmetic properties satisfied by the $k$-tuple $\ell$-regular partitions. A $k$-tuple of partitions $(\xi_1, \xi_2, \ldots, \xi_k)$ is said to be $\ell$-regular if all the $\xi_i$'s are $\ell$-regular. We study the…

数论 · 数学 2025-05-13 Hemjyoti Nath , Manjil P. Saikia , Abhishek Sarma

In this paper, it is shown that if F(x , y) is an irreducible binary form with integral coefficients and degree $n \geq 3$, then provided that the absolute value of the discriminant of F is large enough, the equation |F(x , y)| = 1 has at…

数论 · 数学 2010-11-22 Shabnam Akhtari

Let $F$ be an integral linear recurrence, $G$ be an integer-valued polynomial splitting over the rationals, and $h$ be a positive integer. Also, let $\mathcal{A}_{F,G,h}$ be the set of all natural numbers $n$ such that $\gcd(F(n), G(n)) =…

数论 · 数学 2020-12-15 Daniele Mastrostefano , Carlo Sanna

An open problem of arithmetic Ramsey theory asks if given a finite $r$-colouring $c:\mathbb{N}\to\{1,...,r\}$ of the natural numbers, there exist $x,y\in \mathbb{N}$ such that $c(xy)=c(x+y)$ apart from the trivial solution $x=y=2$. More…

数论 · 数学 2012-11-30 Brandon Hanson

We obtain partition regularity results for homogeneous quadratic equations whose parametrized solutions admit nice factorizations into linear forms over rings of integers of imaginary quadratic fields. To do so, we develop number-theoretic…

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

数论 · 数学 2023-10-05 Tong Lin , Qiang Wang

For $q$ prime, $X \geq 1$ and coprime $u,v \in \mathbb{N}$ we estimate the sums \begin{equation*} \sum_{\substack{p \leq X \substack p \equiv u \hspace{-0.25cm} \mod{v} p \text{ prime}}} \text{Kl}_2(p;q), \end{equation*} where…

数论 · 数学 2018-06-08 Alexander Dunn , Alexandru Zaharescu

We study an analogue of a classical arithmetic problem over the ring of polynomials. We prove that $m = 5$ is the minimal number such that the sums of any two distinct polynomials in a set of $m$ polynomials over $\F_2[x]$ cannot all be of…

数论 · 数学 2026-02-16 Luis H. Gallardo

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

数论 · 数学 2018-09-05 Fusun Akman

In this paper we introduce a class of sequences connected with the $m$--ary partition function and investigate their congruence properties. In particular, we get facts about the sequences of $m$--ary partitions $(b_{m}(n))_{m\in\mathbb{N}}$…

数论 · 数学 2017-10-13 Błażej Żmija

We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…

经典分析与常微分方程 · 数学 2016-09-07 Ilia Krasikov

In this paper, a computationally simple and explicit method of constructing recursive sequence of primitive polynomials of degree $n2^k (k = 1, 2, 3,\ldots)$ over $\mathbb{F}_{q}$ is given.

交换代数 · 数学 2019-07-25 Mahmood Alizadeh

We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…

数论 · 数学 2014-04-15 Jonathan Burns

We consider two seemingly unrelated questions: the relationship between nonnegative polynomials and sums of squares on real varieties, and sparse semidefinite programming. This connection is natural when a real variety $X$ is defined by a…

代数几何 · 数学 2021-06-15 Grigoriy Blekherman , Kevin Shu

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

数论 · 数学 2018-10-30 Clemens Fuchs , Christina Karolus

We show that several sets of interest arising from the study of partition regularity and density Ramsey theory of polynomial equations over integral domains are undecidable. In particular, we show that the set of homogeneous polynomials $p…

逻辑 · 数学 2025-05-13 Sohail Farhangi , Steve Jackson , Bill Mance

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

数论 · 数学 2025-01-10 Dan Ismailescu , Yunkyu James Lee

We show that for any finite partition of $\mathbb{N}$ there is an infinite sequence whose finite sums are monochromatic and such that infinitely many of the products with a fixed number of factors are monochromatic -- though not necessarily…

组合数学 · 数学 2026-05-26 Conner Griffin

We study functions satisfying the composition law $F(xy)+F(x/y)=P(F(x),F(y))$ with a symmetric polynomial combiner $P$. We prove that symmetry together with a quadratic degree bound on $P$ forces a composition law of d'Alembert type. We…

经典分析与常微分方程 · 数学 2026-04-22 Jonathan Washburn , Milan Zlatanović , Elshad Allahyarov
‹ 上一页 1 8 9 10 下一页 ›