相关论文: Triangles and groups via cevians

In this article we determine the class of triangles $A_iB_iC_i$ which are orthohomological with a given triangle $ABC$ and inscribed in the triangle $ABC$ (with $A_i \in BC$, $B_i \in CA$ and $C_i \in AB$).

For a simple real Jordan algebra $V,$ a family of bi-differential operators from $\mathcal{C}^\infty(V\times V)$ to $\mathcal{C}^\infty(V)$ is constructed. These operators are covariant under the rational action of the conformal group of…

The expansion $F^{\triangle}$ of a graph $F$ is the graph obtained from $F$ by replacing each edge with a triangle. Lv \etal proposed a conjecture on the maximum number of triangles in a graph without $P_k^{\triangle}$ or $C_k^{\triangle}$…

In this article we prove some theorems related to the triplets of triangles, homological two by two. These theorems will be used later to build triplets of triangles two by two tri-homological.

We study a commuting triple of bounded operators $(A, B, P)$ which has the tetrablock as a spectral set.

In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…

We prove that for any partition of the plane into a closed set $C$ and an open set $O$ and for any configuration $T$ of three points, there is a translated and rotated copy of $T$ contained in $C$ or in $O$. Apart from that, we consider…

Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called triangle switches. Each triangle switch creates or deletes at…

A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of pseudocircles was initiated by Gr\"unbaum, who defined them as collections of simple closed curves that pairwise intersect in exactly two…

A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…

A standard approach to reduce the complexity of very large networks is to group together sets of nodes into clusters according to some criterion which reflects certain structural properties of the network. Beyond the well-known modularity…

A triangle $T'$ is $\varepsilon$-similar to another triangle $T$ if their angles pairwise differ by at most $\varepsilon$. Given a triangle $T$, $\varepsilon>0$ and $n\in\mathbb{N}$, B\'ar\'any and F\"uredi asked to determine the maximum…

With $\xi$ the number of triangles in the usual (Erd\H{o}s-R\'enyi) random graph $G(m,p)$, $p>1/m$ and $\eta>0$, we show (for some $C_{\eta}>0$) $$\Pr(\xi> (1+\eta)\E \xi) < \exp[-C_{\eta}\min{m^2p^2\log(1/p),m^3p^3}].$$ This is tight up to…

We revisit the algorithmic problem of finding a triangle in a graph (\textsc{Triangle Detection}), and examine its relation to other problems such as \textsc{3Sum}, \textsc{Independent Set}, and \textsc{Graph Coloring}. We obtain several…

Consider the domain $E$ in $\mathbb{C}^3$ defined by $$ E=\{(a_{11},a_{22},\text{det}A): A=\begin{pmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{pmatrix}\text{ with }\lVert A \rVert <1\}. $$ This is called the tetrablock. This paper…

Let $\mathcal{G}$ be a properly face 2-coloured (say black and white) \break piecewise-linear triangulation of the sphere with vertex set $V$. Consider the abelian group $\mathcal{A}_W$ generated by the set $V$, with relations $r+c+s=0$ for…

A triality is a sort of super-symmetry that exchanges the types of the elements of an incidence geometry in cycles of length three. Although geometries with trialities exhibit fascinating behaviors, their construction is challenging, making…

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critical group of a line graph. The first deals with connected…

Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given…

Quantum sinh-Gordon model in 1+1 dimensions is one of the simplest and best-studied massive integrable relativistic quantum field theories. We consider this theory on a multi-sheeted Riemann surfaces with a flat metric, which can be seen as…