English
Related papers

Related papers: Points defining triangles with distinct circumradi…

200 papers

In this elementary note we prove that a polynomial with rational coefficients divides the derivative of some polynomial which splits in $\Q$ if and only if all of its irrational roots are real and simple. This provides an answer to a…

Number Theory · Mathematics 2007-05-23 Alexandr Borisov

We study the structure of collections of algebraic curves in three dimensions that have many curve-curve incidences. In particular, let $k$ be a field and let $\mathcal{L}$ be a collection of $n$ space curves in $k^3$, with…

Algebraic Geometry · Mathematics 2024-02-27 Larry Guth , Joshua Zahl

Given any positive integer n, we prove the existence of infinitely many right triangles with area n and side lengths in certain number fields. This generalizes the famous congruent number problem. The proof allows the explicit construction…

We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…

Geometric Topology · Mathematics 2016-05-12 Mark C. Bell , Richard C. H. Webb

For an elliptic curve $E/\Q$, we determine the maximum number of twists $E^d/\Q$ it can have such that $E^d(\Q)_{tors}\supsetneq E(\Q)[2]$. We use these results to determine the number of distinct quadratic fields $K$ such that…

Number Theory · Mathematics 2014-11-18 Filip Najman

In 1640's, Blaise Pascal discovered a remarkable property of a hexagon inscribed in a conic - Pascal Theorem, which gave birth of the projective geometry. In this paper, a new geometric invariant of algebraic curves is discovered by a…

Algebraic Geometry · Mathematics 2015-03-19 Zhongxuan Luo

If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…

Combinatorics · Mathematics 2015-11-23 Ivan Izmestiev

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…

Computational Geometry · Computer Science 2013-03-25 Gabriel Nivasch , János Pach , Rom Pinchasi , Shira Zerbib

We give bounds on the number of non-simple closed curves on a negatively curved surface, given upper bounds on both length and self-intersection number. In particular, it was previously known that the number of all closed curves of length…

Geometric Topology · Mathematics 2017-02-21 Jenya Sapir

Combining $2$-descent techniques with Riemann-Roch and B\'ezout's theorems, we give an upper bound on the number of rational points of bounded height on elliptic and hyperelliptic curves over function fields of characteristic $\neq 2$. We…

Number Theory · Mathematics 2025-10-16 Jean Gillibert , Emmanuel Hallouin , Aaron Levin

If P is a point inside triangle ABC, then the cevians through P extended to the circumcircle of triangle ABC create a figure containing a number of curvilinear triangles. Each curvilinear triangle is bounded by an arc of the circumcircle…

History and Overview · Mathematics 2021-01-08 Stanley Rabinowitz

We study a variant of the Erd\H os unit distance problem, concerning angles between successive triples of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of angles…

Combinatorics · Mathematics 2021-04-21 Eyvindur Ari Palsson , Steven Senger , Charles Wolf

The study of extremal problems on triangle areas was initiated in a series of papers by Erd\H{o}s and Purdy in the early 1970s. In this paper we present new results on such problems, concerning the number of triangles of the same area that…

Combinatorics · Mathematics 2013-12-17 Adrian Dumitrescu , Micha Sharir , Csaba D. Toth

We analyze loci of triangle centers over variants of two-well known triangle porisms: the bicentric and confocal families. Specifically, we evoke the general version of Poncelet's closure theorem whereby individual sides can be made tangent…

Metric Geometry · Mathematics 2022-01-25 Ronaldo Garcia , Boris Odehnal , Dan Reznik

We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…

Computational Geometry · Computer Science 2023-08-29 Csaba D. Tóth , Jorge Urrutia , Giovanni Viglietta

In this paper we give a complete characterization of the intersections between the Norm-Trace curve over $\mathbb{F}_{q^3}$ and the curves of the form $y=ax^3+bx^2+cx+d$, generalizing a previous result by Bonini and Sala, providing more…

Algebraic Geometry · Mathematics 2022-07-05 Matteo Bonini , Massimiliano Sala , Lara Vicino

Using the possibility of computationally determining points on a finite cover of a unirational variety over a finite field, we determine all possibilities for direct Gorenstein linkages between general sets of points in P^3 over an…

Algebraic Geometry · Mathematics 2013-01-28 David Eisenbud , Robin Hartshorne , Frank-Olaf Schreyer

The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…

Algebraic Geometry · Mathematics 2014-03-25 Wouter van Heijst

We re-derive Thales, Pythagoras, Apollonius, Stewart, Heron, al Kashi, de Gua, Terquem, Ptolemy, Brahmagupta and Euler's theorems as well as the inscribed angle theorem, the law of sines, the circumradius, inradius and some angle bisector…

General Mathematics · Mathematics 2023-01-31 Martin Buysse

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