English
Related papers

Related papers: Pairwise Rational Points on a Parabola

200 papers

We find a parametric solution of an arbitrary symmetric homogeneous diophantine equation of 5th degree in 6 variables using two primitive solutions. We then generalize this approach to symmetric forms of any odd degree by proving the…

Number Theory · Mathematics 2008-09-25 M. A. Reynya

Let $X$ be a smooth projective hypersurface defined over $\mathbb{Q}$. We provide new bounds for rational points of bounded height on $X$. In particular, we show that if $X$ is a smooth projective hypersurface in $\mathbb{P}^n$ with $n\geq…

Number Theory · Mathematics 2025-09-03 Matteo Verzobio

We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…

Number Theory · Mathematics 2025-12-04 Anders Mah

Consider a one-parameter family of smooth, irreducible, projective curves of genus $g\ge 2$ defined over a number field. Each fiber contains at most finitely many rational points by the Mordell Conjecture, a theorem of Faltings. We show…

Number Theory · Mathematics 2019-09-05 Vesselin Dimitrov , Ziyang Gao , Philipp Habegger

In this paper, the numbers of rational curves on general complete intersection Calabi-Yau threefolds in complex projective spaces are computed up to degree six. The results are all in agreement with the predictions made from mirror…

Algebraic Geometry · Mathematics 2015-11-05 Dang Tuan Hiep

We compute the rational points on certain members of the following family of hyperelliptic curves \[C_a \colon y^2 = x^8 + (4-4a^4) x^6 + (8a^4 + 6)x^4 + (4-4a^4)x^2 + 1\] via the method first developed by Dem'yanenko \cite{dem1966rational}…

Number Theory · Mathematics 2025-10-21 Roberto Hernandez

Divide and Conquer is a well known algorithmic procedure for solving many kinds of problem. In this procedure, the problem is partitioned into two parts until the problem is trivially solvable. Finding the distance of the closest pair is an…

Computational Geometry · Computer Science 2011-11-11 Mohammad Zaidul Karim , Nargis Akter

In this paper we give a complete characterization of the intersections between the Norm-Trace curve over $\mathbb{F}_{q^3}$ and the curves of the form $y=ax^3+bx^2+cx+d$, generalizing a previous result by Bonini and Sala, providing more…

Algebraic Geometry · Mathematics 2022-07-05 Matteo Bonini , Massimiliano Sala , Lara Vicino

We prove that any degree $d$ rational map having a parabolic fixed point of multiplier $1$ with a fully invariant and simply connected immediate basin of attraction is mateable with the Hecke group $H_{d+1}$, with the mating realized by an…

Dynamical Systems · Mathematics 2026-03-25 Shaun Bullett , Luna Lomonaco , Mikhail Lyubich , Sabyasachi Mukherjee

In the literature, there have been several methods and definitions for working out if two theories are "equivalent" (essentially the same) or not. In this article, we do something subtler. We provide means to measure distances (and explore…

Logic · Mathematics 2020-08-12 Michèle Friend , Mohamed Khaled , Koen Lefever , Gergely Székely

We determine the rational integers x,y,z such that x^3+y^9=z^2 and gcd(x,y,z)=1. First we determine a finite set of curves of genus 10 such that any primitive solution to x^3+y^9=z^2 corresponds to a rational point on one of those curves.…

Number Theory · Mathematics 2008-10-21 Nils Bruin

In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…

Combinatorics · Mathematics 2024-08-16 Thang Pham , Boqing Xue

Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…

Algebraic Geometry · Mathematics 2013-10-22 Abdallah Assi

Deng (arXiv:math/9812082) gave an asymptotic formula for the number of rational points on a weighted projective space over a number field with respect to a certain height function. We prove a generalization of Deng's result involving a…

Number Theory · Mathematics 2023-02-23 Peter Bruin , Irati Manterola Ayala

We prove that the Nash problem holds for two-dimensional rational double points in all characteristics. The proof is based on a direct computation of the families of arcs through these singularities.

Algebraic Geometry · Mathematics 2025-08-19 Tommaso de Fernex , Shih-Hsin Wang

In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and the goal is to find a pair of points, each from each subset,…

Optimization and Control · Mathematics 2025-09-09 Daniel Reem , Yair Censor

In this note we present a fast algorithm that finds for any $r$ the number $N_r$ of $\mathbb{F}_{q^r}$ rational points on a smooth absolutely irreducible curve $C$ defined over $\mathbb{F}_{q}$ assuming that we know $N_1,\cdots,N_g$, where…

Algebraic Geometry · Mathematics 2017-04-18 Santiago Molina , Narcís Sayols , Sebastià Xambó-Descamps

An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski open subset of an arbitrary smooth biquadratic hypersurface in sufficiently many variables. The proof uses…

Number Theory · Mathematics 2018-10-22 T. D. Browning , L. Q. Hu

In this paper we elucidate the advantage of examining the connections between Hilbert-Kamke equations and geometric designs, or Chebyshev-type quadrature, for classical orthogonal polynomials. We first establish that if a $5$-design with…

Number Theory · Mathematics 2026-04-03 Teruyuki Mishima , Xiao-Nan Lu , Masanori Sawa , Yukihiro Uchida

We study the number of distance queries needed to identify certain properties of a hidden tree $T$ on $n$ vertices. A distance query consists of two vertices $x,y$, and the answer is the distance of $x$ and $y$ in $T$. We determine the…

Data Structures and Algorithms · Computer Science 2025-09-30 Dániel Gerbner , András Imolay , Kartal Nagy , Balázs Patkós , Kristóf Zólomy
‹ Prev 1 8 9 10 Next ›