AI Chat AI Image Generator AI Video Text to Speech

Improved estimates on the number of unit perimeter triangles

04/08/2023

∙

by Ritesh Goenka, et al.

∙

∙

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.

Ritesh Goenka
6 publications
Kenneth Moore
1 publication
Ethan Patrick White
1 publication

page 1

page 2

page 3

page 4

research

∙ 04/18/2019

An extremal problem for integer sparse recovery

Motivated by the problem of integer sparse recovery we study the followi...

0 Sergei Konyagin, et al. ∙

research

∙ 06/11/2020

An improved constant factor for the unit distance problem

We prove that the number of unit distances among n planar points is at m...

0 Péter Ágoston, et al. ∙

research

∙ 10/02/2017

New Subexponential Fewnomial Hypersurface Bounds

Suppose c_1,...,c_n+k are real numbers, {a_1,...,a_n+k}⊂R^n is a set of ...

0 Jens Forsgård, et al. ∙

research

∙ 03/23/2021

Mono-monostatic polyhedra with uniform point masses have at least 8 vertices

The monostatic property of convex polyhedra (i.e. the property of having...

0 Sándor Bozóki, et al. ∙

research

∙ 05/06/2018

On Facility Location with General Lower Bounds

In this paper, we give the first constant approximation algorithm for th...

0 Shi Li, et al. ∙

research

∙ 11/06/2018

On the Number of Order Types in Integer Grids of Small Size

Let {p_1,...,p_n} and {q_1,...,q_n} be two sets of n labeled points in g...

0 Luis E. Caraballo, et al. ∙

research

∙ 12/03/2017

A Generalized Turán Problem and its Applications

The investigation of conditions guaranteeing the appearance of cycles of...

0 Lior Gishboliner, et al. ∙