English
Related papers

Related papers: Rational Solutions of First Order Algebraic Ordina…

200 papers

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

Number Theory · Mathematics 2025-09-18 Alexei Entin

We prove that there is an absolute constant $c > 0$ such that for every $$a_0,a_1, \ldots,a_n \in [1,M]\,, \qquad 1 \leq M \leq \frac 14 \exp \left( \frac n9 \right)\,,$$ there are $$b_0,b_1,\ldots,b_n \in \{-1,0,1\}$$ such that the…

Number Theory · Mathematics 2024-10-17 Tamás Erdélyi

Let $F(X_1,X_2)\in\mathbb{Z}[X_1,X_2] $ be an irreducible binary form of degree $3$ and $h$ an arithmetic function. We give some estimates for the average order $\sum_{\substack{|n_1|\leq x,|n_2|\leq x}}h(F(n_1,n_2))$ when $h$ satisfy…

Number Theory · Mathematics 2014-08-12 Armand Lachand

Let $F(x)$ be an irreducible polynomial with integer coefficients and degree at least 2. For $x\ge z\ge y\ge 2$, denote by $H_F(x, y, z)$ the number of integers $n\le x$ such that $F(n)$ has at least one divisor $d$ with $y<d\le z$. We…

Number Theory · Mathematics 2022-07-05 Kevin Ford , Guoyou Qian

The analysis of many physical phenomena can be reduced to the study of solutions of differential equations with polynomial coefficients. In the present work, we establish the necessary and sufficient conditions for the existence of…

Classical Analysis and ODEs · Mathematics 2020-03-19 Kyle R. Bryenton1 , Andrew R. Cameron , Keegan L. A. Kirk , Nasser Saad , Patrick Strongman , Nikita Volodin

Consider the differential equation $y'=F(x,y)$. We determine the weakest possible upper bound on $|F(x,y)-F(x,z)|$ which guarantees that this equation has for all initial values a unique solution, which exists globally.

Classical Analysis and ODEs · Mathematics 2021-10-05 Jan-Christoph Schlage-Puchta

In this paper, a matrix representation for the differential resultant of two generic ordinary differential polynomials $f_1$ and $f_2$ in the differential indeterminate $y$ with order one and arbitrary degree is given. That is, a…

Symbolic Computation · Computer Science 2012-04-18 Zhi-Yong Zhang , Chun-Ming Yuan , Xiao-Shan Gao

Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…

Number Theory · Mathematics 2015-02-27 Thomas Reuss

Place the vertices of a rectangle at $\{(0, \pm 1/2), (a, \pm 1/2)\}$, where $a$ is rational. We show that if $v_3(a) = 0$, then any point $(x,y)$ that is rational distance from all four vertices of the rectangle has either $v_3(x) < 0$ or…

Number Theory · Mathematics 2020-06-09 William McCloskey

We characterize the rational solutions to a KdV-like equation which are generated from polynomial solutions to the corresponding generalized bilinear equation. We use a particular class of polynomials satisfying a quadratic difference…

Analysis of PDEs · Mathematics 2022-05-20 Brian D. Vasquez

We give two elementary proofs, at a level understandable by students with only pre-calculus knowledge of Algebra, of the well known fact that an irreducible irrational n-th root of a positive rational number cannot be solution of a…

History and Overview · Mathematics 2009-08-04 S. A. Belbas

We show that if a Laurent series $f\in\mathbb{C}((t))$ satisfies a particular kind of linear iterative equation, then $f$ is either a rational function or it is differentially transcendental over $\mathbb{C}(t)$. This condition is more…

Combinatorics · Mathematics 2023-12-04 Lucia Di Vizio , Gwladys Fernandes , Marni Mishna

Let $Q(x,y)$ be a quadratic form with discriminant $D\neq 0$. We obtain non trivial upper bound estimates for the number of solutions of the congruence $Q(x,y)\equiv\lambda \pmod{p}$, where $p$ is a prime and $x,y$ lie in certain intervals…

Number Theory · Mathematics 2011-02-08 Ana Zumalacárregui

We study the Abel differential equation x0 = A(t)x3 + B(t)x2 +C(t)x. Specifically, we find bounds on the number of its rational solutions when A(t), B(t) and C(t) are polynomials with real or complex coefficients; and on the number of…

Classical Analysis and ODEs · Mathematics 2026-03-02 Luis Angel Calderon

Let $K$ be a field of characteristic zero over which every diagonal form in sufficiently many variables admits a nontrivial solution. For example, $K$ may be a totally imaginary number field or a finite extension of a $p$-adic field.…

Number Theory · Mathematics 2025-09-01 Amichai Lampert

A monotone iterative method is proposed to solve nonlinear discrete boundary value problems with the support of upper and lower solutions. We establish some new existence results. Under some sufficient conditions, we establish maximum…

Numerical Analysis · Mathematics 2016-09-20 Mandeep Singh , Amit K. Verma

Let $x=t^n$, $y=\sum_{i=1}^{\infty}a_it^i$ be a parametrisation of the germ of a complex plane analytic curve $\Gamma$ at the origin. Then $\Gamma$ has the implicit equation $f(x,y)=0$ in the neighbourhood of the origin, where $f=\sum…

Algebraic Geometry · Mathematics 2024-12-10 Beata Gryszka , Janusz Gwoździewicz

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…

Number Theory · Mathematics 2025-04-25 Nicolae Ciprian Bonciocat

Consider a system of two polynomial equations in two variables: $$F(X,Y)=G(X,Y)=0$$ where $F \in \rr[X,Y]$ has degree $d \geq 1$ and $G \in \rr[X,Y]$ has $t$ monomials. We show that the system has only $O(d^3t+d^2t^3)$ real solutions when…

Computational Complexity · Computer Science 2014-07-24 Pascal Koiran , Natacha Portier , Sébastien Tavenas

Let f\in \mathbb{Z}[x,y] be an irreducible homogeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

Number Theory · Mathematics 2007-05-23 H. A. Helfgott
‹ Prev 1 4 5 6 7 8 10 Next ›