English
Related papers

Related papers: Conditional algorithmic Mordell

200 papers

We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…

Computational Complexity · Computer Science 2024-09-19 Jordan Cotler , Semon Rezchikov

Consider a smooth, geometrically irreducible, projective curve of genus $g \ge 2$ defined over a number field of degree $d \ge 1$. It has at most finitely many rational points by the Mordell Conjecture, a theorem of Faltings. We show that…

Number Theory · Mathematics 2021-04-02 Vesselin Dimitrov , Ziyang Gao , Philipp Habegger

We present results and examples which show that the consideration of a certain tubular mutation is advantageous in the study of noncommutative curves which parametrize the simple regular representations of a tame bimodule. We classify all…

Representation Theory · Mathematics 2008-06-16 Dirk Kussin

We show rigidity results for the operator equations T(f.g) = Tf.Tg, T(f*g) = Tf.Tg and T(f.g) = Tf*Tg for bijective operators T acting on sufficently large spaces of smooth functions. Typically a condition like |T(f.g) - Tf.Tg| < a for all…

Functional Analysis · Mathematics 2024-12-20 Hermann König , Vitali Milman

We consider a filtration on the cohomology of the structure sheaf indexed by (not necessarily reduced) divisors ``at infinity''. We show that the filtered pieces have transfers morphisms, fpqc descent, and are so called cube invariant. In…

Algebraic Geometry · Mathematics 2023-06-13 Shane Kelly , Hiroyasu Miyazaki

We conjecture that if C is a curve of genus >1 over a number field k such that C(k) is empty, then a method of Scharaschkin (equivalent to the Brauer-Manin obstruction in the context of curves) supplies a proof that C(k) is empty. As…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

Discrete Mathematics · Computer Science 2017-01-18 Joël Ouaknine , Amaury Pouly , João Sousa-Pinto , James Worrell

Profinite algebras are exactly those that are isomorphic to inverse limits of finite algebras. Such algebras are naturally equipped with Boolean topologies. A variety $\mathcal V$ is standard if every Boolean topological algebra with the…

Logic · Mathematics 2019-02-20 Anvar M. Nurakunov , Michał M. Stronkowski

A curve X over the field Q of rational numbers is modular if it is dominated by X_1(N) for some N; if in addition the image of its jacobian in J_1(N) is contained in the new subvariety of J_1(N), then X is called a new modular curve. We…

Number Theory · Mathematics 2007-05-23 Matthew Baker , Enrique Gonzalez-Jimenez , Josep Gonzalez , Bjorn Poonen

Given an integral variation of Hodge structure $\mathbb{V}$ on a complex algebraic variety $S$, polarized by some bilinear form $Q : \mathbb{V} \otimes \mathbb{V} \to \mathbb{Z}$, it is believed that the set $\mathcal{A}^{\textrm{iso}}_{0}…

Algebraic Geometry · Mathematics 2025-12-05 David Urbanik

Let us consider a specialization of an untwisted quantum affine algebra of type $ADE$ at a nonzero complex number, which may or may not be a root of unity. The Grothendieck ring of its finite dimensional representations has two bases,…

Quantum Algebra · Mathematics 2007-05-23 Hiraku Nakajima

We describe a method to axiomatize computations in deterministic Turing machines. When applied to computations in non-deterministic Turing machines, this method may produce contradictory (and therefore trivial) theories, considering…

Quantum Physics · Physics 2008-07-27 Juan C. Agudelo , Walter Carnielli

We compute quantum character varieties of arbitrary closed surfaces with boundaries and marked points. These are categorical invariants $\int_S\mathcal A$ of a surface $S$, determined by the choice of a braided tensor category $\mathcal A$,…

Quantum Algebra · Mathematics 2018-07-02 David Ben-Zvi , Adrien Brochier , David Jordan

The term `hypermachine' denotes any data processing device (theoretical or that can be implemented) capable of carrying out tasks that cannot be performed by a Turing machine. We present a possible quantum algorithm for a classically…

Quantum Physics · Physics 2009-11-10 Andrés Sicard , Mario Vélez , Juan Ospina

We prove a noncommutative variant of Saskin's classical theorem -- on the connection between Choquet boundaries for function spaces and Korovkin sets -- for operator systems generating separable Type I C*-algebras. The main result implies…

Operator Algebras · Mathematics 2015-05-22 Craig Kleski

For an abelian variety $A$ over a finitely generated field $K$ of characteristic $p > 0$, we prove that the algebraic rank of $A$ is at most a suitably defined analytic rank. Moreover, we prove that equality, i.e., the BSD rank conjecture,…

Algebraic Geometry · Mathematics 2025-08-04 Veronika Ertl , Timo Keller , Yanshuai Qin

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

Logic · Mathematics 2021-09-21 Michael C. Laskowski , Douglas S. Ulrich

We prove modularity of certain residually reducible ordinary 2-dimensional $p$-adic Galois representations with determinant a finite order odd character $\chi$. For certain non-quadratic $\chi$ we prove an $R=T$ result for $T$ the weight 1…

Number Theory · Mathematics 2022-03-18 Tobias Berger , Krzysztof Klosin

We consider Turing machines as actions over configurations in $\Sigma^{\mathbb{Z}^d}$ which only change them locally around a marked position that can move and carry a particular state. In this setting we study the monoid of Turing machines…

Group Theory · Mathematics 2019-04-26 Sebastián Barbieri , Jarkko Kari , Ville Salo

We comment on a recent paper that connects certain forms of machine learning to Set Theory. We point out that part of the set-theoretic machinery is related to a result of Kuratowski about decompositions of finite powers of sets and we show…

Logic · Mathematics 2024-08-27 Klaas Pieter Hart
‹ Prev 1 3 4 5 6 7 10 Next ›