English
Related papers

Related papers: First-order definability of Darmon points in numbe…

200 papers

Let K be a subfield of the real field, D be a discrete subset of K and f : D^n -> K be a function such that f(D^n) is somewhere dense. Then (K,f) defines the set of integers. We present several applications of this result. We show that K…

Logic · Mathematics 2011-12-23 Philipp Hieronymi

In this work we continue the syntactic study of completeness that began with the works of Immerman and Medina. In particular, we take a conjecture raised by Medina in his dissertation that says if a conjunction of a second-order and a…

Logic in Computer Science · Computer Science 2015-07-01 Nerio Borges , Blai Bonet

This is a common introduction to math.RT/0101170, math.RT/0306333, math.RT/0506043, math.RT/0601028. Compared to these references there are new results including (i) a description of a separable closure of an extension of transcendence…

Representation Theory · Mathematics 2007-05-23 M. Rovinsky

Let $f_t$ be a one-parameter family of rational maps defined over a number field $K$. We show that for all $t$ outside of a set of natural density zero, every $K$-rational preperiodic point of $f_t$ is the specialization of some…

Number Theory · Mathematics 2025-08-22 Matt Olechnowicz

We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is divisible only by powers of a given fixed prime. This combines a wide variety of techniques from Diophantine approximation (bounds for linear…

Number Theory · Mathematics 2023-09-20 Michael A. Bennett , S. Siksek

Let $K$ be a function field of characteristic $p\geq0$ or a number field over which the $abc$ conjecture holds, and let $\phi(x)=x^d+c \in K[x]$ be a unicritical polynomial of degree $d\geq2$ with $d \not\equiv 0,1\pmod{p}$. We completely…

Number Theory · Mathematics 2024-11-07 John R. Doyle , Wade Hindes

We extend the algorithm of Darmon-Green and Darmon-Pollack for computing p-adic Darmon points on elliptic curves to the case of composite conductor. We also extend the algorithm of Darmon-Logan for computing ATR Darmon points to treat…

Number Theory · Mathematics 2012-09-21 Xavier Guitart , Marc Masdeu

We present new constructions of complex and p-adic Darmon points on elliptic curves over base fields of arbitrary signature. We conjecture that these points are global and present numerical evidence to support our conjecture.

Number Theory · Mathematics 2017-05-17 Xavier Guitart , Marc Masdeu , Mehmet Haluk Sengun

Given an S-arithmetic group, we ask how much information on the ambient algebraic group, number field of definition, and set of places S is encoded in the commensurability class of the profinite completion. As a first step, we show that the…

Group Theory · Mathematics 2020-07-24 Holger Kammeyer

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

Logic · Mathematics 2018-04-18 Lars Kristiansen , Juvenal Murwanashyaka

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

Logic · Mathematics 2011-05-16 Alexandra Shlapentokh , Carlos Videla

In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of…

Logic · Mathematics 2011-04-26 Zhaohua Luo

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

Motivated by the "composition theorems" of Chernikov-Hempel and Abd Aldaim-Conant-Terry we introduce $k$-trace definability between first order theories. Any theory which is $k$-trace definable in a NIP theory is $k$-NIP and any theory…

Logic · Mathematics 2026-05-20 Erik Walsberg

Let $A$ be abelian variety over the function field $K$ of a compact Riemann surface $B$. Fix a model $f \colon \mathcal{A} \to B$ of $A/K$ and a certain effective horizontal divisor $\DD \subset \mathcal{A}$. We give a sufficient condition…

Algebraic Geometry · Mathematics 2019-12-09 Xuan Kien Phung

In 1926 Khintchine introduced a topological argument proving the existence of uncountably many nontrivial singular linear forms of $n \geq 2$ variables. Throughout the years, this argument has been extensively modified and generalized. Most…

Number Theory · Mathematics 2026-03-30 Leo Hong , Dmitry Kleinbock , Vasiliy Neckrasov

We consider a finite universe U (more exactly - a family U of them) and second order quantifiers Q_K, where for each U this means quantifying over a family of n(K)-place relations closed under permuting U. We define some natural orders and…

Logic · Mathematics 2016-09-07 Saharon Shelah

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

Symbolic Computation · Computer Science 2020-09-03 Jean-Charles Faugère , George Labahn , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

Let $f \colon X \dashrightarrow X$ be a dominant rational self-map of a smooth projective variety defined over $\overline{\mathbb Q}$. For each point $P\in X(\overline{\mathbb Q})$ whose forward $f$-orbit is well-defined, Silverman…

Algebraic Geometry · Mathematics 2018-09-05 John Lesieutre , Matthew Satriano

None of the first-order modal logics between $\mathsf{K}$ and $\mathsf{S5}$ under the constant domain semantics enjoys Craig interpolation or projective Beth definability, even in the language restricted to a single individual variable. It…

Logic in Computer Science · Computer Science 2025-10-15 Agi Kurucz , Frank Wolter , Michael Zakharyaschev
‹ Prev 1 4 5 6 7 8 10 Next ›