相关论文: Some Problems in Number Theory I: The Circle Probl…
In this review I discuss intersection numbers of twisted cocycles and their relation to physics. After defining what these intersection number are, I will first discuss a method for computing them. This is followed by three examples where…
Let $\scr A^*=\{l_1,l_2,\cdots,l_n\}$ be a line arrangement in $\Bbb{CP}^2$, i.e., a collection of distinct lines in $\Bbb{CP}^2$. Let $L(\scr A^*)$ be the set of all intersections of elements of $A^*$ partially ordered by $X\leq…
We give an impression of the type of results that have been obtained with numerical lattice simulations of field theory in the early universe.
We point out four problems which have arisen during the recent research in the domain of Combinatorial Physics.
We consider the following question: Given $n$ lines and $n$ circles in $\mathbb{R}^3$, what is the maximum number of intersection points lying on at least one line and on at least one circle of these families. We prove that if there are no…
In this paper, we bring a complete solution to the Ovals problem, as formulated in [3] and [24].
Some important problems in quantitative QCD will certainly yield to hard work and adequate investment of resources, others appear difficult but may be accessible, and still others will require essentially new ideas. Here I identify several…
Gardner, Gronchi and Zong posed the problem to find a discrete analogue of M. Meyer's inequality bounding the volume of a convex body from below by the geometric mean of the volumes of its slices with the coordinate hyperplanes. Motivated…
We study the probability that a cycle of length k in the lattice [1, n]^s does not contain more lattice points than the k vertices of the cycle. Then we generalize this problem to other configurations induced by a given graph H,…
We pose a natural generalization to the well-studied and difficult no-three-in-a-line problem: How many points can be chosen on an $n \times n$ grid such that no three of them form an angle of $\theta$? In this paper, we classify which…
We present some results about the number of rational points on a certain family of curves defined over a finite field. In a small number of cases the curves have more rational points than expected. Fibonacci numbers make an appearance, as…
We consider the problem of counting the number of answers to a first-order formula on a finite structure. We present and study an extension of first-order logic in which algorithms for this counting problem can be naturally and conveniently…
In this notes we show how a problem regarding continued fractions of rational numbers, lead to several phenomena in number theory and dynamics, and eventually to the problem of shearing of divergent diagonal orbits in the space of adelic…
The construction of discrete velocity models or numerical methods for the Boltzmann equation, may lead to the necessity of computing the collision operator as a sum over lattice points. The collision operator involves an integral over a…
Several examples are used to illustrate how we deal cavalierly with infinities and unphysical systems in physics. Upon examining these examples in the context of infinities from Cantor's theory of transfinite numbers, the only known…
We prove that several results in different areas of number theory such as the divergent series, summation of arithmetic functions, uniform distribution modulo one and summation over prime numbers which are currently considered to be…
We classify the singular loci of real surfaces in three-space that contain two circles through each point. We characterize how a circle in such a surface meets this loci as it moves in its pencil and as such provide insight into the…
Given a finite set of points in general position in the plane or sphere, we count the number of ways to separate those points using two types of circles: circles through three of the points, and circles through none of the points (up to an…
In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures…
We study upper bounds on the number of lattice points for convex bodies having their centroid at the origin. For the family of simplices as well as in the planar case we obtain best possible results. For arbitrary convex bodies we provide…