In the first part of this research we find an improvement to Huxley and Konyagin's current lower bound for the number of circles passing through five integer points. The improved lower bound is the conjectured asymptotic formula for the number of circles passing through five integer points. We generalise the result to circles passing through more than five integer points, giving the main theorem. In the second part of the research we consider questions linked to the distribution of different configurations of integer points of the circle passing through the unit square. We show that different configurations of points are distributed uniformly throughout the unit square for circles of fixed radius. Results are obtained by looking at the...
An ordinary circle of a set P of n points in the plane is defined as a circle that contains exactly ...
AbstractFor a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked ...
AbstractIn this paper we study how can one generalize the well-known Sylvester theorem for congruent...
In the first part of this research we find an improvement to Huxley and Konyagin's current lower bou...
AbstractIt is proved that for any integern≥0, there is a circle in the plane that passes through exa...
A uniformly distributed discrete set of points in the plane called lattices are considered. The most...
When a strictly convex plane set S moves by translation, the set J of points of the integer lattice ...
Abstract. We discuss the relationship between various additive problems concerning squares. 1. Squar...
AbstractEvery three of n points in the plane determine a circle. The maximum number f(n) of congruen...
A convex plane set S is discretized by first mapping the centre of S to a point (u, v), preserving o...
In this dissertation we investigate some problems from the field of combinatorics and computational ...
Continuing and extending the analysis in a previous paper [9], we establish several combinatorial re...
We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given ...
We prove that every set of n red and n blue points in the plane contains a red and a blue point such...
Combinatorial geometry is a broad and beautiful branch of mathematics. This PhD Thesis consists of t...
An ordinary circle of a set P of n points in the plane is defined as a circle that contains exactly ...
AbstractFor a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked ...
AbstractIn this paper we study how can one generalize the well-known Sylvester theorem for congruent...
In the first part of this research we find an improvement to Huxley and Konyagin's current lower bou...
AbstractIt is proved that for any integern≥0, there is a circle in the plane that passes through exa...
A uniformly distributed discrete set of points in the plane called lattices are considered. The most...
When a strictly convex plane set S moves by translation, the set J of points of the integer lattice ...
Abstract. We discuss the relationship between various additive problems concerning squares. 1. Squar...
AbstractEvery three of n points in the plane determine a circle. The maximum number f(n) of congruen...
A convex plane set S is discretized by first mapping the centre of S to a point (u, v), preserving o...
In this dissertation we investigate some problems from the field of combinatorics and computational ...
Continuing and extending the analysis in a previous paper [9], we establish several combinatorial re...
We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given ...
We prove that every set of n red and n blue points in the plane contains a red and a blue point such...
Combinatorial geometry is a broad and beautiful branch of mathematics. This PhD Thesis consists of t...
An ordinary circle of a set P of n points in the plane is defined as a circle that contains exactly ...
AbstractFor a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked ...
AbstractIn this paper we study how can one generalize the well-known Sylvester theorem for congruent...