English
Related papers

Related papers: Mahler's method and Carlitz logarithm

200 papers

In this paper, for a given Dirichlet character mod $N$ with $4\nmid N$, we give a lower bound of order $\sqrt{s/\log(s)}$ for the dimension of the $\mathbb{Q}(e^{2i\pi/N})$-vector space spanned by the values of its $L$-function at integers…

Number Theory · Mathematics 2025-12-03 Ludovic Mistiaen

The grouplike elements of a coalgebra over a field are known to be linearly independent over said field. Here we prove three variants of this result. One is a generalization to coalgebras over a commutative ring (in which case the linear…

Quantum Algebra · Mathematics 2021-08-03 Gérard Duchamp , Darij Grinberg , Vincel Minh

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…

Logic in Computer Science · Computer Science 2022-05-25 Luca Geatti , Alessandro Gianola , Nicola Gigante

The paper generalizes Lazarus Fuchs' theorem on the solutions of complex ordinary linear differential equations with regular singularities to the case of ground fields of arbitrary characteristic, giving a precise description of the shape…

Classical Analysis and ODEs · Mathematics 2023-10-31 Florian Fürnsinn , Herwig Hauser

A well-known conjecture of Gross and Zagier states that the values of the higher automorphic Green's function at pairs of points with complex multiplication in the upper half-plane are proportional to the logarithm of an algebraic number.…

Number Theory · Mathematics 2025-08-19 Francis Brown , Tiago J. Fonseca

Justification logics are an explication of modal logic; boxes are replaced with proof terms formally through realisation theorems. This can be achieved syntactically using a cut-free proof system e.g. using sequent, hypersequent or nested…

Logic in Computer Science · Computer Science 2025-07-15 Sonia Marin , Paaras Padhiar

We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…

Number Theory · Mathematics 2015-10-06 Samrith Ram

We solve the classical square-lattice dimer model with periodic boundaries and in the presence of a field $\boldsymbol{t}$ that couples to the (vector) flux, by diagonalizing a modified version of Lieb's transfer matrix. After deriving the…

Statistical Mechanics · Physics 2021-08-03 Neil Wilkins , Stephen Powell

We review some independence results in a finite axiom-schematization of classical first-order logic introduced by Norman Megill. We also prove that a certain axiom scheme of this system is independent although all of its instances are…

Logic · Mathematics 2026-03-09 Benoit Jubin

For each central essential hyperplane arrangement $\mathcal{A}$ over an algebraically closed field, let $Z_\mathcal{A}^{\hat\mu}(T)$ denote the Denef-Loeser motivic zeta function of $\mathcal{A}$. We prove a formula expressing…

Algebraic Geometry · Mathematics 2018-10-30 Max Kutler , Jeremy Usatine

Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…

Logic in Computer Science · Computer Science 2013-01-07 Zhaohua Luo

Motivated by Kapranov's discovery of an sh Lie algebra structure on the tangent complex of a K\"{a}hler manifold and Chen-Sti\'{e}non-Xu's construction of sh Leibniz algebras associated with a Lie pair, we find a general method to construct…

Quantum Algebra · Mathematics 2020-03-11 Zhuo Chen , Zhangju Liu , Maosong Xiang

Let $K$ be a field, and $A=K[a_1,\ldots ,a_n]$ a solvable polynomial algebra in the sense of [K-RW, {\it J. Symbolic Comput.}, 9(1990), 1--26]. Based on the Gr\"obner basis theory for $A$ and for free modules over $A$, an elimination theory…

Rings and Algebras · Mathematics 2019-01-15 Huishi Li

In this short note, we give a localized version of the basic triangle theorem, first published in 2011 (see [4]) in order to prove the independence of hyperlogarithms over various function fields. This version provides direct access to…

Symbolic Computation · Computer Science 2020-08-07 Gérard Duchamp , Nihar Gargava , Hoang Ngoc Minh , Pierre Simonnet

A comparison of Landin's form of lambda calculus with Church's shows that, independently of the lambda calculus, there exists a mechanism for converting functions with arguments indexed by variables to the usual kind of function where the…

Programming Languages · Computer Science 2015-06-01 M. H. van Emden

The Riemann Hypothesis can be reformulated as statements about the eigenvalues of certain matrices whose entries are defined in terms of the Taylor coefficients of the zeta function. These eigenvalues exhibit interesting visual patterns…

Number Theory · Mathematics 2007-09-04 Yuri Matiyasevich

Category theory gives a mathematical characterization of naturality but not of canonicity. The purpose of this paper is to develop the logical theory of canonical maps based on the broader demonstration that the dual notions of elements &…

Category Theory · Mathematics 2024-10-07 David Ellerman

A new proof is given for the correctness of the powers of two descent method for computing discrete logarithms. The result is slightly stronger than the original work, but more importantly we provide a unified geometric argument,…

Number Theory · Mathematics 2019-02-13 Thorsten Kleinjung , Benjamin Wesolowski

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an…

Logic in Computer Science · Computer Science 2015-07-01 Mikołaj Bojańczyk , Bartek Klin , Sławomir Lasota

A set of real $n$th roots that is pairwise linearly independent over the rationals must also be linearly independent. We show how this result may be extended to more general fields.

Number Theory · Mathematics 2011-11-09 Richard Carr , Cormac O'Sullivan
‹ Prev 1 8 9 10 Next ›