Related papers: On generating a diminimal set of polyhedral maps o…

We prove that every $n$-vertex complete simple topological graph generates at least $\Omega(n)$ pairwise disjoint $4$-faces. This improves upon a recent result by Hubard and Suk. As an immediate corollary, every $n$-vertex complete simple…

In this article we study infinitesimal deformations of toric hypersurfaces. We introduce a Kodaira-Spencer map and compute its kernel. By introducing some new Laurent polynomials we make our computation as explicit as possible. This widely…

In this paper we give an explicit construction of bounded remainder sets of all possible volumes, for any irrational rotation on the adelic torus $\mathbb A/\mathbb Q$. Our construction involves ideas from dynamical systems and harmonic…

The article deals with the problem of finding vertex-minimal graphs with a given automorphism group. We exhibit two undirected $16$-vertex graphs having automorphism groups $A_{4}$ and $A_{5}$. It improves the Babai's bound for $A_{4}$ and…

We prove some preliminary results concerning two questions of O.Karpenkov: (1) What is the number of decompositions of torus of dimension 2 into given number f of regions by unions of n geodesics? (2) On the plane there are n circles not in…

Two important classes of three-dimensional elements in computational meshes are hexahedra and tetrahedra. While several efficient methods exist that convert a hexahedral element to a tetrahedral elements, the existing algorithm for…

In this paper, we formulate a simple algorithm that detects contours around a region of interest in an image. After an initial smoothing, the method is based on viewing an image as a topographic surface and finding convex and/or concave…

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…

We obtain an explicit formula for the number of rational cuspidal curves of a given degree on a del-Pezzo surface that pass through an appropriate number of generic points of the surface. This enumerative problem is expressed as an Euler…

Consider an orthogonal polyhedron, i.e., a polyhedron where (at least after a suitable rotation) all faces are perpendicular to a coordinate axis, and hence all edges are parallel to a coordinate axis. Clearly, any facial angle and any…

We study tetrahedron maps, which are set-theoretical solutions to the Zamolodchikov tetrahedron equation, and Yang-Baxter maps, which are set-theoretical solutions to the quantum Yang-Baxter equation. In particular, we clarify the structure…

It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…

This paper proposes a simple and efficient method for the reconstruction and extraction of geometric parameters from 3D tubular objects. Our method constructs an image that accumulates surface normal information, then peaks within this…

Two tetrahedra are called orthologic if the lines through vertices of one and perpendicular to corresponding faces of the other are intersecting. This is equivalent to the orthogonality of non-corresponding edges. We prove that the…

The paper presents the results from a multi-year effort to develop and validate image processing methods for selecting the best physical models based on solar image observations. The approach consists of selecting the physical models based…

We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the…

Let $n\geq 3$ and $r_n$ be a $3$-polytopal graph such that for every $3\leq i\leq n$, $r_n$ has at least one vertex of degree $i$. We find the minimal vertex count for $r_n$. We then describe an algorithm to construct the graphs $r_n$. A…

There are two particular $\Theta_6$-graphs - the 6-cycle graphs with a diagonal. We find the planar Tur\'an number of each of them, i.e. the maximum number of edges in a planar graph $G$ of $n$ vertices not containing the given $\Theta_6$…

We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural embedding in the torus or in the Klein bottle. We also show that locally grid graphs are minors of hexagonal tilings…

This paper presents a novel space-filling polyhedron (SFPH), here named the Josehedron, derived from the extremal points of the Fischer-Koch S triply periodic minimal surface (TPMS). The Josehedron is a plesiohedron with 12 faces (4…