English
Related papers

Related papers: A Note on Empty Balanced Tetrahedra in Two colored…

200 papers

Let $S=R\cup B$ be a point set in the plane in general position such that each of its elements is colored either red or blue, where $R$ and $B$ denote the points colored red and the points colored blue, respectively. A quadrilateral with…

Computational Geometry · Computer Science 2017-08-07 S. Bereg , J. M. Díaz-Báñez , R. Fabila-Monroy , P. Pérez-Lantero , A. Ramírez-Vigueras , T. Sakai , J. Urrutia , I. Ventura

Let $P$ be a $2n$-point set in the plane that is in general position. We prove that every red-blue bipartition of $P$ into $R$ and $B$ with $|R| = |B| = n$ generates $\Omega(n^{3/2})$ red-red-blue empty triangles.

Combinatorics · Mathematics 2024-10-01 Ting-Wei Chao , Zichao Dong , Zhuo Wu

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

Computational Geometry · Computer Science 2017-08-22 Sergey Bereg , Matias Korman , Rodrigo I. Silveira , Ferran Hurtado , Dolores Lara , Jorge Urrutia , Mikio Kano , Carlos Seara , Kevin Verbeek

Let $S$ be a set of $n$ points in general position in the plane. The Second Selection Lemma states that for any family of $\Theta(n^3)$ triangles spanned by $S$, there exists a point of the plane that lies in a constant fraction of them.…

Computational Geometry · Computer Science 2022-10-04 Ruy Fabila-Monroy , Carlos Hidalgo-Toscano , Daniel Perz , Birgit Vogtenhuber

The monostatic property of polyhedra (i.e. the property of having just one stable or unstable static equilibrium point) has been in a focus of research ever since Conway and Guy \cite{Conway} published the proof of the existence of the…

Metric Geometry · Mathematics 2023-04-17 Gergő Almádi , Robert J. MacG. Dawson , Gábor Domokos , Krisztina Regős

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

Combinatorics · Mathematics 2021-12-03 James East , Michael Hendriksen , Laurence Park

Given a set P of points on the plane, a polygon with vertices in P is said to be empty if it contains no element of P in its interior. We show that every set of n points in general position on the plane determines at least…

Combinatorics · Mathematics 2026-03-20 Omar Astudillo-Marbán , Oriol Solé-Pi

We formulate and give partial answers to several combinatorial problems on volumes of simplices determined by $n$ points in 3-space, and in general in $d$ dimensions. (i) The number of tetrahedra of minimum (nonzero) volume spanned by $n$…

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

Let $B$ and $R$ be point sets (of {\em blue} and {\em red} points, respectively) in the plane, such that $P:=B\cup R$ is in general position, and $|P|$ is even. A line $\ell$ is {\em balanced} if it spans one blue and one red point, and on…

Combinatorics · Mathematics 2009-05-22 David Orden , Pedro Ramos , Gelasio Salazar

A clean lattice tetrahedron is a non-degenerate tetrahedron with the property that the only lattice points on its boundary are its vertices. We present some new proofs of old results and some new results on clean lattice tetrahedra, with an…

Combinatorics · Mathematics 2007-05-23 Bruce Reznick

Let $S$ be a set of $n$ points in general position in the plane. Suppose that each point of $S$ has been assigned one of $k \ge 3$ possible colors and that there is the same number, $m$, of points of each color class. A polygon with…

Computational Geometry · Computer Science 2020-07-16 Ruy Fabila-Monroy , Daniel Perz , Ana Laura Trujillo-Negrete

Let $S$ be a set of $n$ points in 3-dimensional space. A tetrahedralization $\mathcal{T}$ of $S$ is a set of interior disjoint tetrahedra with vertices on $S$, not containing points of $S$ in their interior, and such that their union is the…

Computational Geometry · Computer Science 2012-10-22 Francisco Escalona , Ruy Fabila-Monroy , Jorge Urrutia

A balanced pair in a finite ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We prove that every finite $N$-free…

Combinatorics · Mathematics 2012-05-22 Imed Zaguia

Tutte's embedding theorem states that every 3-connected graph without a $K_5$ or $K_{3,3}$ minor (i.e. a planar graph) is embedded in the plane if the outer face is in convex position and the interior vertices are convex combinations of…

Computational Geometry · Computer Science 2023-03-28 Marc Alexa

The famous Tetrahedron Conjecture of Tur\'an from the 1940s asserts that the number of edges in an $n$-vertex $3$-graph without the tetrahedron, the complete $3$-graph on four vertices, cannot exceed that of the balanced complete cyclic…

Combinatorics · Mathematics 2025-11-19 Levente Bodnár , Wanfang Chen , Jinghua Deng , Jianfeng Hou , Xizhi Liu , Jialei Song , Jiabao Yang , Yixiao Zhang

We investigate extremal problems for quasirandom hypergraphs. We say that a $3$-uniform hypergraph $H=(V,E)$ is $(d,\eta)$-quasirandom if for any subset $X\subseteq V$ and every set of pairs $P\subseteq V\times V$ the number of pairs…

Combinatorics · Mathematics 2016-09-20 Christian Reiher , Vojtěch Rödl , Mathias Schacht

A subset $S$ of the unit sphere $\mathbb{S}^2$ is called orthogonal-pair-free if and only if there do not exist two distinct points $u, v \in S$ at distance $\frac{\pi}{2}$ from each other. Witsenhausen \cite{witsenhausen} asked the…

Computational Geometry · Computer Science 2024-03-28 Apurva Mudgal

Let $S$ be a set of $r$ red points and $b=r+2d$ blue points in general position in the plane, with $d\geq 0$. A line $\ell$ determined by them is said to be balanced if in each open half-plane bounded by $\ell$ the difference between the…

Combinatorics · Mathematics 2020-07-21 David Orden , Pedro Ramos , Gelasio Salazar

Let $\Lambda$ be a finite dimensional algebra such that $\mathcal{L}_{\Lambda}$ or $\mathcal{R}_{\Lambda}\neq\emptyset$. Then $\Lambda$ is $\tau$-tilting finite if and only if $\Lambda$ is representation-finite.

Representation Theory · Mathematics 2020-10-14 Stephen Zito

A tetrahedron is called a path tetrahedron, if it has three mutually orthogonal edges that do not intersect at a single point. A tetrahedron is called a 4-ball tetrahedron, if there exists a sphere tangent to all its edges. We derive…

Metric Geometry · Mathematics 2026-01-14 Sergey Korotov , Michal Krizek
‹ Prev 1 2 3 10 Next ›