Related papers: Counting an infinite number of points: a testing g…
This is a survey on recent results on counting of curves over finite fields. It reviews various results on the maximum number of points on a curve of genus g over a finite field of cardinality q, but the main emphasis is on results on the…
We develop a numerical method for solving a system of nonlinear integral equations involving two integral terms: at the current time t, one integral is taken from 0 to t, and a different integral is taken from t to infinity. We prove the…
A new summation method is introduced to convert a relatively wide family of infinite sums and local expansions into integrals. The integral representations yield global information such as analytic continuability, position of singularities,…
Building on classical aspects of the theory of Diophantine approximation, we consider the collection of all accumulation points of normalized integer vector translates of points $q\alpha$ with $\alpha\in\mathbb{R}^d$ and $q\in\mathbb{Z}$.…
Given a lattice polytope $P$ (with underlying lattice $\lo$), the universal counting function $\uu_P(\lo')=|P\cap \lo'|$ is defined on all lattices $\lo'$ containing $\lo$. Motivated by questions concerning lattice polytopes and the Ehrhart…
Localization is a topological technique that allows us to make global equivariant computations in terms of local data at the fixed points. For example, we may compute a global integral by summing integrals at each of the fixed points. Or,…
An asymptotic formula is presented for the number of planar lattice convex polygonal lines joining the origin to a distant point of the diagonal. The formula involves the non-trivial zeros of the zeta function and leads to a necessary and…
We have proposed a regularization technique and apply it to the Euler product of zeta functions in the part one. In this paper that is the second part of the trilogy, we give another evidence to demonstrate the Riemann hypotheses by using…
Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…
Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…
The theory of modular forms and spherical harmonic analysis are applied to establish new best bounds towards the counting and equidistribution of rational points on spheres and other higher dimensional ellipsoids, in what may be viewed as a…
Chirotopes are a common combinatorial abstraction of (planar) point sets. In this paper we investigate decomposition methods for chirotopes, and their application to the problem of counting the number of triangulations supported by a given…
Let $\mathcal{O}$ be the ring of integers for some number field $F$. Let $\chi(x)\in \mathcal{O}[x]$ be a regular monic polynomial of degree $n$. We study the asymptotic count of integral $n\times n$ matrices over $\mathcal{O}$ with the…
We update Sunley's explicit estimate for the ideal-counting function, which is the number of integral ideals of bounded norm in a number field.
In this paper we study the higher-order Euler numbers and polynomials and we introduce the mutiple zeta functions which interpolate higher-order Euler polynomials and numbers at negative integers
Summation by parts is used to find the sum of a finite series of generalized harmonic numbers involving a specific polynomial or rational function. The Euler-Maclaurin formula for sums of powers is used to find the sums of some finite…
Here we discuss a regularized version of the factorization method for positive operators acting on a Hilbert Space. The factorization method is a qualitative reconstruction method that has been used to solve many inverse shape problems. In…
We consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a lattice basis. To each integer point x in K we associate a family of inequalities (lex-cuts) that defines the convex hull of the integer…
Let $k$ be a number field and $K$ a finite extension of $k$. We count points of bounded height in projective space over the field $K$ generating the extension $K/k$. As the height gets large we derive asymptotic estimates with a…