Related papers: A topological characterization of Gauss codes

We define a computable topological invariant $\mu(\gamma)$ for generic closed planar regular curves $\gamma$, which gives an effective lower bound for the number of inflection points on a given generic closed planar curve. Using it, we…

For a graph $G$, let $\sigma_{2}(G)$ be the minimum degree sum of two non-adjacent vertices in $G$. A chord of a cycle in a graph $G$ is an edge of $G$ joining two non-consecutive vertices of the cycle. In this paper, we prove the following…

We study the middle convolution of local systems on the punctured affine line in the setting of singular cohomology and in the setting of \'etale cohomology. We derive a formula to compute the topological monodromy of the middle convolution…

A geometric graph is a graph whose vertices are points in general position in the plane and its edges are straight line segments joining these points. In this paper we give an $O(n^2 \log n)$ algorithm to compute the number of pairs of…

A pseudocircle is a simple closed curve on some surface; an arrangement of pseudocircles is a collection of pseudocircles that pairwise intersect in exactly two points, at which they cross. Ortner proved that an arrangement of pseudocircles…

Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a central topic in random linear network coding theory. Orbit codes represent a subclass of constant dimension codes. They are defined as…

We introduce a new type of sparse CSS quantum error correcting code based on the homology of hypermaps. Sparse quantum error correcting codes are of interest in the building of quantum computers due to their ease of implementation and the…

Let $G$ be a bridgeless cubic graph. Consider a list of $k$ 1-factors of $G$. Let $E_i$ be the set of edges contained in precisely $i$ members of the $k$ 1-factors. Let $\mu_k(G)$ be the smallest $|E_0|$ over all lists of $k$ 1-factors of…

Assume that $G$ is a finite group and let $a$ and $b$ be non-negative integers. We define an undirected graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and…

In this paper we introduce the notion of $\Sigma$-colouring of a graph $G$: For given subsets $\Sigma(v)$ of neighbours of $v$, for every $v\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that…

We show the refinement of the prescription for the geometric transition in the refined topological string theory and, as its application, discuss a possibility to describe $qq$-characters from the string theory point of view. Though the…

A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We say that $G$ is strictly metrizable if every…

Let $G$ a bipartite graph with vertex bipartition $\{A,B\}$ and let $m=|E(G)|$. An $(A,B)$-uniformly ordered labeling of $G$ is a labeling $f\colon V\rightarrow [0,2m]$ which, among other conditions, requires that there exists $\lambda\in…

Generalized geometry finds many applications in the mathematical description of some aspects of string theory. In a nutshell, it explores various structures on a generalized tangent bundle associated to a given manifold. In particular,…

The geometry of a graph $G$ embedded on a closed oriented surface $S$ can be probed by counting the intersections of $G$ with closed curves on $S$. Of special interest is the map $c \mapsto \mu_G(c)$ counting the minimum number of…

The \emph{thinness} of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Graphs with thinness at most two include, for example, bipartite convex graphs. Many…

A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…

Let $\bar{P}$ be a sequence of length $2n$ in which each element of $\{1,2,...,n\}$ occurs twice. Let $P'$ be a closed curve in a closed surface $S$ having $n$ points of simple auto-intersections, inducing a 4-regular graph embedded in $S$…

We establish the existence of wave-like solutions to spatially coupled graphical models which, in the large size limit, can be characterized by a one-dimensional real-valued state. This is extended to a proof of the threshold saturation…

This final degree project is devoted to study the topological classification of complex plane curves. These are subsets of $\mathbb{C}^2$ that can be described by an equation $f(x,y)=0$. Loosely speaking, curves are said to be equivalent in…