相关论文: Triangles and groups via cevians

We introduce the notion of ideal triangle in the Bruhat-Tits building associated to a split group -- it is analogous to the usual notion of triangle, but one vertex is "at infinity" in a certain direction. We prove that the algebraic…

Given a triangle ABC, a new triangle A'B'C' can be formed as follows: Draw the perpendicular to the line AB at the pointA; then the perpendicular to the line BC at B, and lastly the perpendicular to the line CA at C.the two triangles ABC…

Two triangles are called orthologic if the perpendiculars from the vertices of one of them to the sides of the other are concurrent. In this paper, we explore the concept of orthology from various points of view. Mostly we work in terms of…

A tensor is a multi-way array that can represent, in addition to a data set, the expression of a joint law or a multivariate function. As such it contains the description of the interactions between the variables corresponding to each of…

We reveal new aspects of the structure of Hilbert space $C_0$-semigroups $\mathcal T = (T(t))_{t\ge 0}$ similar to semigroups of contractions. In particular, we prove that $\mathcal T$ is similar to a semigroup of contractions if and only…

In this paper, we consider the problem of representing graphs by triangles whose sides touch. As a simple necessary condition, we show that pairs of vertices must have a small common neighborhood. On the positive side, we present linear…

The reduced expressions for a given element $w$ of a Coxeter group $(W, S)$ can be regarded as the vertices of a directed graph $\mathcal{R}(w)$; its arcs correspond to the braid moves. Specifically, an arc goes from a reduced expression…

Consider two horizontal lines in the plane. A pair of a point on the top line and an interval on the bottom line defines a triangle between two lines. The intersection graph of such triangles is called a simple-triangle graph. This paper…

Let $P$ be a finite point set in the plane. A \emph{$c$-ordinary triangle} in $P$ is a subset of $P$ consisting of three non-collinear points such that each of the three lines determined by the three points contains at most $c$ points of…

An edge-colored graph $G$ is called properly colored if every two adjacent edges are assigned different colors. A monochromatic triangle is a cycle of length 3 with all the edges having the same color. Given a tree $T_0$, let…

Motivated by a question of Erd\"{o}s and inquiries by Beeson and Laczkovich, we explore the possible $N$ for which a triangle $T$ can tile into $N$ congruent copies of a triangle $R$. The \emph{reptile} cases (where $T$ is similar to $R$)…

A rational triangle is a triangle with sides of rational lengths. In this short note, we prove that there exists a unique pair of a rational right triangle and a rational isosceles triangle which have the same perimeter and the same area.…

Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex…

A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…

For an abelian group $ A $, we study a close connection between braided crossed $ A $-categories with a trivialization of the $ A $-action and $ A $-graded braided tensor categories. Additionally, we prove that the obstruction to the…

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 continue the study of the generator graph of a group. In 2023, Tacbobo [9] defined the generator graph of a nontrivial group to be the graph whose vertices are the elements of the group, with two vertices being adjacent if…

We explicitly determine all CI-groups with respect to ternary relational structures that have the form $C \times D$, where $C$ is cyclic and $D$ is either a dicyclic group whose order is not divisible by $3$ or a dihedral group. Such groups…

For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\varphi:E(G)\rightarrow\{1,2,\ldots,t\}$ is called a proper edge $t$-coloring of a graph…

Given a right triangle ABC, with the ninety degree angle at A; consider the triangle O1OO2.Where the point O is the midpoint of the hypotenuseBC(and so the center of the triangle ABC's circumcircle), the point O1 being the triangle AOB's…