Related papers: Euclid's Number-Theoretical Work
The Euclid mission is a visionary project undertaken by the European Space Agency (ESA) to probe the universe's evolution and geometry by surveying the position and gravitational shape distortion of billions of galaxies. These observations…
Galaxy cluster counts in bins of mass and redshift have been shown to be a competitive probe to test cosmological models. This method requires an efficient blind detection of clusters from surveys with a well-known selection function and…
Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…
The Euclid space telescope will measure the shapes and redshifts of galaxies to reconstruct the expansion history of the Universe and the growth of cosmic structures. Estimation of the expected performance of the experiment, in terms of…
Determining the number of clusters is a fundamental issue in data clustering. Several algorithms have been proposed, including centroid-based algorithms using the Euclidean distance and model-based algorithms using a mixture of probability…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
Euclidean geometry consists of straightedge-and-compass constructions and reasoning about the results of those constructions. We show that Euclidean geometry can be developed using only intuitionistic logic. We consider three versions of…
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…
Interval calculus is a relatively new branch of mathematics. Initially understood as a set of tools to assess the quality of numerical calculations (rigorous control of rounding errors), it became a discipline in its own rights today.…
Euler's identity equates the number of partitions of any non-negative integer n into odd parts and the number of partitions of n into distinct parts. Beck conjectured and Andrews proved the following companion to Euler's identity: the…
Paul Erdos claimed that mathematics is not yet ready to settle the 3x+1 conjecture. I agree, but very soon it will be! With the exponential growth of computer-generated mathematics, we (or rather our silicon brethrern) would have a shot at…
In theoretical computer science, it is a common practice to show existential lower bounds for problems, meaning there is a family of pathological inputs on which no algorithm can do better. However, most inputs of interest can be solved…
We survey the main ideas in the early history of the subjects on which Riemann worked and that led to some of his most important discoveries. The subjects discussed include the theory of functions of a complex variable, elliptic and Abelian…
In this paper we present a new mathematical conception based on a new method for ordering the integers. The method relies on the assumption that negative numbers are beyond infinity, which goes back to Wallis and Euler. We also present a…
The purpose of this article is to put forward the claim that Hurwitz's paper "Uber die Erzeugung der Invarianten durch Integration." [Gott. Nachrichten (1897), 71-90] should be regarded as the origin of random matrix theory in mathematics.…
Edge-centric distributed computations have appeared as a recent technique to improve the shortcomings of think-like-a-vertex algorithms on large scale-free networks. In order to increase parallelism on this model, edge partitioning -…
In this Ph.D. dissertation (2018, Emory University) we prove theorems at the intersection of the additive and multiplicative branches of number theory, bringing together ideas from partition theory, $q$-series, algebra, modular forms and…
In 1763, Euler published "Dilucidationes de resistentia fluidorum" (Explanations on the resistance of fluids), a memoir that challenges the fluid resistance theories proposed by Isaac Newton and d'Alembert. Euler's work explores the…
The unit-derived method in coding theory is shown to be a unique optimal scheme for constructing and analysing codes. In many cases efficient and practical decoding methods are produced. Codes with efficient decoding algorithms at maximal…
We prove Euler's theorem of number theory developing an argument based on quandles. A quandle is an algebraic structure whose axioms mimic the three Reidemeister moves of knot theory.