English
Related papers

Related papers: Mixed Tate motives and the unit equation

200 papers

Given a finite set $S$ of distinct primes, we propose a method to construct polylogarithmic motivic Chabauty-Kim functions for $\mathbb{P}^1 \setminus \{ 0,1,\infty \}$ using resultants. For a prime $p\not\in S$, the vanishing loci of the…

We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…

Optimization and Control · Mathematics 2013-08-14 Dinh Dung , Bang Cong Vu

We extend the explicit quadratic Chabauty methods developed in previous work by the first two authors to the case of non-hyperelliptic curves. This results in an algorithm to compute the rational points on a curve of genus $g \ge 2$ over…

Number Theory · Mathematics 2017-11-17 Jennifer S. Balakrishnan , Netan Dogra , J. Steffen Müller , Jan Tuitman , Jan Vonk

Runge-Kutta methods have an irreplaceable position among numerical methods designed to solve ordinary differential equations. Especially, implicit ones are suitable for approximating solutions of stiff initial value problems. We propose a…

Numerical Analysis · Mathematics 2024-12-13 Hana Mizerová , Katarína Tvrdá

We propose a novel exact algorithm for the transportation problem, one of the paradigmatic network optimization problems. The algorithm, denoted Iterated Inside Out, requires in input a basic feasible solution and is composed by two main…

Optimization and Control · Mathematics 2023-03-30 Roberto Bargetto , Federico Della Croce , Rosario Scatamacchia

The Chabauty--Kim method is a tool for finding the integral or rational points on varieties over number fields via certain transcendental $p$-adic analytic functions arising from certain Selmer schemes associated to the unipotent…

Number Theory · Mathematics 2021-12-01 Netan Dogra

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…

Combinatorics · Mathematics 2026-04-21 Damir D. Dzhafarov , Jun le Goh

Building on earlier work concerning the motives of $G$-bundles, we study the structure of motives associated with certain classes of $G$-varieties. In particular, we show that the corresponding motives lie within the category of mixed-Tate…

Algebraic Geometry · Mathematics 2025-12-23 Somayeh Habibi

This article gives an introduction to arithmetic motivic integration in the context of p-adic integrals that arise in representation theory. A special case of the fundamental lemma is interpreted as an identity of Chow motives.

Representation Theory · Mathematics 2007-05-23 Thomas C. Hales

Classical polylogarithms give rise to a variation of mixed Hodge-Tate structures on the punctured projective line $S=\mathbb{P}^1\setminus \{0, 1, \infty\}$, which is an extension of the symmetric power of the Kummer variation by a trivial…

Algebraic Geometry · Mathematics 2026-05-27 Clément Dupont , Javier Fresán

This survey of methods surrounding lattice point methods for binomial ideals begins with a leisurely treatment of the geometric combinatorics of binomial primary decomposition. It then proceeds to three independent applications whose…

Commutative Algebra · Mathematics 2010-09-16 Ezra Miller

In this paper we prove the finiteness of the set of S-integral points of a punctured rational elliptic curve without complex multiplication using the Chabauty-Kim method. This extends previous results of Kim in the complex multiplication…

Number Theory · Mathematics 2020-06-09 Federico Amadio Guidi

Abramov's algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized…

Symbolic Computation · Computer Science 2017-06-29 Shaoshi Chen

Let $X$ be a smooth projective curve of genus $\geq2$ over a number field. A natural variant of Grothendieck's Section Conjecture postulates that every section of the fundamental exact sequence for $X$ which everywhere locally comes from a…

Number Theory · Mathematics 2026-04-14 L. Alexander Betts , Theresa Kumpitsch , Martin Lüdtke

Following the work of Gangl, Goncharov and Levin in [GGL], we will give a combinatorial framework for motivic study of iterated integrals on the affine line. We will show that under a certain genericity condition these combinatorial objects…

Number Theory · Mathematics 2007-05-23 Hidekazu Furusho , Amir Jafari

The local Tamagawa number conjecure, first formulated by Fontaine and Perrin-Riou, expresses the compatibility of the (global) Tamagawa number conjecture on motivic $L$-functions with the functional equation. The local conjecture was proven…

Number Theory · Mathematics 2016-09-07 Jay Daigle , Matthias Flach

In this paper, we extend the Paired-Explicit Runge-Kutta schemes by Vermeire et. al. to fourth-order of consistency. Based on the order conditions for partitioned Runge-Kutta methods we motivate a specific form of the Butcher arrays which…

We consider proper, algebraic semismall maps f from a complex algebraic manifold X. We show that the topological Decomposition Theorem implies a "motivic" decomposition theorem for the rational algebraic cycles of X and, in the case X is…

Algebraic Geometry · Mathematics 2007-05-23 Mark Andrea A. de Cataldo , Luca Migliorini

In this paper we give a direct geometric proof of the fact that tensoring with the Tate motive in the triangulated category of effective motives DM is a full embedding. The main part of the proof is given in the context of schemes of finite…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Voevodsky

Pitts' proof-theoretic technique for uniform interpolation, which generates uniform interpolants from terminating sequent calculi, has only been applied to logics on an intuitionistic basis through single-succedent sequent calculi. We adapt…

Logic in Computer Science · Computer Science 2026-05-28 Hugo Férée , Ian Shillito