Related papers: Classification of crescent configurations
A circulant nut graph is a non-trivial simple graph such that its adjacency matrix is a circulant matrix whose null space is spanned by a single vector without zero elements. Regarding these graphs, the order-degree existence problem can be…
The parameter space of $n$ ordered points in projective $d$-space that lie on a rational normal curve admits a natural compactification by taking the Zariski closure in $(\mathbb{P}^d)^n$. The resulting variety was used to study the…
The famous Szemer\'{e}di-Trotter theorem states that any arrangement of $n$ points and $n$ lines in the plane determines $O(n^{4/3})$ incidences, and this bound is tight. In this paper, we prove the following Tur\'an-type result for…
In this paper the problem of the existence of regular nut graphs is addressed. A generalization of Fowler's Construction which is a local enlargement applied to a vertex in a graph is introduced to generate nut graphs of higher order. Let…
In the present paper we construct differential invariants for generic rank 2 vector distributions on n-dimensional manifold. In the case n=5 (the first case containing functional parameters) E. Cartan found in 1910 the covariant…
In 1982, Ungar proved that the connecting lines of a set of $n$ noncollinear points in the plane determine at least $2\lfloor n/2 \rfloor$ directions (slopes). Sets achieving this minimum for $n$ odd (even) are called…
Fixed points for scalar theories in $4-\varepsilon$, $6-\varepsilon$ and $3-\varepsilon$ dimensions are discussed. It is shown how a large range of known fixed points for the four dimensional case can be obtained by using a general…
A set of $n$-lattice points in the plane, no three on a line and no four on a circle, such that all pairwise distances and all coordinates are integral is called an $n$-cluster (in $\mathbb{R}^2$). We determine the smallest existent…
Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer points in sparse difference sets. More precisely, given any…
We consider $n$ independent random points uniformly distributed in the $d_n$-dimensional unit cube and study Pareto points, that is, points that do not coordinatewise dominate any other point. We identify the critical growth rate of $d_n$…
Starting from the classical notion of an oriented congruence (i.e. a foliation by oriented curves) in $R^3$, we abstract the notion of an oriented congruence structure. This is a 3-dimensional CR manifold $(M,H, J)$ with a preferred…
We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…
The notion of abundance of certain type of configuration in certain large sets was first proved by Furstenberg and Glazner in 1998. After that many author investigate abundance of different types of configurations in different types of…
The characterization of the finite minimal automorphic posets of width three is still an open problem. Niederle has shown that this task can be reduced to the characterization of the nice sections of width three which have a non-trivial…
We study a family of variants of Erd\H os' unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, we look for…
We answer two questions of Beardon and Minda that arose from their study of the conformal symmetries of circular regions in the complex plane. We show that a configuration of closed balls in the $N$-sphere is determined up to M\"{o}bius…
A collection of sets is {\em intersecting} if every two members have nonempty intersection. We describe the structure of intersecting families of $r$-sets of an $n$-set whose size is quite a bit smaller than the maximum ${n-1 \choose r-1}$…
The recent result that n congruent balls in R^d have at most 4 distinct geometric permutations is described.
As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…
Erdos, Herzog and Piranian asked whether, for $n$ points in the plane with fixed diameter (maximum distance between points), an arrangement of a regular $n$-gon maximizes their product of all pairs of distances. Recently, it was discovered…