English
Related papers

Related papers: The number of halving circles

200 papers

We build, using group-theoretic methods, a general framework for approaching multi-particle entanglement. As far as entanglement is concerned, two states of n spin-1/2 particles are equivalent if they are on the same orbit of the group of…

Quantum Physics · Physics 2016-10-26 N Linden , S Popescu

A well-known result from Brouwer states that any orientation preserving homeomorphism of the plane with no fixed points has an empty non-wandering set. In particular, an invariant compact set implies the existence of a fixed point. In this…

Dynamical Systems · Mathematics 2019-06-11 Alejo García

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$. We show that if $|R| < \frac{3}{2}n$ and $P…

Combinatorics · Mathematics 2021-10-13 Mehdi Makhul , Rom Pinchasi

Similarly to the classic notion in $E^d$, a subset of a positive diameter below $\frac{\pi}{2}$ of a hemisphere of the sphere $S^d$ is called complete, provided adding any extra point increases its diameter. Complete sets are convex bodies…

Metric Geometry · Mathematics 2020-10-08 Marek Lassak

Let N_d be the number of degree d, nodal, rational plane curves through 3d-1 points in the complex projective plane. The number of degree d>=3, nodal, elliptic plane curves with a fixed (general) j-invariant through 3d-1 points is found to…

alg-geom · Mathematics 2008-02-03 R. Pandharipande

Given a seven-element set $X = \{1,2,3,4,5,6,7\}$, there are 30 ways to define a Fano plane on it. Let us call a line of such Fano plane, that is to say an unordered triple from $X$, ordinary or defective according as the sum of two smaller…

Combinatorics · Mathematics 2016-08-24 Metod Saniga

A {\em convex hole} (or {\em empty convex polygon)} of a point set $P$ in the plane is a convex polygon with vertices in $P$, containing no points of $P$ in its interior. Let $R$ be a bounded convex region in the plane. We show that the…

Computational Geometry · Computer Science 2012-06-06 József Balogh , Hernán González-Aguilar , Gelasio Salazar

A set S of unit vectors in n-dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b, and inner products of distinct vectors of S are either a or b. The largest cardinality g(n) of spherical…

Metric Geometry · Mathematics 2009-04-02 Oleg R. Musin

Let $S$ be a set of $n$ points in the plane. We present several different algorithms for finding a pair of points in $S$ such that any disk that contains that pair must contain at least $cn$ points of $S$, for some constant $c>0$. The first…

Computational Geometry · Computer Science 2026-01-29 Prosenjit Bose , Guillermo Esteban , Tyler Tuttle

We consider arrangements of n hyperplanes of codimension one in a real projective space of dimension d. Let us denote by F the maximal possible number f of connected components of the complement in the projective space of dimension d to the…

Combinatorics · Mathematics 2015-01-06 I. Shnurnikov

Let $S$ be a finite set of points in the plane and let $\mathcal{T}(S)$ be the set of intersection points between pairs of lines passing through any two points in $S$. We characterize all configurations of points $S$ such that iteration of…

Metric Geometry · Mathematics 2007-05-23 Christopher J. Hillar , Darren L. Rhea

The big-line-big-clique conjecture states that for all $k,\ell\geq2$ there is an integer $n$ such that every finite set of at least $n$ points in the plane contains $\ell$ collinear points or $k$ pairwise visible points. We show that this…

Combinatorics · Mathematics 2010-08-19 Attila~Pór , David R. Wood

We show that a homology plane of general type has at worst a single cyclic quotient singular point. An example of such a surface with a singular point does exist. We also show that the automorphism group of a smooth contractible surface of…

Algebraic Geometry · Mathematics 2010-12-21 R. V. Gurjar , M. Koras , M. Miyanishi , P. Russell

Given n red and n blue points in general position in the plane, it is well-known that there is a perfect matching formed by non-crossing line segments. We characterize the bichromatic point sets which admit exactly one non-crossing…

Computational Geometry · Computer Science 2017-07-28 Andrei Asinowski , Tillmann Miltzow , Günter Rote

For k >= 3, a k-angulation is a 2-connected plane graph in which every internal face is a k-gon. We say that a point set P admits a plane graph G if there is a straight-line drawing of G that maps V(G) onto P and has the same facial cycles…

Combinatorics · Mathematics 2013-01-24 Michael S. Payne , Jens M. Schmidt , David R. Wood

A surface that is the pointwise sum of circles in Euclidean space is either coplanar or contains no more than 2 circles through a general point. A surface that is the pointwise product of circles in the unit-quaternions contains either 2,…

Algebraic Geometry · Mathematics 2024-09-16 Niels Lubbes

A set $S\subseteq V$ is called an {\em $q^+$-set} ({\em $q^-$-set}, respectively) if $S$ has at least two vertices and, for every $u\in S$, there exists $v\in S, v\neq u$ such that $N^+(u)\cap N^+(v)\neq \emptyset$ ($N^-(u)\cap N^-(v)\neq…

Combinatorics · Mathematics 2007-05-23 Gregory Gutin , Arash Rafiey , Simone Severini , Anders Yeo

A long standing conjecture of Richter and Thomassen states that the total number of intersection points between any $n$ simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same…

Combinatorics · Mathematics 2014-12-23 János Pach , Natan Rubin , Gábor Tardos

It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…

Combinatorics · Mathematics 2023-07-25 Jozsef Solymosi

A partial affine plane of order $n$ is a point-line incidence structure with $n^2$ points and $n$ points on each line, such that every two lines meet in at most one point. In this paper, we show that a partial affine plane of order $n$, $n$…

Combinatorics · Mathematics 2025-11-26 Cassie Grace , Klaus Metsch , Geertrui Van de Voorde