Related papers: Self-affine quadrangles
All quasi-affine connected Generalized Dynkin Diagram with rank $= 4$ are found. All quasi-affine Nichols (Lie braided) algebras with rank $ 4$ are also found.
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 work we study inside-out dissections of polygons and polyhedra. We first show that an arbitrary polygon can be inside-out dissected with $2n+1$ pieces, thereby improving the best previous upper bound of $4(n-2)$ pieces.…
The edge-to-edge tilings of the sphere by congruent quadrilaterals of Type $a^2bc$ are classified as $3$ classes: a sequence of two-parameter families of $2$-layer earth map tilings with $2n$ $(n\ge3)$ tiles, a one-parameter family of…
The problem of classification of cubic homogeneous Finslerian 3D metrics with respect to their isometries is considered. It is shown, that there are 6 different general affine types of such metrics. Algebras of isometries are presented in…
Let us say that an $n$-sided polygon is semi-regular if it is circumscriptible and its angles are all equal but possibly one, which is then larger than the rest. Regular polygons, in particular, are semi-regular. We prove that semi-regular…
Motivated by a result of [1] which states that if F is a subgraph of a convex complete graph K_n and F contains no boundary edge of K_n and |E(F)| \leq n-3, then K_n - F admits a triangulation, we determine necessary and sufficient…
The family of Euclidean triangles having some fixed perimeter and area can be identified with a subset of points on a nonsingular cubic plane curve, i.e., an elliptic curve; furthermore, if the perimeter and the square of the area are…
We answer in the negative a question by Gruenbaum who asked if there exists a finite basis of affine invariant points. We give a positive answer to another question by Gruenbaum about the "size" of the set of all affine invariant points.…
We explore some generalizations of fullerenes F_v (simple polyhedra with v vertices and only 5- and 6-gonal faces) seen as (d-1)-dimensional simple manifolds (preferably, spherical or polytopal) with only 5- and 6-gonal 2-faces. First,…
Let K be an arbitrary (commutative) field with at least three elements. It was recently proven that an affine subspace of M_n(K) consisting only of non-singular matrices must have a dimension lesser than or equal to n(n-1)/2. Here, we…
We classify all regular three-dimensional convex cones which possess an automorphism group of dimension at least two, and provide analytic expressions for the complete hyperbolic affine spheres which are asymptotic to the boundaries of…
We prove that every homogeneous convex polyhedron with only one unstable equilibrium (known as a mono-unstable convex polyhedron) has at least $7$ vertices. Although it has been long known that no mono-unstable tetrahedra exist, and…
Traditionally, most complex intelligence architectures are extremely non-convex, which could not be well performed by convex optimization. However, this paper decomposes complex structures into three types of nodes: operators, algorithms…
There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…
Bernstein problem for affine maximal type equation has been a core problem in affine geometry. A conjecture proposed firstly by Chern for entire graph and then extended by Trudinger-Wang to its fully generality asserts that any Euclidean…
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…
We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.
Convex hexagons that can tile the plane have been classified into three types. For the generic cases (not necessarily convex) of the three types and two other special cases, we classify tilings of the plane under the assumption that all…
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected…