English
Related papers

Related papers: The number of generalized balanced lines

200 papers

Let $S$ be a set of $n$ points in general position in the plane. Join every pair of points in $S$ with a straight line segment. Let $\overline{cr}(S)$ be number of pairs of these edges that intersect in their interior. Suppose that this…

Computational Geometry · Computer Science 2017-11-15 Frank Duque , Ruy Fabila-Monroy

A point on a plane curve is said to be Galois (for the curve) if the projection from the point as a map from the curve to a line induces a Galois extension of function fields. It is known that the number of Galois points is finite except…

Algebraic Geometry · Mathematics 2015-04-17 Satoru Fukasawa

A planar point set of $n$ points is called {\em $\gamma$-dense} if the ratio of the largest and smallest distances among the points is at most $\gamma\sqrt{n}$. We construct a dense set of $n$ points in the plane with…

Combinatorics · Mathematics 2019-04-01 István Kovács , Géza Tóth

Given a graph $G$, a 2-coloring of the edges of $K_n$ is said to contain a balanced copy of $G$ if we can find a copy of $G$ such that half of its edges is in each color class. If there exists an integer $k$ such that, for $n$ sufficiently…

Combinatorics · Mathematics 2026-04-17 Antoine Dailly , Adriana Hansberg , Laura Eslava , Denae Ventura

Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…

History and Overview · Mathematics 2025-04-17 Stefan Forcey

In some previous works, two of the authors introduced a technique to design high-order numerical methods for one-dimensional balance laws that preserve all their stationary solutions. The basis of these methods is a well-balanced…

Numerical Analysis · Mathematics 2025-05-06 Irene Gómez-Bueno , Manuel Jesús Castro Díaz , Carlos Parés , Giovanni Russo

A well-known theorem of de Bruijn and Erd\H{o}s states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite…

Combinatorics · Mathematics 2012-07-17 Ida Kantor , Balazs Patkos

In this paper, we study the problem of finding the largest possible set of s points and s lines in a projective plane of order q, such that that none of the s points lie on any of the s lines. We prove that s <= 1+(q+1)(\sqrt{q}-1). We also…

Combinatorics · Mathematics 2011-09-20 Douglas R. Stinson

Take any $d + 3$ points in $\mathbb{R}^d$. It is known that (a) if $d = 2k + 1$, then there are two linked $(k + 1)$-simplices with the vertices at these points; (b) if $d = 2k$, then there are two disjoint $(k + 1)$-tuples of these points…

Combinatorics · Mathematics 2024-02-15 M. Starkov

Given a point set $S$ in a projective plane $\Pi_q$ of order $q$, each line $\ell$ determines a secant size $|S\cap \ell|$. We study how balanced the secant-size distribution can be for the line set $\mathcal{L}$ of the plane, in other…

Combinatorics · Mathematics 2026-05-25 Zoltán Lóránt Nagy , Zsuzsa Weiner

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…

Combinatorics · Mathematics 2014-10-09 Vasek Chvatal

We consider the following problem: Given a set $S$ of $n$ distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on $S$? Each spanning path must be crossing-free, but edges from different paths…

Computational Geometry · Computer Science 2025-06-10 Philipp Kindermann , Jan Kratochvíl , Giuseppe Liotta , Pavel Valtr

One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…

Combinatorics · Mathematics 2017-01-31 June Huh , Botong Wang

It is well-known that the number of non-crossing perfect matchings of $2k$ points in convex position in the plane is $C_k$, the $k$th Catalan number. Garc\'ia, Noy, and Tejel proved in 2000 that for any set of $2k$ points in general…

Computational Geometry · Computer Science 2015-02-19 Andrei Asinowski

A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be…

Combinatorics · Mathematics 2022-08-26 János Karl , Géza Tóth

In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it…

Combinatorics · Mathematics 2024-11-22 Hung-Hsun Hans Yu , Yufei Zhao

For a smooth plane cubic $B$, we count curves $C$ of degree $d$ such that the normalizations of $C\backslash B$ are isomorphic to $\Bbb A^1$, for $d\leq7$ (for $d=7$ under some assumption). We also count plane rational quartic curves…

alg-geom · Mathematics 2008-02-03 Nobuyoshi Takahashi

Let $Q_d$ be the $d$-dimensional Hamming cube and $N=|V(Q_d)|=2^d$. An independent set $I$ in $Q_d$ is called balanced if $I$ contains the same number of even and odd vertices. We show that the logarithm of the number of balanced…

Combinatorics · Mathematics 2021-03-23 Jinyoung Park

For two non-congruent regular polygons of the same type, the method of finding the points in the plane at the equal distances to the vertices, is established. The existence of two points with this property is proved for two polygons with a…

General Mathematics · Mathematics 2022-06-22 Mamuka Meskhishvili

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

Combinatorics · Mathematics 2020-04-24 Aaron Lin , Konrad Swanepoel