相关论文: Representation of similar triangles in $\mathbb{R}…
We give upper and lower bounds on the number of graphs of fixed degree which have a positive density of triangles. In particular, we show that there are very few such graphs, when compared to the number of graphs without this restriction.…
We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…
The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle…
Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\varepsilon})$ connected semi-algebraic pieces, whose…
The paper reports the progress with the classical problem, posed by Blaschke and Bol in 1938. We present new examples and new classifications of natural classes of hexagonal circular 3-webs. The main results is the classification of…
A triangle group is denoted by $\Delta(p,q,r)$ and has finite presentation $$ \Delta(p,q,r)=\langle x,y | x^p=y^q=(xy)^r=1 \rangle .$$ We examine a method for composition of permutation representations of a triangle group $\Delta(p,q,r)$…
The paper presents an analog of the old result by the author and V. Voevodsky, according to which a Riemann surface admits a conformal structure, defined by an equilateral triangulation, if and only if the corresponding algebraic curve can…
Many scientific problems require to process data in the form of geometric graphs. Unlike generic graph data, geometric graphs exhibit symmetries of translations, rotations, and/or reflections. Researchers have leveraged such inductive bias…
Let $R$ be a Dedekind domain with field of fractions $K$ and $\operatorname{char}(R)\neq3$. In this paper, we generalize Bhargava's parametrization of $3$-torsion ideal classes by binary cubic forms to work over $R$. Specifically, we…
For an elliptic curve $E$ defined over the field $\mathbb{C}$ of complex numbers, we classify all translates of elliptic curves in $E^3$ such that the $x$-coordinates satisfy a linear equation. This classification enables us to establish a…
We characterize triples of cevians which form a triangle independent of the triangle where they are constructed. This problem is equivalent to solving a three-parameter family of inequalities which we call Ceva's triangle inequalities. Our…
The division of compact Riemann surfaces into 3 cases K_C<0, g=0, or K_C=0, g=1, or K_C>0, g>=2 is well known, and corresponds to the familiar trichotomy of spherical, Euclidean and hyperbolic non-Euclidean plane geometry. Classification…
In algebraic geometry, trigonal curves can always be embedded into Hirzebruch surfaces. In tropical geometry, the notion of trigonality does not have a unique translation. We focus on the characterization in terms of the existence of a…
This is a survey on recent developments in Cohen-Macaulay representations via tilting and cluster tilting theory. We explain triangle equivalences between the singularity categories of Gorenstein rings and the derived (or cluster)…
Plane triangulations with all vertices of degree $3$ or $6$ are enumerated. A plane triangulation is said to be akempic if it has a $4$-colouring such that no two adjacent triangles have the same three colours and this colouring is not…
We give a full characterisation of the symmetries of unlabelled triangulations and derive a constructive decomposition of unlabelled triangulations depending on their symmetries. As an application of these results we can deduce a complete…
This paper continues the study initiated in "The aithmetic of Triangles." We begin by examining a set of similar tetrahedra with parallel sides, together with a set of points in three-dimensional space. It turns out that the set…
We observe two kinds of fractal approximating graphs, the background structures of the generalized Sierpinski Arrowhead Curve independently of the recursive curves. Both graphs related to the generalized Sierpinski Gasket and based on a…
We compute a minimum degree threshold sufficient for 3-partite graphs to admit a fractional triangle decomposition. Together with recent work of Barber, K\"uhn, Lo, Osthus and Taylor, this leads to bounds for exact decompositions and in…
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…