Related papers: Computational Geometry Column 32

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

New lower bounds involving sum, difference, product, and ratio sets for $A\subset \C$ are given.

We show that any rational cubic hypersurface of dimension at least 33 defined over a number field $K$ vanishes on a $K$-rational projective line, reducing the previous lower bound of Wooley by two. For $K=\mathbb Q$ we can reduce the bound…

A new proof of Oka's lemma is given for smoothly bounded, pseudoconvex domains $D\subset\mathbb{C}^n$. The method of proof is then also applied to other convexity-like hypotheses on the boundary of $D$.

A K3 surface over a number field has infinitely many rational points over a finite field extension. For K3 surfaces of degree 2, arising as double covers of $\mathbb{P}^2$ branched along a smooth sextic curve, we give a bound for the degree…

We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…

A slope $p/q$ is characterising for a knot $K \subset \mathbb{S}^3$ if the orientation-preserving homeomorphism type of the manifold $\mathbb{S}^3_K(p/q)$ obtained by performing Dehn surgery of slope $p/q$ along $K$ uniquely determines the…

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

Over the last few years Explainable Clustering has gathered a lot of attention. Dasgupta et al. [ICML'20] initiated the study of explainable $k$-means and $k$-median clustering problems where the explanation is captured by a threshold…

We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…

Let $k$ be any field. Let $X \subset \mathbb{P}_k^N$ be a degree $d \geq 2$ hypersurface. Under some conditions, we prove that if $X(K) \neq \emptyset$ for some extension $K/k$ with $n:=[K:k] \geq 2$ and $\gcd(n,d)=1$, then $X(L) \neq…

We prove that the theory of the Farey graph is pseudofinite by constructing a sequence of finite structures that satisfy increasingly large subsets of its first-order axiomatization. This graph is an important object in the study of curve…

For any $k\ge 3$ and $\ell \in [k-1]$ such that $(k,\ell) \ne (3,1)$, we show that any sufficiently large $k$-graph $G$ must contain a Hamilton $\ell$-cycle provided that it has no isolated vertices and every set of $k-1$ vertices contained…

The point sets of all known optimal rectilinear drawings of $K_n$ share an unmistakeable clustering property, the so--called {\em 3--decomposability}. It is widely believed that the underlying point sets of all optimal rectilinear drawings…

Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numbers: R(3,10) <= 42, R(3,11) <= 50, R(3,13) <= 68, R(3,14) <= 77, R(3,15) <= 87, and R(3,16) <= 98. All of them are improvements by one over…

Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…

We give a new proof of the existence of designs, which is much shorter and gives better bounds.

Using geometric engineering method of 4D $\mathcal{N}=2$ quiver gauge theories and results on the classification of Kac-Moody (KM) algebras, we show on explicit examples that there exist three sectors of $\mathcal{N}=2$ infrared CFT$_{4}$s.…