Related papers: Triangles and groups via cevians

The cevian triangle corresponding to an interior point $M$ of a triangle is the triangle determined by the feet of the three cevians concurrent at $M$. It is known that the area of the cevian triangle for an interior point $M$ of a triangle…

Starting with any nondegenerate triangle we can use a well defined interior point of the triangle to subdivide it into six smaller triangles. We can repeat this process with each new triangle, and continue doing so over and over. We show…

Let $A$ be a noetherian ring and $R_A$ be the graded ring $A[X,Y,Z,T]$. In this article we introduce the notion of a triad, which is a generalization to families of curves in ${\bf P}^3_A$ of the notion of Rao module. A triad is a complex…

The famous theorem of It\^{o} in group theory states that if a group $G=HK$ is the product of two abelian subgroups $H$ and $K$, then $G$ is metabelian. We shall generalize this to the setting of a skew brace $(A,{\cdot\,},\circ)$. Our main…

Two theorems are presented concerning the Miquel point configuration, when the operative points on the sides of the triangle are the feet of Cevians,

We establish a more precise description of those surjective or bijective continuous linear operators preserving orthogonality between C$^*$-algebras. The new description is applied to determine all uniformly continuous one-parameter…

In this article we'll emphasize on two triangles and provide a vectorial proof of the fact that these triangles have the same orthocenter. This proof will further allow us to develop a vectorial proof of the Stevanovic's theorem relative to…

An edge switch is an operation which makes a local change in a graph while maintaining the degree of every vertex. We introduce a switch move, called a triangle switch, which creates or deletes at least one triangle. Specifically, a make…

Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disjoint geometric graphs with vertices in $S$ cross if there…

In this paper, we consider a set of similar triangles with parallel sides, along with a set of points in the plane. It turns out that the set $\mathbb{R}_2= \{\pm <x >=\pm (x^2,x,1); x\in\mathbb{R} \}$ describes this set of triangles quite…

In the early part of the paper, various geometrical formulas are derived. Then, at some point in the paper, the concept of a Pythagorean rational is introduced. A Pythagorean rational is a rational number which is the ratio of two integers…

Let $t$, $r$, $k$ and $n$ be positive integers and $\mathcal{F}$ a family of $k$-subsets of an $n$-set $V$. The family $ \CF $ is $ r $-wise $ t $-intersecting if for any $ F_1, \ldots, F_r \in \CF $, we have $ \abs{\cap_{i = 1}^{r}F_i}\gs…

A simple-triangle graph is the intersection graph of triangles that are defined by a point on a horizontal line and an interval on another horizontal line. The time complexity of the recognition problem for simple-triangle graphs was a…

An N-tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile". The tile may or may not be similar to ABC. We wish to understand…

We examine the averaging operator $T$ corresponding to the manifold in $\mathbb{R}^{2d}$ of pairs of points $(u,v)$ satisfying $|u| = |v| = |u - v| = 1$, so that $\{0,u,v\}$ is the set of vertices of an equilateral triangle. We establish…

We consider triangulations of closed surfaces S with a given set of vertices V; every triangulation can be branched that is enhanced to a Delta-complex. Branched triangulations are considered up to the b-transit equivalence generated by…

An old theorem of Alexander Soifer's is the following: Given five points in a triangle of unit area, there must exist some three of them which form a triangle of area 1/4 or less. It is easy to check that this is not true if "five" is…

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 $A$ be either a simplicial complex $K$ or a small category $\mathcal C$ with $V(A)$ as its set of vertices or objects. We define a twisted structure on $A$ with coefficients in a simplicial group $G$ as a function $$ \delta\colon…

We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree at least 4 and boundary vertices of degree at least 3 and (2)…