Related papers: Cuspidal edges with the same first fundamental for…
We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc…
We treat the notion of principal symbol mapping on a compact smooth manifold as a $\ast$-homomorphism of $C^{\ast}$-algebras. Principal symbol mapping is built from the ground, without referring to the pseudodifferential calculus on the…
A graph is c-closed if every pair of vertices with at least c common neighbors is adjacent. The c-closure of a graph G is the smallest number such that G is c-closed. Fox et al. [ICALP '18] defined c-closure and investigated it in the…
We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…
Let $C$ be a smooth, projective and geometrically connected curve defined over a finite field $\mathbb{F}_q(C)$. Given a semisimple $C-S$-group scheme $\underline{G}$ where $S$ is a finite set of closed points of $C$, we describe the set of…
Let $\Sigma$ be a smooth projective surface, let $f' : S' \to \Sigma$ be a double cover of $\Sigma$ and let $\mu : S \to S'$ be the canonical resolution. Put $f = f'\circ\mu$. An irreducible curve $C$ on $\Sigma$ is said to be a splitting…
In this paper, we consider rational cuspidal plane curves having at least three cusps. We give an upper bound of the self-intersection number of the proper transforms of such curves via the minimal embedded resolution of the cusps. For a…
Consider an oriented curve $\Gamma$ in a domain $D$ in the plane $\boldsymbol R^2$. Thinking of $D$ as a piece of paper, one can make a curved folding in the Euclidean space $\boldsymbol R^3$. This can be expressed as the image of an…
In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered graph is c-planar if it has no edge-edge, edge-region, or…
We show that if a knot or link has n thin levels when put in thin position then its exterior contains a collection of n disjoint, non-parallel, planar, meridional, essential surfaces. A corollary is that there are at least n/3 tetrahedra in…
We fix a null-homologous, homotopically essential knot $J$ in a 3-manifold with PTFA fundamental group and study concordance of knots that are homotopic to $J$. We construct an infinite family of knots that are characteristic to $J$, and…
Critical nets in $\mathbb{R}^k$ (sometimes called geodesic nets) are embedded graph with the property that their embedding is a critical point of the total (edge) length functional and under the constraint that certain 1-valent vertices…
The \emph{$k$-restricted edge-connectivity} of a graph $G$, denoted by $\lambda_k(G)$, is defined as the minimum size of an edge set whose removal leaves exactly two connected components each containing at least $k$ vertices. This graph…
We define \emph{piecewise rank 1} manifolds, which are aspherical manifolds that generally do not admit a nonpositively curved metric but can be decomposed into pieces that are diffeomorphic to finite volume, irreducible, locally symmetric,…
In the last years, connection concepts such as rainbow connection and proper connection appeared in graph theory and obtained a lot of attention. In this paper, we investigate the loose edge-connection of graphs. A connected edge-coloured…
We prove that any two $C^3$ critical circle maps with the same irrational rotation number of bounded type and the same odd criticality are conjugate to each other by a $C^{1+\alpha}$ circle diffeomorphism, for some universal $\alpha>0$.
Let $G=(V,E)$ be a simple connected graph. A connected edge cover of $G$ is a subset $S\subseteq E$ such that every vertex of $G$ is incident with at least one edge in $S$ and the subgraph induced by $S$ is connected. The connected edge…
Given graphs $H_1, H_2$, a {red, blue}-coloring of the edges of a graph $G$ is a critical coloring if $G$ has neither a red $H_1$ nor a blue $ H_2$. A non-complete graph $G$ is $(H_1, H_2)$-co-critical if $G$ admits a critical coloring, but…
When a solenoid is embedded in three space, its complement is an open three manifold. We discuss the geometry and fundamental groups of such manifolds, and show that the complements of different solenoids (arising from different inverse…
Petersen's seminal work in 1891 asserts that the edge-set of a cubic graph can be covered by distinct perfect matchings if and only if it is bridgeless. Actually, it is known that for a very large fraction of bridgeless cubic graphs, every…