Related papers: Mixed Tate motives and the unit equation
A systematic study of the discrete second order projective system is presented, complemented by the integrability analysis of the associated multilinear mapping. Moreover, we show how we can obtain third order integrable equations as the…
We optimize the running time of the primal-dual algorithms by optimizing their stopping criteria for solving convex optimization problems under affine equality constraints, which means terminating the algorithm earlier with fewer…
In this paper, we present a general approach to establish motivic cohomology and build part of its six operations formalism. Applying this together with symplectic orientation on MW-motivic cohomology, we discuss the embedding theorem of…
Starting with the recursive extended Euclid's algorithm, we apply a systematic approach using matrix notation to transform it into an iterative algorithm. The partial correctness proof derived from the transformation turns out to be very…
In this paper, we develop a new type of accelerated algorithms to solve some classes of maximally monotone equations as well as monotone inclusions. Instead of using Nesterov's accelerating approach, our methods rely on a so-called…
The Kaneko-Zagier conjecture states that finite and symmetric multiple zeta values satisfy the same relations. In the previous work with H.~Bachmann and Y.~Takeyama, we proved that the finite and symmetric multiple zeta value are obtained…
The purpose of the present work is to provide short and supple teaching notes for a $30$ hours introductory course on elementary \textit{Enumerative Algebraic Combinatorics}. We fully adopt the \textit{Rota way}. The themes are organized…
This paper explores goal-directed proof search in first-order multi-modal logic. The key issue is to design a proof system that respects the modularity and locality of assumptions of many modal logics. By forcing ambiguities to be…
A simple and elementary proof of Butcher's theorem on the order conditions of Runge-Kutta methods is presented. It is based on a recursive definition of rooted trees and avoids combinatorial tools such as labelings and Faa di Bruno's…
We compute the motivic Donaldson-Thomas theory of the resolved conifold, in all chambers of the space of stability conditions of the corresponding quiver. The answer is a product formula whose terms depend on the position of the stability…
We propose a unifying setting for dealing with monodromically atypical intersections that goes beyond the usual Zilber-Pink conjecture. In particular we obtain a new proof of finiteness of the maximal atypical orbit closures in each stratum…
We study the problem of optimally projecting the transition matrix of a finite ergodic multivariate Markov chain onto a lower-dimensional state space, as well as the problem of finding an optimal partition of coordinates such that the…
In this article we further the study of non-commutative motives. Our main result is the construction of a simple model, given in terms of infinite matrices, for the suspension in the triangulated category of non-commutative motives. As a…
A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…
We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…
The logic of Bunched Implications (BI) freely combines additive and multiplicative connectives, including implications; however, despite its well-studied proof theory, proof-search in BI has always been a difficult problem. The focusing…
We consider the problem of matrix completion on an $n \times m$ matrix. We introduce the problem of Interpretable Matrix Completion that aims to provide meaningful insights for the low-rank matrix using side information. We show that the…
We present an auxiliary space theory that provides a unified framework for analyzing various iterative methods for solving linear systems that may be semidefinite. By interpreting a given iterative method for the original system as an…
In this thesis we compare V. Voevodsky's geometric motives to the derived category of M. Nori's abelian category of mixed motives by constructing a triangulated tensor functor between them. It will be compatible with the Betti realizations…
By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…