中文
相关论文

相关论文: Hilbert's Tenth Problem for function fields of cha…

200 篇论文

In this paper, we study the diagonal restrictions of certain Hilbert theta series for a totally real field $F$, and prove that they span the corresponding space of elliptic modular forms when the $F$ is quadratic or cubic. Furthermore, we…

数论 · 数学 2022-07-25 Gabriele Bogo , Yingkun Li

We consider random fields that can be represented as integrals of deterministic functions with respect to infinitely divisible random measures and show that these random fields are infinitely divisible.

概率论 · 数学 2010-08-13 Wolfgang Karcher , Hans-Peter Scheffler , Evgeny Spodarev

We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…

数论 · 数学 2026-04-22 Akio Nakagawa

In this paper we prove undecidability of finite systems of equations in free Lie algebras of rank at least three over an arbitrary field. We show that the ring of integers $\mathbb{Z}$ is interpretable by positive existential formulas in…

逻辑 · 数学 2017-08-25 Olga Kharlampovich , Alexei Myasnikov

Let $k$ denote an algebraically closed field. We revisit a construction of the author of families of elliptic curves over the rational function field $k(t)$. Combining a combinatorial analysis with a rank formula of Ulmer we prove that, for…

数论 · 数学 2011-05-31 Lisa Berger

We continue the research programme of comparing the complex exponential field with Zilber exponential. For the latter we prove, using diophantine geometry, various properties about zero sets of exponential functions, proved for C using…

环与代数 · 数学 2013-10-28 Paola D Aquino , Angus Macintyre , Giuseppina Terzo

We prove a Hopf bifurcation theorem in Hilbert spaces for abstract semilinear equations, which improves a classical result by Crandall and Rabinowitz in the case where basic spaces are Hilbert spaces. Actually, our theorem does not need any…

偏微分方程分析 · 数学 2020-12-15 Tadashi Kawanago

Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of…

数论 · 数学 2013-08-20 Étienne Fouvry , Emmanuel Kowalski , Philippe Michel

Using the technique of formative processes, I solve the decidability problem of MLS with unordered cartesian product in the positive. Moreover I give a pure combinatorial description of the satisfiable MLS with unordered cartesian…

组合数学 · 数学 2019-02-28 Pietro Ursino

We quantify a recent theorem of Wiles on class numbers of imaginary quadratic fields by proving an estimate for the number of negative fundamental discriminants down to -X whose class numbers are indivisible by a given prime and whose…

数论 · 数学 2017-11-07 Olivia Beckwith

Hilbert's Tenth Problem (HTP) asks for an algorithm to test whether an arbitrary polynomial Diophantine equation with integer coefficients has solutions over the ring $\mathbb Z$ of the integers. This was finally solved by Matiyasevich…

数论 · 数学 2021-01-29 Zhi-Wei Sun

In this paper, we study questions of definability and decidability for infinite algebraic extensions ${\bf K}$ of $\mathbb{F}_p(t)$ and their subrings of $\mathcal{S}$-integral functions. We focus on fields ${\bf K}$ satisfying a local…

数论 · 数学 2025-01-17 Alexandra Shlapentokh , Caleb Springer

We study the prime number race for elliptic curves over the function field of a proper, smooth and geometrically connected curve over a finite field. This constitutes a function field analogue of prior work by Mazur, Sarnak and the second…

数论 · 数学 2015-03-10 Byungchul Cha , Daniel Fiorilli , Florent Jouve

We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…

数论 · 数学 2009-07-02 Nils Bruin , Michael Stoll

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

计算机科学中的逻辑 · 计算机科学 2019-07-19 Mario Carneiro

We show that the nonlinear real arithmetic theory (NRA) as defined in the SMTLIB standard is undecidable. The undecidability arises from the treatment of division by zero as an uninterpreted function, which allows encoding integer…

计算机科学中的逻辑 · 计算机科学 2026-05-27 Dejan Jovanovic

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

计算复杂性 · 计算机科学 2017-02-03 Vishwas Bhargava , Gábor Ivanyos , Rajat Mittal , Nitin Saxena

This paper contains an account of arbitrary cubic function fields of characteristic three. We define a standard form for an arbitrary cubic curve and consider its function field. By considering an integral basis for the maximal order of…

数论 · 数学 2010-09-06 Mark Bauer , Jonathan Webster

We study several classes of indecomposable representations of quivers on infinite-dimensional Hilbert spaces and their relation. Many examples are constructed using strongly irreducible operators. Some problems in operator theory are…

算子代数 · 数学 2013-03-12 Masatoshi Enomoto , Yasuo Watatani

Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…

数论 · 数学 2007-05-23 David R. Kohel , Benjamin A. Smith