通过cevians的三角形和群
Triangles and groups via cevians
摘要:
对于一个给定的三角形$T$和一个实数$ρ$,我们定义Ceva的三角形$\CT_ρ(T)$是由三个cevian形成的三角形,每个cevian连接$T$的顶点到以比率$ρ:(1-ρ)$划分相对侧的点。我们确定最小的间隔$\nM_T \subset \nR$,使家庭$\CT_ρ(T), ρ\in \nM_T$,包含所有Ceva的三角形相似。我们证明了作用于三角形的算子$\CT_ρ, ρ\in \nR$的合成是由$\nR$上的某种群结构决定的。我们使用这种结构来证明,两个三角形具有相同的布罗卡角,当且仅当一个全等的副本,其中之一可以恢复足够多的迭代两个运营商$\CT_ρ$和$\CT_ξ$作用于其他三角形。
英文摘要:
For a given triangle $T$ and a real number $ρ$ we define Ceva's triangle $\CT_ρ(T)$ to be the triangle formed by three cevians each joining a vertex of $T$ to the point which divides the opposite side in the ratio $ρ:(1-ρ)$. We identify the smallest interval $\nM_T \subset \nR$ such that the family $\CT_ρ(T), ρ\in \nM_T$, contains all Ceva's triangles up to similarity. We prove that the composition of operators $\CT_ρ, ρ\in \nR$, acting on triangles is governed by a certain group structure on $\nR$. We use this structure to prove that two triangles have the same Brocard angle if and only if a congruent copy of one of them can be recovered by sufficiently many iterations of two operators $\CT_ρ$ and $\CT_ξ$ acting on the other triangle.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。