Related papers: Eight-Partitioning Points in 3D, and Efficiently T…

Many signal processing problems can be solved by maximizing the fitness of a segmented model over all possible partitions of the data interval. This letter describes a simple but powerful algorithm that searches the exponentially large…

The concept of a Point Cloud has played an increasingly important role in many areas of Engineering, Science, and Mathematics. Examples are: LIDAR, 3D-Printing, Data Analysis, Computer Graphics, Machine Learning, Mathematical Visualization,…

The three-disk scatterer has served as a paradigm for semiclassical periodic orbit quantization of classical chaotic systems using Gutzwiller's trace formula. It represents an open quantum system, thus leading to spectra of complex…

We set out an elementary approach to derive Visible Point Identities summed on lattice points of inverted triangle (2D), pyramid (3D), hyperpyramid (4D, 5D and so on) utilizing the greatest common divisor for the nD Visible Point Vectors.…

In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…

In this note, we obtain a formula which leads to a practical and efficient method to calculate the number of partitions of n into parts not divisible by m for given natural numbers n and m.

Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…

For each integer $k \in [0,9]$, we count the number of plane cubic curves defined over a finite field $\mathbb{F}_q$ that do not share a common component and intersect in exactly $k\ \mathbb{F}_q$-rational points. We set this up as a…

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…

We consider the Minimum Convex Partition problem: Given a set P of n points in the plane, draw a plane graph G on P, with positive minimum degree, such that G partitions the convex hull of P into a minimum number of convex faces. We show…

A set S of 2n+1 points in the plane is said to be in general position if no three points of S are collinear and no four are concyclic. A circle is called halving with respect to S if it has three points of S on its circumference, n-1 points…

Nice formulae for plane partitions with bounded size of parts (or boxed plane partitions), which generalize the norm-trace generating function by Stanley and the trace generating function by Gansner, are exhibited. The derivation of the…

The octonions are one of the four normed division algebras, together with the real, complex and quaternion number systems. The latter three hold a primary place in random matrix theory, where in applications to quantum physics they are…

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

A data structure is presented for point location in connected planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time that is within a constant factor of optimal. More…

We show that for any large $n$, there exists a set of $n$ points in the plane with $O(n^2/\sqrt{\log n})$ distinct distances, such that any four points in the set determine at least five distinct distances. This answers (in the negative) a…

The Hilbert scheme H^d_n of n points in A^d contains an irreducible component R^d_n which generically represents n distinct points in A^d. We show that when n is at most 8, the Hilbert scheme H^d_n is reducible if and only if n = 8 and d >=…

The figure eight is a remarkable solution to the Newtonian three-body problem in which the three equal masses chase each around a planar curve having the qualitative shape and symmetries of a figure eight. Here we prove that each lobe of…

Two elements, $x$ and $y$, are separated by a set $S$ if it contains exactly one of $x$ and $y$. We prove that any set of $n$ points in general position in the plane can be separated by $O(n\log\log n/\log n)$ convex sets, and for some…

Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…