Related papers: The Six-Point Circle Theorem

We give a new proof of the formula expressing the area of the triangle whose vertices are the projections of an arbitrary point in the plane onto the sides of a given triangle, in terms of the geometry of the given triangle and the location…

We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…

A covering with dominoes of a rectilinear region is called \emph{tatami} if no four dominoes meet at any point. We describe a reduction from planar 3SAT to Domino Tatami Covering. As a consequence it is NP-complete to decide whether there…

Considering regular graphs with every edge in a triangle we prove lower bounds for the number of triangles in such graphs. For r-regular graphs with r <= 5 we exhibit families of graphs with exactly that number of triangles and then…

Let $\beta: S^{2n+1}\to S^{2n+1}$ be a minimal homeomorphism ($n\ge 1$). We show that the crossed product $C(S^{2n+1})\rtimes_{\beta} \Z$ has rational tracial rank at most one. More generally, let $\Omega$ be a connected compact metric…

It is known that a point in three-dimensional Euclidean space whose coordinates are equal to the cosines of the angles $\angle BDC, \angle ADC, \angle ADB$, where the point $D$ lies in the plane of a given triangle $ABC$, lies on the…

We consider the fundamental algorithmic problem of finding a cycle of minimum weight in a weighted graph. In particular, we show that the minimum weight cycle problem in an undirected n-node graph with edge weights in {1,...,M} or in a…

We show that, if a $n$-vertex triangulation $T$ of maximum degree $\Delta$ has a dual that contains a cycle of length $\ell$, then $T$ has a non-crossing straight-line drawing in which some \emph{collinear set} of $\Omega(\ell/\Delta^4)$…

Our main result is that the Steiner Point Removal (SPR) problem can always be solved with polylogarithmic distortion, which answers in the affirmative a question posed by Chan, Xia, Konjevod, and Richa (2006). Specifically, we prove that…

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…

For a compact abelian group $G$, a corner in $G \times G$ is a triple of points $(x,y)$, $(x,y+d)$, $(x+d,y)$. The classical corners theorem of Ajtai and Szemer\'edi implies that for every $\alpha > 0$, there is some $\delta > 0$ such that…

The Euclidean quantum field theory for the fields $\phi_{\Delta x}(x)$, which depend on both the position $x$ and the resolution $\Delta x$, constructed in SIGMA 2 (2006), 046, hep-th/0604170, on the base of the continuous wavelet…

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…

We study the problem of minimizing the second Dirichlet eigenvalue for the Laplacian operator among sets of given perimeter. In two dimensions, we prove that the optimum exists, is convex, regular, and its boundary contains exactly two…

For a split graph $S$, the combinatorics of 2-switches on $S$ is faithfully encoded by the factor graph $\Phi(S)$, a multigraph whose induced cycles have length at most $4$. In this paper we address the following question: for which $n \in…

Richmond and Richmond (American Mathematical Monthly 104 (1997), 713--719) proved the following theorem: If, in a metric space with at least five points, all triangles are degenerate, then the space is isometric to a subset of the real…

Partial cubes are graphs isometrically embeddable into hypercubes. We analyze how isometric cycles in partial cubes behave and derive that every partial cube of girth more than 6 must have vertices of degree less than 3. As a direct…

We consider the following configuration. Let $ABCD$ be a cyclic quadrilateral with circumcenter $O$, and for each vertex $X$, let $H_X$ be the orthocenter of the triangle formed by the other three. Then…

For a positive constant $\alpha$ a graph $G$ on $n$ vertices is called an $\alpha$-expander if every vertex set $U$ of size at most $n/2$ has an external neighborhood whose size is at least $\alpha\left|U\right|$. We study cycle lengths in…

This paper introduces path triangulation of points in a bounded, simply connected surface region, replacing ordinary triangles in a Delaunay triangulation with path triangles from homotopy theory. A {\bf path triangle} has a border that is…