相关论文: A Web of Confocal Parabolas in a Grid of Hexagons

Confocal conics form an orthogonal net. Supplementing this net with one of the following: 1) the net of Cartesian coordinate lines aligned along the principal axes of conics, 2) the net of Apollonian pencils of circles whose foci coincide…

Among a triangle's exparabolas (parabolas escribed to the triangle), three are distinguished by having locally maximal parameter. They are determined by a simple cubic equation and characterized by having axes that contain the triangle's…

In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…

We consider the edge- and vertex-isoperimetric probem on finite and infinite hexagonal grids: For a subset W of the hexagonal grid of given cardinality, we give a lower bound for the number of edges between W and its complement, and lower…

In this article we investigate the properties of isogonal conjugation in isosceles tetrahedron. Particularly we reveal three hyperbolic paraboloids each of which is formed by pairs of isogonal conjugate points symmetric in the respective…

Canonical parametrisations of classical confocal coordinate systems are introduced and exploited to construct non-planar analogues of incircular (IC) nets on individual quadrics and systems of confocal quadrics. Intimate connections with…

A non-equilateral triangle in a Euclidean plane has exactly two isogonic and two isodynamic points. There are a number of different but equivalent characterizations of these triangle centers. The aim of this paper is to work out…

Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…

In the hyperbolic plane there are infinite regular lattices. From a fix vertex of a lattice tree graphs can be constructed recursively to the next layers with edges of the lattice. In this article we examine the properties of the growing of…

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…

Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…

We consider congruences of straight lines in a plane with the combinatorics of the square grid, with all elementary quadrilaterals possessing an incircle. It is shown that all the vertices of such nets (we call them incircular or IC-nets)…

In this study, the properties of convex hexagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the convex hexagons are equilateral convex parallelohexagons, convex pentagons generated by bisecting the…

We construct triangular hyperbolic polyhedra whose links are generalized 4-gons. The universal cover of those polyhedra are hyperbolic buildings, which appartments are hyperbolic planes tesselated by regular triangles with angles $\pi/4$.…

A topologically minimal surface may be isotoped into a normal form with respect to a fixed triangulation. If the intersection with each tetrahedron is simply connected, then the pieces of this normal form are triangles, quadrilaterals, and…

We revisit constructions based on triads of conics with foci at pairs of vertices of a reference triangle. We find that their 6 vertices lie on well-known conics, whose type we analyze. We give conditions for these to be circles and/or…

We construct flat 3-webs via semi-simple geometric Frobenius manifolds of dimension three and give geometric interpretation of the Chern connection of the web. These webs turned out to be biholomorphic to the characteristic webs on the…

For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.

We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of…

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…