English
Related papers

Related papers: Conways Circle Theorem: A Short Proof Enabling Gen…

200 papers

We prove a variant of the Sylvester-Gallai theorem for cubics (algebraic curves of degree three): If a finite set of sufficiently many points in $\mathbb{R}^2$ is not contained in a cubic, then there is a cubic that contains exactly nine of…

Combinatorics · Mathematics 2022-01-04 Alex Cohen , Frank de Zeeuw

An n-gon is defined as a sequence \P=(V_0,...,V_{n-1}) of n points on the plane. An n-gon \P is said to be convex if the boundary of the convex hull of the set {V_0,...,V_{n-1}} of the vertices of \P coincides with the union of the edges…

Computational Geometry · Computer Science 2007-05-23 Iosif Pinelis

Given $\Delta ABC$ and angles $\alpha,\beta,\gamma\in(0,\pi)$ with $\alpha+\beta+\gamma=\pi$, we study the properties of the triangle $DEF$ which satisfies: (i) $D\in BC$, $E\in AC$, $F\in AB$, (ii) $\aangle D=\alpha$, $\aangle E=\beta$,…

Metric Geometry · Mathematics 2010-08-03 Adrian Mitrea

In this paper, we consider a new length preserving curve flow for convex curves in the plane. We show that the global flow exists, the area of the region bounded by the evolving curve is increasing, and the evolving curve converges to the…

Differential Geometry · Mathematics 2008-11-14 Li Ma , Anqiang Zhu

We offer a reader-friendly introduction to the attracting edge problem (also known as the "triangle conjecture") and its most general current solution of Limic and Tarr\`es (2007). Little original research is reported; rather this article…

Probability · Mathematics 2008-05-20 V. Limic , P. Tarres

In 1984, Winkler conjectured that every simple Venn diagram with $n$ curves can be extended to a simple Venn diagram with $n+1$ curves. His conjecture is equivalent to the statement that the dual graph of any simple Venn diagram has a…

Combinatorics · Mathematics 2026-01-13 Sofia Brenner , Linda Kleist , Torsten Mütze , Christian Rieck , Francesco Verciani

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…

Combinatorics · Mathematics 2007-05-23 Federico Ardila

We introduce the abstract notion of a chain, which is a sequence of $n$ points in the plane, ordered by $x$-coordinates, so that the edge between any two consecutive points is unavoidable as far as triangulations are concerned. A general…

Computational Geometry · Computer Science 2023-03-22 Daniel Rutschmann , Manuel Wettstein

We prove the following theorem. Let $r\ge 4$ be an integer, and $G$ be a $K_{1,r}$-free $r$-edge-connected $r$-regular graph. Then, for every set $W$ of even number of vertices of $G$ such that the distance between any two vertices of $W$…

Combinatorics · Mathematics 2025-08-18 Yoshimi Egawa , Mikio Kano , Kenta Ozeki

We prove that any triangulation of a surface different from the sphere and the projective plane admits an orientation without sinks such that every vertex has outdegree divisible by three. This confirms a conjecture of Bar\'at and Thomassen…

Combinatorics · Mathematics 2014-12-17 Boris Albar , Daniel Gonçalves , Kolja Knauer

We propose a variant of Cauchy's Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between its endpoints increases. The main focus of this work is a…

A configuration of points and lines is cyclic if it has an automorphism which permutes its points in a full cycle. A closed formula is derived for the number of non-isomorphic connected cyclic configurations of type (v_3), i.e., which have…

Combinatorics · Mathematics 2013-01-14 Sergio Hiroki Koike-Quintanar , István Kovács , Tomaž Pisanski

We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$. More generally, we also determine the…

Combinatorics · Mathematics 2015-02-25 Zita Helle , Gábor Simonyi

Two new sufficient conditions for generalized cycles (including Hamilton and dominating cycles as special cases) in an arbitrary k-connected graph (k=1,2,...) are derived, which prove the truth of Bondy's (1980) famous conjecture for some…

Combinatorics · Mathematics 2022-11-30 Zhora Nikoghosyan

We prove that every bounded rational space curve of degree d and circularity c can be drawn by a linkage with 9/2 d - 6c + 1 revolute joints. Our proof is based on two ingredients. The first one is the factorization theory of motion…

Computational Geometry · Computer Science 2018-07-31 Zijia Li , Josef Schicho , Hans-Peter Schröcker

The Marden theorem of geometry of polynomials and the great Poncelet theorem from projective geometry of conics by their classical beauty occupy very special places. Our main aim is to present a strong and unexpected relationship between…

Classical Analysis and ODEs · Mathematics 2008-12-31 Vladimir Dragovic

Newton's theorem of revolving orbits states that one can multiply the angular speed of a Keplerian orbit by a factor $k$ by applying a radial inverse cubed force proportional to $(1-k^2)$. In this paper we derive an extension of this…

General Relativity and Quantum Cosmology · Physics 2016-10-06 Pierre Christian

Suppose that Y is a cyclic cover of projective space branched over a hyperplane arrangement D, and that U is the complement of the ramification locus in Y. The first theorem implies that the Beilinson-Hodge conjecture holds for U if certain…

Algebraic Geometry · Mathematics 2019-08-15 Donu Arapura

Lov\'asz conjectured that every connected 4-regular planar graph G admits a realization as a system of circles, i.e., it can be drawn on the plane utilizing a set of circles, such that the vertices of G correspond to the intersection and…

Data Structures and Algorithms · Computer Science 2019-09-05 Michael A. Bekos , Chrysanthi N. Raftopoulou

Theorem. There are general position points A, B, C, P on the projective plane. Let A_P be the intersection point of lines AP and BC. Analogously define B_P and C_P. Take any points A_1, B_1, C_1 on AP, BP, CP, respectively. Let W_C be the…

History and Overview · Mathematics 2014-12-04 Roman Krutowski
‹ Prev 1 8 9 10 Next ›