Related papers: Decomposition of surface into quadrilaterals
In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of…
Digraphs are generalizations of graphs in which each edge is assigned with a direction or two directions. In this paper, we define discrete Morse functions on digraphs, and prove that the homology of the Morse complex and the path homology…
We study the problem of desingularizing coassociative conical singularities via gluing, allowing for topological and analytic obstructions, and discuss applications. This extends the author's earlier work on the unobstructed case. We…
In our articles of recent years, the technique of gluing two subharmonic functions turned out to be very useful in studying the distribution of the roots or masses of holomorphic or subharmonic functions, respectively. Here we develop and…
The shape of homogeneous, generic, smooth convex bodies as described by the Euclidean distance with nondegenerate critical points, measured from the center of mass represents a rather restricted class M_C of Morse-Smale functions on S^2.…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…
We study the leading singularities for pure gluon amplitudes obtained by on-shell gluing of three-particle amplitudes for an arbitrary graph in any number of dimensions. By encoding the polarization vector contractions in a graphical way,…
We will discuss a method for visual presentation of knotted surfaces in the four space, by examining a number and a position of its Morse's critical points. Using this method, we will investigate surface-knot with one critical point of…
A Morse 2-function is a generic smooth map from a manifold M of arbitrary finite dimension to a surface B. Its critical set maps to an immersed collection of cusped arcs in B. The aim of this paper is to explain exactly when it is possible…
In this paper the number of ways to glue a surface of genus $g$ has been investigated. We've proven formulas for the number of gluings sphere from three polygons and from two bicolored polygons. Moreover, we've given a new proofs on the…
A knotted surface in the 4-sphere may be described by means of a hyperbolic diagram that captures the 0-section of a special Morse function, called a hyperbolic decomposition. We show that every hyperbolic decomposition of a knotted surface…
A classification of discrete integrable systems on quad-graphs, i.e. on surface cell decompositions with quadrilateral faces, is given. The notion of integrability laid in the basis of the classification is the three-dimensional…
A line field on a manifold is a smooth map which assigns a tangent line to all but a finite number of points of the manifold. As such, it can be seen as a generalization of vector fields. They model a number of geometric and physical…
We develop a gluing theory in the sense of Koll\'{a}r for slc surfaces and threefolds in positive characteristic. For surfaces we are able to deal with every positive characteristic $p$, while for threefolds we assume that $p>5$. Along the…
A previous result about the decategorified bordered (sutured) Heegaard Floer invariants of surfaces glued together along intervals, generalizing the decategorified content of Rouquier and the author's higher-tensor-product-based gluing…
We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…
On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…
The problem of classifying graphs is ubiquitous in machine learning. While it is standard to apply graph neural networks or graph kernel methods, Gaussian processes can be employed by transforming spatial features from the graph domain into…
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
This paper brings together three distinct theories with the goal of quantifying shape textures with complex morphologies. Distance fields are central objects in shape representation, while topological data analysis uses algebraic topology…