English
Related papers

Related papers: Division-ample sets and the Diophantine problem fo…

200 papers

We answer a question posed by Y. Elias et al. in [8] about possible spectral distortions of algebraic numbers. We provide a closed form for the spectral distortion of certain classes of cyclotomic polynomials. Moreover, we present a bound…

Number Theory · Mathematics 2020-07-30 L. Babinkostova , Ariana Chin , Aaron Kirtland , Vladyslav Nazarchuk , Esther Plotnick

Polynome codes and code evaluation; arithmetical theory frames; $\mu$-recursive race for decision; decision correctness; decision termination; correct termination in theory $T = PR$ of Primitive Recursion; comparison with the negative…

General Mathematics · Mathematics 2014-07-18 Michael Pfender

We consider the model-theoretic Grothendieck ring of definable sets in ordered abelian groups. It is well-known that $\mathrm{K} \mathbb{Q} \cong \mathbb{Z}[T]/(T^2 + T)$ and $\mathrm{K} \mathbb{Z} =0$, but surprisingly little is known…

Logic · Mathematics 2026-03-31 Blaise Boissonneau , Mathias Stout , Floris Vermeulen

Let $E/k$ be a non-isotrivial elliptic curve over a global function field $k$ of characteristic $p>3$, and $G\subset \mathrm{Gal}(k^{\mathrm{sep}}/k)$ be a topologically finitely generated subgroup. We prove that if $E/k$ has analytic rank…

Number Theory · Mathematics 2026-04-01 Seokhyun Choi , Bo-Hae Im , Beomho Kim

For an elliptic curve $E$ over $K$, the Birch and Swinnerton-Dyer conjecture predicts that the rank of Mordell-Weil group $E(K)$ is equal to the order of the zero of $L(E_{/ K},s)$ at $s=1$. In this paper, we shall give a proof for elliptic…

Number Theory · Mathematics 2022-11-30 Kazuma Morita

By considering the norm of elements in the ring of integers in $\mathbb{Q}(\sqrt{-a})$, we give an algebraic approach to count the number of integral solutions of diophantine equations of the form $x^2+ay^2=n$ where $a$ is a Heegner number…

Number Theory · Mathematics 2022-08-05 Thanathat Dechakulkamjorn , Nithi Rungtanapirom

Let $K$ be a number field and let $G$ be a finitely generated subgroup of $K^\times$. For all but finitely many primes $\mathfrak p$ of $K$, the reduction $(G \bmod \mathfrak p)$ generates a well-defined subgroup of the multiplicative group…

Number Theory · Mathematics 2025-08-13 Pietro Sgobba

The paper deals with the {\it infinitesimal Hilbert 16th problem}: to find an upper estimate of the number of zeros of an Abelian integral regarded as a function of a parameter. In more details, consider a real polynomial $ H$ of degree $…

Dynamical Systems · Mathematics 2007-05-23 A. A. Glutsyuk , Yu. S. Ilyashenko

For a ring $R$, Hilbert's Tenth Problem $HTP(R)$ is the set of polynomial equations over $R$, in several variables, with solutions in $R$. We view $HTP$ as an operator, mapping each set $W$ of prime numbers to $HTP(\mathbb Z[W^{-1}])$,…

Logic · Mathematics 2019-08-20 Ken Kramer , Russell Miller

We compute the K-theory of ring C*-algebras for polynomial rings over finite fields. The key ingredient is a duality theorem which we had obtained in a previous paper. It allows us to show that the K-theory of these algebras has a ring…

Operator Algebras · Mathematics 2009-11-30 Joachim Cuntz , Xin Li

Let $E$ be an elliptic curve without CM that is defined over a number field $K$. For all but finitely many nonarchimedean places $v$ of $K$ there is the reduction $E(v)$ of $E$ at $v$ that is an elliptic curve over the residue field $k(v)$…

Number Theory · Mathematics 2016-03-08 Yuri G. Zarhin

Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…

Number Theory · Mathematics 2021-09-27 Szabolcs Tengely , Maciej Ulas

Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].

Number Theory · Mathematics 2008-09-11 Jeroen Demeyer

A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Such Diophantine sets have been used to construct high rank elliptic curves.…

Number Theory · Mathematics 2007-05-23 Philip Gibbs

A finite sampling theory associated with a unitary representation of a finite non Abelian group $\mathbf{G}$ on a Hilbert space is stablished. The non Abelian group $\mathbf{G}$ is a knit product $\mathbf{N}\bowtie \mathbf{H}$ of two finite…

Functional Analysis · Mathematics 2018-07-02 Antonio G. García , Miguel A. Hernández-Medina , Albert Ibort

Quantum theory may be formulated using Hilbert spaces over any of the three associative normed division algebras: the real numbers, the complex numbers and the quaternions. Indeed, these three choices appear naturally in a number of…

Quantum Physics · Physics 2015-05-27 John C. Baez

For a polarized complex Abelian variety A, of dimension g>1, we study the function N_A(t) counting the number of elliptic curves in A with degree bounded by t. We describe elliptic curves as solutions of Diophantine equations which, at…

Algebraic Geometry · Mathematics 2014-04-03 Lucio Guerra

A conjecture of Coleman implies that only finitely many quaternion algebras over the rational numbers can be the endomorphism $\mathbf{Q}$-algebras of abelian surfaces over the complex numbers which can be defined over $\mathbf{Q}$. One may…

Number Theory · Mathematics 2017-01-24 James Stankewicz

In this paper we study the Hilbert function of $\gr_{\mathfrak{m}}(R)$, when $R$ is a numerical semigroup ring or, equivalently, the coordinate ring of a monomial curve. In particular, we prove a sufficient condition for a numerical…

Commutative Algebra · Mathematics 2015-06-08 Marco D'Anna , Michela Di Marca , Vincenzo Micale

We show that Hilbert's Nullstellensatz, the problem of deciding if a system of multivariate polynomial equations has a solution in the algebraic closure of the underlying field, lies in the counting hierarchy. More generally, we show that…

Computational Complexity · Computer Science 2026-02-23 Robert Andrews , Abhibhav Garg , Éric Schost