We give a close formula for the N\'eron-Tate height of tautological integral cycles on Jacobians curves over number fields as well new lower bound arithmetic self-intersection $\hat{\omega}^2$ dualizing sheaf curve in terms Zhang's invariant $\varphi$. As an application, we obtain effective Bogomolov-type result cycles. deduce these results from more general combinatorial computation intersecti...

We observe that the classical Faulhaber’s theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression a+b, a+2b, . . . , a+nb is a polynomial in na+ n(n + 1)b/2. While this assertion can be deduced from the original Fauhalber’s theorem, we give an alternative formula in terms of the Bernoulli polynomials. Moreover, b...

An arithmetic circuit is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest subalgebra of the complex algebra of the semiring of natural numbers. In the present paper we investigate the algebraic structure of complex algebras of natural num...

Is calculation possible without language? Or is the human ability for arithmetic dependent on the language faculty? To clarify the relation between language and arithmetic, we studied numerical cognition in speakers of Mundurukú, an Amazonian language with a very small lexicon of number words. Although the Mundurukú lack words for numbers beyond 5, they are able to compare and add large approxi...