English
Related papers

Related papers: Points defining triangles with distinct circumradi…

200 papers

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Computational Geometry · Computer Science 2007-05-23 Jeff Danciger , Satyan L. Devadoss , Don Sheehy

We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…

Combinatorics · Mathematics 2017-02-06 Andrei Asinowski , Christian Krattenthaler , Toufik Mansour

We study some properties of a triad of circles associated with a triangle. Each circle is inside the triangle, tangent to two sides of the triangle, and externally tangent to the circle on the third side as diameter. In particular, we find…

History and Overview · Mathematics 2023-11-06 Ercole Suppa , Stanley Rabinowitz

We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…

Classical Analysis and ODEs · Mathematics 2023-07-04 Xuezhi Chen , Jingwei Guo

Giulietti and Korchm\'aros presented new curves with the maximal number of points over a field of size q^6. Garcia, G\"uneri, and Stichtenoth extended the construction to curves that are maximal over fields of size q^2n, for odd n >= 3. The…

Number Theory · Mathematics 2010-12-17 Iwan M. Duursma

A criterion for the existence of a birational embedding with two Galois points for quotient curves is presented. We apply our criterion to several curves, for example, some cyclic subcovers of the Giulietti-Korchmaros curve or of the curves…

Algebraic Geometry · Mathematics 2020-08-25 Satoru Fukasawa , Kazuki Higashine

In this paper, we prove that a set of $N$ points in ${\bf R}^2$ has at least $c{N \over \log N}$ distinct distances, thus obtaining the sharp exponent in a problem of Erd\"os. We follow the set-up of Elekes and Sharir which, in the spirit…

Combinatorics · Mathematics 2011-06-29 Larry Guth , Nets Hawk Katz

We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…

Combinatorics · Mathematics 2025-10-31 Dominique Maldague , Hong Wang , Dmitrii Zakharov

We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…

Combinatorics · Mathematics 2018-01-19 Larry Guth , Joshua Zahl

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

Combinatorics · Mathematics 2022-10-28 Yanan Hu , Xingzhi Zhan , Leilei Zhang

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

Computational Geometry · Computer Science 2013-04-15 Natan Rubin

Let S be a set of n points in the plane, and let T be a set of m triangles with vertices in S. Then there exists a point in the plane contained in Omega(m^3 / (n^6 log^2 n)) triangles of T. Eppstein (1993) gave a proof of this claim, but…

Computational Geometry · Computer Science 2013-03-25 Gabriel Nivasch , Micha Sharir

Let C be an algebraic curve in a power of an elliptic curve, both defined over the algebraic numbers. We show that the set of algebraic points of C which satisfy certain conditions is a finite set. This result has implications with the…

Number Theory · Mathematics 2008-11-10 Viada Evelina

We give uniform upper bounds for the number of rational points of height at most $B$ on non-singular complete intersections of two quadrics in $\mathbb{P}^3$ defined over $\mathbb{Q}$. To do this, we combine determinant methods with descent…

Number Theory · Mathematics 2018-11-29 Manh Hung Tran

The purpose of this article is to discuss the circle method and its quantitative role in understanding pointwise almost everywhere convergence phenomena for polynomial ergodic averaging operators. Specifically, we will use the circle method…

Dynamical Systems · Mathematics 2026-02-13 Mariusz Mirek

Three circles define each of the Brocard points of a triangle. If one adds the three circles through a pair of vertices and the orthocentre one has nine circles. It is described how each of the nine centres of these circles lies at the…

Metric Geometry · Mathematics 2010-07-08 Christopher J Bradley

Given a smooth projective curve C defined over a number field and given two elliptic surfaces E_1/C and E_2/C along with sections P_i and Q_i of E_i (for i = 1,2), we prove that if there exist infinitely many algebraic points t on C such…

Number Theory · Mathematics 2017-03-07 Dragos Ghioca , Liang-Chung Hsia , Thomas J. Tucker

Using Marden's Theorem from geometric theory of polynomials, we show that for every triangle there is a unique ellipse such that the triangle is a billiard trajectory within that ellipse. Since $3$-periodic trajectories of billiards within…

Dynamical Systems · Mathematics 2025-01-29 Vladimir Dragović , Milena Radnović

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

We study the following question: fix a sufficient general curve D of degree d in P^2, what is the least number of intersections between D and an irreducible curve of degree m? G. Xu proved this number i(d, m) is at least d - 2 for all m.…

Algebraic Geometry · Mathematics 2007-05-23 Xi Chen
‹ Prev 1 4 5 6 7 8 10 Next ›