相关论文: Triangles and groups via cevians

For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…

In an attempt to understand the origins and the nature of the law binding together two group operations into a {\em skew brace}, introduced in [L.\ Guarnieri \& L.\ Vendramin, Math.\ Comp.\ \textbf{86} (2017), 2519--2534] as a non-Abelian…

Given a compact oriented triangulated $3$-manifold we find a non-trivial condition satisfied by certain labelings of the tetrahedra by elements of an arbitrary abelian group which we call angle structures. Smoothness of the manifold is used…

We give a self-contained and streamlined exposition of a generation theorem for C0-semigroups based on the method of boundary triplets. We apply this theorem to port-Hamiltonian systems where we discuss recent results appearing in stability…

A set of edges $T$ in a graph $G$ is triangle-independent if $T$ contains at most one edge from each triangle in $G$. Let $\alpha_1(G)$ denote the maximum size of the triangle-independent set in $G$, and let $\tau_B(G)$ denote minimum size…

We define the full and reduced non-self-adjoint operator algebras associated with \'etale categories and restriction semigroups, answering a question posed by Kudryavtseva and Lawson in \cite{lawson}. Moreover, we define the semicrossed…

We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$. More generally, we also determine the…

After recalling basic definitions and constructions for a finite group $G$ action on a $k$-linear category we give a concise proof of the following theorem of Elagin: if $\mathcal{C} = \langle \mathcal{A}, \mathcal{B} \rangle$ is a…

In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…

An elementary geometric construction known as Napoleon's theorem produces an equilateral triangle built on the sides of any initial triangle: the centroids of each equilateral triangle meeting the original sides, all outward or all inward,…

Counting the number of triangles in a graph has many important applications in network analysis. Several frequently computed metrics like the clustering coefficient and the transitivity ratio need to count the number of triangles in the…

From Euclid's fundamental formula for the Pythagorean triples we define the rational triples relating certain congruent numbers by an identity and explore their relationships. We introduce two geometric methods relating the congruent number…

A Mendelsohn triple system of order $v$ (or MTS$(v)$) is a decomposition of the complete graph into directed 3-cyles. We denote the directed 3-cycle with edges $(x,y)$, $(y,z)$ and $(z,x)$ by $(x,y,z)$, $(y,z,x)$ or $(z,x,y)$. An…

The quotient of a Boolean algebra by a cyclic group is proven to have a symmetric chain decomposition. This generalizes earlier work of Griggs, Killian and Savage on the case of prime order, giving an explicit construction for any order,…

We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…

This paper develops a Cambrian extension of the work of C. Ceballos, A. Padrol and C. Sarmiento on $\nu$-Tamari lattices and their tropical realizations. For any signature $\varepsilon \in \{\pm\}^n$, we consider a family of…

We define a homology for ternary groups using both associativity and skew elements. We describe the odd-even construction which yields many examples of ternary groups. We define the ternary knot group, consider its homomorphisms into…

The Longest Edge Bisection of a triangle is performed by joining the midpoint of its longest edge to the opposite vertex. Applying this procedure iteratively produces an infinite family of triangles. Surprisingly, a classical result of…

Working over an arbitrary base scheme, we provide an alternative development of triality which does not use Octonion algebras or symmetric composition algebras. Instead, we use the Clifford algebra of the split hyperbolic quadratic form of…

In a group trellis, the sequence of branches that split from the identity path and merge to the identity path form two normal chains. The Schreier refinement theorem can be applied to these two normal chains. The refinement of the two…