Related papers: Complementary regions for immersions of surfaces

Given a $k$-colouring of the edges of the complete graph $K_n$, are there $k-1$ monochromatic components that cover its vertices? This important special case of the well-known Lov\'asz-Ryser conjecture is still open. In this paper we…

We provide two methods to characterize the connectedness of all $d$-dimensional generalized Sierpi\'nski sponges whose corresponding IFSs are allowed to have rotational and reflectional components. Our approach is to reduce it to an…

If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…

Global isothermic immersions are defined and studied with the aid of a connection between quadratic differentials and immersions. The applications are two problems stemming from the fundamental question: how much data is needed to identify…

Covering arrays are combinatorial objects that have been successfully applied in the design of test suites for testing systems such as software, circuits and networks, where failures can be caused by the interaction between their…

We elaborate the concept of entanglement for multipartite system with bosonic and fermionic constituents and its generalization to systems with arbitrary parastatistics. The entanglement is characterized in terms of generalized Segre maps,…

Let F be a closed orientable surface. We give an explicit formula for the number mod 2 of quadruple points occurring in any generic regular homotopy between any two regularly homotopic embeddings e,e':F -> R^3. The formula is in terms of…

The study of topological information of spatial objects has for a long time been a focus of research in disciplines like computational geometry, spatial reasoning, cognitive science, and robotics. While the majority of these researches…

We show the existence of various families of properly embedded singly periodic minimal surfaces in R^3 with finite arbitrary genus and Scherk type ends in the quotient. The proof of our results is based on the gluing of small perturbations…

We prove the existence of a family of embedded doubly periodic minimal surfaces of (quotient) genus $g$ with orthogonal ends that generalizes the classical doubly periodic surface of Scherk and the genus-one Scherk surface of Karcher. The…

In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…

Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…

We examine the structure of Farey maps, which are a class of maps (graph embeddings on surfaces) that have received significant attention recently. We describe how they are related to each other through regular coverings and parallel…

Given two $k$-uniform hypergraphs $F$ and $G$, we say that $G$ has an $F$-covering if for every vertex in $G$ there is a copy of $F$ covering it. For $1\leq i\leq k-1$, the minimum $i$-degree $\delta_i(G)$ of $G$ is the minimum integer such…

We attach two binary codes to a projective nodal surface (the strict code K and, for even degree d, the extended code K' ) to investigate the `Nodal Severi varieties F(d, n) of nodal surfaces in P^3 of degree d and with n nodes, and their…

Let $f = x_1^{a_1} + x_2^{a_2} + x_3^{a_3} + 1 \in \mathbb{C}[x_1,x_2,x_3]$ and let $g = y_1^{b_1} + y_2^{b_2} + y_3^{b_3} + 1 \in \mathbb{C}[y_1,y_2,y_3]$ where $a_1,a_2,a_3,b_1,b_2,b_3 \geq 2$. We prove that the surfaces $V(f) \subset…

A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between colorings and flows to design an efficient algorithm for…

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

We introduce the notion of locally identifying coloring of a graph. A proper vertex-coloring c of a graph G is said to be locally identifying, if for any adjacent vertices u and v with distinct closed neighborhood, the sets of colors that…

Let $H$ be a hypergraph. For a $k$-edge coloring $c : E(H) \to \{1,...,k\}$ let $f(H,c)$ be the number of components in the subhypergraph induced by the color class with the least number of components. Let $f_k(H)$ be the maximum possible…