Exit Times from Equilateral Triangles

In this paper we obtain a closed form expression of the expected exit time of a Brownian motion from equilateral triangles. We consider first the analogous problem for a symmetric random walk on the triangular lattice and show that it is equivalent to the ruin problem of an appropriate three player game. A suitable scaling of this random walk allows us to exhibit explicitly the relation between the respective exit times. This gives us the solution of the related Poisson equation.     

Exit Times from Equilateral Triangles

In this paper we obtain a closed form expression of the expected exit time of a Brownian motion from equilateral triangles. We consider first the analogous problem for a symmetric random walk on the triangular lattice and show that it is equivalent to the ruin problem of an appropriate three player game. A suitable scaling of this random walk allows us to exhibit explicitly the relation between the respective exit times. This gives us the solution of the related Poisson equation.     

Tiling Convex Polygons with Congruent Equilateral Triangles

We study the sets $\mathcal{T}_{v}=\{m \in\{1,2,\ldots\}: \mbox{there is a convex polygon in }\mathbb{R}^{2}\mbox{ that has }v\mbox{ vertices and can be tiled with $m$ congruent equilateral triangles}\}$ , v=3,4,5,6. $\mathcal{T}_{3}$ , $\mathcal{T}_{4}$ , and $\mathcal{T}_{6}$ can be quoted completely. The complement $\{1,2,\ldots\} \setminus\mathcal{T}_{5}$ of $\mathcal{T}_{5}$ turns out to be a subset of Euler’s numeri idonei. As a consequence, $\{1,2,\ldots\} \setminus\mathcal{T}_{5}$ can be characterized with up to two exceptions, and a complete characterization is given under the assumption of the Generalized Riemann Hypothesis.     

On the Helly Number for Line Transversals to Parallel Triangles

We prove two results about the problem of finding the Helly number for line transversals to a family of parallel triangles in the plane: (1) If each three triangles of a family of parallel right triangles are intersected by an ascending (or a descending) line, then there is an ascending (or a descending) line that intersects all     

关于平行三角形集簇直线横截的Helly数

We prove two results about the problem of finding the Helly number for line transversals to a family of parallel triangles in the plane: (1) If each three triangles of a family of parallel right triangles are intersected by an ascending (or a descending) line, then there is an ascending (or a descending) line that intersects all the triangles of the family; (2) If each three triangles of a family of parallel obtuse triangles are intersected by an ascending (or a descending) line, then there is an ascending (or a descending) line that intersects all the triangles of the family. We also obtain that the Helly number of a family of parallel right or obtuse triangles is 3.     

On the Number of Edges in Geometric Graphs Without Empty Triangles

In this paper we study the extremal type problem arising from the question: What is the maximum number ET(S) of edges that a geometric graph G on a planar point set S can have such that it does not contain empty triangles? We prove: ${{n \choose 2} - O(n \log n) \leq ET(n) \leq {n \choose 2} - \left(n - 2 + \left\lfloor \frac{n}{8} \right\rfloor \right)}$ .     

Spherical f-Tilings by (Equilateral and Isosceles) Triangles and Isosceles Trapezoids

Dihedral f-tilings by spherical parallelograms and spherical triangles were obtained in [3–5]. In this paper we extend these results presenting the study of all dihedral f-tilings of the sphere S ², whose prototiles are a spherical equilateral or isosceles triangle and a spherical isosceles trapezoid. The combinatorial structure, including the symmetry group of each tiling, is given in Table 1.     

On the Maximum Number of Cliques in a Graph

A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m edges; (2) graphs with n vertices, m edges, and maximum degree Δ; (3) d-degenerate graphs with n vertices and m edges; (4) planar graphs with n vertices and m edges; and (5) graphs with n vertices and no K₅-minor or no K_3,3-minor. For example, the maximum number of cliques in a planar graph with n vertices is 8(n − 2). Research supported by a Marie Curie Fellowship of the European Community under contract 023865, and by the projects MCYT-FEDER BFM2003-00368 and Gen. Cat 2001SGR00224.     

Triangles I: Shapes

Summary This paper is the first in a series of three examining Euclidean triangle geometry via complex cross ratios. In this paper we show that every triangle can be characterized up to similarity by a single complex number, called its shape. We then use shapes and two basic theorems about shapes to prove theorems about similar triangles. The remaining papers in this series will examine complex triangle coordinates and complex triangle functions.     

On the Maximum Number of Translates in a Point Set

Given a finite set P⊆ℝ ^d , called a pattern, t _P (n) denotes the maximum number of translated copies of P determined by n points in ℝ ^d . We give the exact value of t _P (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that t _P (n)=n−m _r (n), where r is the rational affine dimension of P, and m _r (n) is the r -Kruskal–Macaulay function. We note that almost all patterns in ℝ ^d are rational simplices. The function t _P (n) is also determined exactly when | P |≤3 or when P has rational affine dimension one and n is large enough. We establish the equivalence of finding t _P (n) and the maximum number s _R (n) of scaled copies of a suitable pattern R⊆ℝ⁺ determined by n positive reals. As a consequence, we show that s_Ak(n)=n-\varTheta (n^1-1/p(k))s_{A_{k}}(n)=n-\varTheta (n^{1-1/\pi(k)}) , where A _k ={1,2,…,k} is an arithmetic progression of size k, and π(k) is the number of primes less than or equal to k.     

An Improved Bound on the Number of Unit Area Triangles

We show that the number of unit-area triangles determined by a set of n points in the plane is O(n ^9/4+ε ), for any ε>0, improving the recent bound O(n ^44/19) of Dumitrescu et al.     

On Some Rational Triangles

We prove that every set of n ≥ 3 points in mathbbR²{mathbb{R}^2} can be slightly perturbed to a set of n points in mathbbQ²{mathbb{Q}^2} so that at least 3(n − 2) of mutual distances between those new points are rational numbers. Some special rational triangles that are arbitrarily close to a given triangle are also considered. Given a triangle ABC, we show that for each ε > 0 there is a triangle A′B′C′ with rational sides and at least one rational median such that |AA′|, |BB′|, |CC′| < ε and a Heronian triangle A′′B′′C′′ with three rational internal angle bisectors such that A^￠￠, B^￠￠, C^￠￠ ? mathbbQ²{A^{primeprime}, B^{primeprime}, C^{primeprime} in mathbb{Q}^2} and |AA′′|, |BB′′|, |CC′′| < ε.     

On Sequences of Nested Triangles

Summary For a given triangle, we consider several sequences of nested triangles obtained via iterative procedures. We are interested in the limiting behavior of these sequences. We briefly mention the relevant known results and prove that the triangle determined by the feet of the angle bisectors converges in shape towards an equilateral one. This solves a problem raised by Trimble~[5].