English
Related papers

Related papers: On relative computability for curves

200 papers

Putnam and Finkelstein can be read as providing an answer to Kripke's skeptical argument by appealing to the way mathematics is commonly pursued. Nowadays, the debate surrounding pluralism has questioned the postulation of a unique way of…

History and Overview · Mathematics 2023-04-20 M. Muñoz Pérez

We generalize some results of Gray and McGibbon-Roitberg on relations between phantom maps and rational homotopy to relative phantom maps. Since the $\lim^1$ and the profinite completion techniques do not apply to relative phantom maps, we…

Algebraic Topology · Mathematics 2020-10-30 Daisuke Kishimoto , Takahiro Matsushita

We prove a few uniform versions of the Mordell-Lang Conjecture and of the Shafarevich Conjecture for curves over function fields and their rational points. The main focus is on function fields having high transcendence degree over the…

Algebraic Geometry · Mathematics 2007-05-23 Lucia Caporaso

We consider adjustable robust linear complementarity problems and extend the results of Biefel et al. (2022) towards convex and compact uncertainty sets. Moreover, for the case of polyhedral uncertainty sets, we prove that computing an…

Optimization and Control · Mathematics 2023-11-02 Christian Biefel , Martin Schmidt

We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…

Optimization and Control · Mathematics 2021-03-16 Mohan Dantam , Amaury Pouly

This is an extended version of an invited lecture I gave at the Journees Arithmetiques in St. Etienne in July 2009. We discuss the state of the art regarding the problem of finding the set of rational points on a (smooth projective)…

Number Theory · Mathematics 2016-08-03 Michael Stoll

We study the computational complexity of a robust version of the problem of testing two univariate C-finite functions for eventual inequality at large times. Specifically, working in the bit-model of real computation, we consider the…

Computational Complexity · Computer Science 2023-07-04 Eike Neumann

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

Formal Languages and Automata Theory · Computer Science 2017-03-01 Jörg Endrullis , Jeffrey Shallit , Tim Smith

We prove a quantitative theorem for Diophantine approximation by rational points on spheres. Our results are valid for arbitrary unimodular lattices and we further prove 'spiraling' results for the direction of approximates. These results…

Number Theory · Mathematics 2022-08-01 Mahbub Alam , Anish Ghosh

This note pushes further the discussion about relations between Dirichlet improvable, badly approximable and singular points held in recent joint work with Beresnevich, Guan, Velani and Ramirez, by considering Diophantine sets extending the…

Number Theory · Mathematics 2022-08-24 Antoine Marnat

By considering mirror symmetry applied to conformal field theories corresponding to strings propagating in quintic hypersurfaces in projective 4-space, Candelas, de la Ossa, Green and Parkes calculated the ``number of rational curves on the…

High Energy Physics - Theory · Physics 2008-02-03 Sheldon Katz

On a complex symplectic manifold we prove a finiteness result for the global sections of solutions of holonomic DQ-modules in two cases: (a) by assuming that there exists a Poisson compactification (b) in the algebraic case. This extends…

Algebraic Geometry · Mathematics 2021-05-19 Masaki Kashiwara , Pierre Schapira

We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…

Group Theory · Mathematics 2020-03-25 Albert Garreta , Alexei Miasnikov , Denis Ovchinnikov

In 1922, Mordell conjectured the striking statement that for a polynomial equation $f(x,y)=0$, if the topology of the set of complex number solutions is complicated enough, then the set of rational number solutions is finite. This was…

Number Theory · Mathematics 2020-06-03 Bjorn Poonen

We show that an earlier conjecture of the author, on diophantine approximation of rational points on varieties, implies the ``abc conjecture'' of Masser and Oesterl'e. In fact, a weak form of the former conjecture is sufficient, involving…

Number Theory · Mathematics 2007-05-23 Paul Vojta

The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for…

Number Theory · Mathematics 2019-02-12 S. Subburam , J. Tanti

We bring additional support to the conjecture saying that a rational cuspidal plane curve is either free or nearly free. This conjecture was confirmed for curves of even degree, and in this note we prove it for many odd degrees. In…

Algebraic Geometry · Mathematics 2019-09-17 Alexandru Dimca , Gabriel Sticlaru

We investigate the problem of deciding whether the restriction of a rational function $r\in\mathbb{K}(x,y)$ to the curve associated with an irreducible polynomial $p\in\mathbb{K}[x,y]$ is the restriction of an element of…

Algebraic Geometry · Mathematics 2025-10-15 Manfred Buchacher

We propose an approach for showing rationality of an algebraic variety $X$. We try to cover $X$ by rational curves of certain type and count how many curves pass through a generic point. If the answer is $1$, then we can sometimes reduce…

Algebraic Geometry · Mathematics 2018-12-11 Anton Mellit

We study one-variable equations over the lamplighter group $\MZ_2 \wr \MZ$. While the decidability of arbitrary equations over $L_2$ remains open, we prove that the Diophantine problem for single equations in one variable is decidable. Our…

Group Theory · Mathematics 2026-01-21 Alexander Ushakov , Yankun Wang
‹ Prev 1 4 5 6 7 8 10 Next ›