English
Related papers

Related papers: Counting an infinite number of points: a testing g…

200 papers

In the renormalisation analysis of critical phenomena in quasi-periodic systems, a fundamental role is often played by fixed points of functional recurrences of the form \begin{equation*} f_{n}(x) = \sum_{i=1}^\ell a_i(x) f_{n_i}…

Dynamical Systems · Mathematics 2013-11-12 Paul Verschueren , Ben D. Mestel

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

Combinatorics · Mathematics 2021-12-03 James East , Michael Hendriksen , Laurence Park

We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of degree d, with rational coefficients of bit size bounded by…

Symbolic Computation · Computer Science 2026-05-27 Jérémy Berthomieu , Edern Gillot , Mohab Safey El Din

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

Number Theory · Mathematics 2018-09-06 W. D. Banks , J. B. Friedlander , C. Pomerance , I. E. Shparlinski

We define discrete nested sums over integer points for symbols on the real line, which obey stuffle relations whenever they converge. They relate to Chen integrals of symbols via the Euler-MacLaurin formula. Using a suitable holomorphic…

Number Theory · Mathematics 2009-12-11 Dominique Manchon , Sylvie Paycha

The area of inverse problems in mathematics is highly interdisciplinary. In various fields of science, engineering, medicine, and industry, there arises a need to reconstruct information about unknown entities that cannot be directly…

Numerical Analysis · Mathematics 2024-09-17 Manabu Machida

There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…

Logic · Mathematics 2020-03-30 Ivan Georgiev , Lars Kristiansen , Frank Stephan

In this paper, we describe an elementary method for counting the number of non-isomorphic algebras of a fixed dimension over a given finite field. We show how this method works for the explicit example of $2$-dimensional algebras over the…

Rings and Algebras · Mathematics 2019-09-30 Nikolaas D. Verhulst

We study rational points on the elliptic surface given by the equation: $$y^2 = x^3 + AxQ(u,v)^2 + BQ(u,v)^3,$$ where $A,B\in \mathbb{Z}$ satisfy that $4A^3-27B^2\neq 0$ and $Q(u,v)$ is a positive-definite quadratic form. We prove…

Number Theory · Mathematics 2026-04-22 Katharine Woo

We study zeta functions enumerating subalgebras or ideals of Lie algebras over finite field of prime order $\mathbb{F}_p$. We first develop a general blueprint method for computing zeta functions of $\mathbb{F}_p$-Lie algebras, and…

Rings and Algebras · Mathematics 2025-04-25 Seungjai Lee

We introduce an infinite set of integer mappings that generalize the well-known Collatz-Ulam mapping and we conjecture that an infinite subset of these mappings feature the remarkable property of the Collatz conjecture, namely that they…

Number Theory · Mathematics 2008-10-30 M. Bruschi

We prove uniform versions of two classical results in analytic number theory. The first is an asymptotic for the number of points of a complete lattice $\Lambda \subseteq \mathbb{R}^d$ inside the $d$-sphere of radius $R$. In contrast to…

Number Theory · Mathematics 2025-07-28 David Lowry-Duda , Takashi Taniguchi , Frank Thorne

We introduce the unified double zeta function of Mordell--Tornheim type and compute its values at non-positive integer points. We then discuss a possible generalization of the Kaneko--Zagier conjecture for all integer points.

Number Theory · Mathematics 2022-06-13 Shin-ya Kadota , Takuya Okamoto , Masataka Ono , Koji Tasaka

We study Galois points for a hypersurface $X$ with $\dim {\rm Sing}(X) \le \dim X-2$. The purpose of this article is to determine the set $\Delta(X)$ of Galois points in characteristic zero: Indeed, we give a sharp upper bound of the number…

Algebraic Geometry · Mathematics 2014-01-21 Satoru Fukasawa , Takeshi Takahashi

We compute the special values at nonpositive integers of the partial zeta function of an ideal of a real quadratic field applying an asymptotic version of Euler-Maclaurin formula to the lattice cone associated to the ideal considered. The…

Number Theory · Mathematics 2012-09-25 Byungheup Jun , Jungyun Lee

In this paper I argue that infinities in the classical computation theory such as the unsolvability of the Halting Problem can be addressed in the same way as Feynman divergences in Quantum Field Theory, and that meaningful versions of…

Quantum Algebra · Mathematics 2009-08-25 Yuri I. Manin

In this paper, we focus on the existence of accumulation points of the subset defined by the real projection of the zeros of the partial sums of the Riemann zeta functions. That would imply the existence of an infinite amount of zeros of…

Complex Variables · Mathematics 2011-02-15 Eric Dubon , Gaspar Mora , Juan Matías Sepulcre , Jose Ignacio Úbeda , Tomas Vidal

We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…

Classical Analysis and ODEs · Mathematics 2020-04-21 Luca Brandolini , Leonardo Colzani , Sinai Robins , Giancarlo Travaglini

We extend the theoretical framework of proof mining by establishing general logical metatheorems that allow for the extraction of the computational content of theorems with prima facie "non-computational" proofs from probability theory,…

Logic · Mathematics 2026-01-14 Morenikeji Neri , Nicholas Pischke

Let a polytope $P$ be defined by a system $A x \leq b$. We consider the problem of counting the number of integer points inside $P$, assuming that $P$ is $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank…

Computational Complexity · Computer Science 2023-05-09 D. V. Gribanov , D. S. Malyshev