Related papers: The Six-Point Circle Theorem

Richard Guy asked the following question: can we find a triangle with rational sides, medians, and area? Such a triangle is called a \emph{perfect triangle} and no example has been found to date. It is widely believed that such a triangle…

If we label the vertices of a triangle with 1, 2 and 4, and the orthocentre with 7, then any of the four numbers 1, 2, 4, 7 is the nim-sum of the other three and is their orthocentre. Regard the triangle as an orthocentric quadrangle.…

In this paper we consider the existence of Hamilton cycles in the random graph $G=G_{n,m}^{\delta\geq 3}$. This a random graph chosen uniformly from the set of graphs with vertex set $[n]$, $m$ edges and minimum degree at least 3. Our…

We prove existence of partitions of an open set $\Omega$ with a given number of phases, which minimize the sum of the fractional perimeters of all the phases, with Dirichlet boundary conditions. In two dimensions we show that, if the…

We construct, for each irrational number $\alpha$, a minimal $C^1$-diffeomorphism of the circle with rotation number $\alpha$ which admits a measur

For a directed graph $G$ without loops or parallel edges, let $\beta(G)$ denote the size of the smallest feedback arc set, i.e., the smallest subset $X \subset E(G)$ such that $G \sm X$ has no directed cycles. Let $\gamma(G)$ be the number…

Every 4-connected graph with minimum degree $\delta$ and connectivity $\kappa$ either has a cycle of length at least $4\delta-2\kappa$ or has a dominating cycle.

Montassier, Raspaud, and Wang (2006) asked to find the smallest positive integers $d_0$ and $d_1$ such that planar graphs without $\{4,5\}$-cycles and $d^{\Delta}\ge d_0$ are $3$-choosable and planar graphs without $\{4,5,6\}$-cycles and…

We analyze the Minimal Area solution to the Loop Equations in turbulence \cite{M93}. As it follows from the new derivation in the recent paper \cite{M19}, the vorticity is represented as a normal vector to the minimal surface not just at…

A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…

Terwilliger recently introduced the $S_3$-symmetric tridiagonal algebra, a generalization of the tridiagonal algebra. This algebra has six generators naturally associated with the vertices of a regular hexagon: adjacent generators satisfy…

We present a new technique for efficiently removing almost all short cycles in a graph without unintentionally removing its triangles. Consequently, triangle finding problems do not become easy even in almost $k$-cycle free graphs, for any…

We first take into account variational problems with periodic boundary conditions, and briefly recall some sufficient conditions for a periodic solution of the Euler-Lagrange equation to be either a directional, a weak, or a strong local…

We show that each pseudoconvex domain $\Omega\subset {\mathbb C}^n$ admits a holomorphic map $F$ to ${\mathbb C}^m$ with $|F|\le C_1 e^{C_2 \hat{\delta}^{-6}}$, where $\hat{\delta}$ is the minimum of the boundary distance and…

We consider minimizers of \[ F(\lambda_1(\Omega),\ldots,\lambda_N(\Omega)) + |\Omega|, \] where $F$ is a function nondecreasing in each parameter, and $\lambda_k(\Omega)$ is the $k$-th Dirichlet eigenvalue of $\Omega$. This includes, in…

It is shown that any subset $E$ of a plane over a finite field $\F_q$, of cardinality $|E|>q$ determines not less than $\frac{q-1}{2}$ distinct areas of triangles, moreover once can find such triangles sharing a common base. It is also…

We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an $n$-vertex graph $G$ with sublinear independence number. In this setting, we show that if $\delta(G) \ge n/3 + o(n)$ then…

We determine the minimum number of vertices needed to provide balanced triangulations of $\mathbb S^{d-2}$-bundles over $\mathbb S^1$. If $d$ is odd and the bundle is orientable, or $d$ is even and the bundle is non-orientable, the minimum…

Let alpha be an arbitrary angle in a random spherical triangle Delta and a be the side opposite alpha. (The sphere has radius 1; vertices of Delta are independent and uniform.) If some other side is constrained to be pi/2, then…

We prove that constant minimum degree already forces cycles with almost linearly many chords. Specifically, every graph $G$ with $\delta(G)\ge C$ contains a cycle of length $\ell\ge 4$ with $\Omega(\ell/\log^{C}\ell)$ chords for some…