Related papers: Circle immersions that can be divided into two arc…
An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…
We study a class of holomorphic matrix models. The integrals are taken over middle dimensional cycles in the space of complex square matrices. As the size of the matrices tends to infinity, the distribution of eigenvalues is given by a…
We define two categories of Dirac manifolds, i.e. manifolds with complex Dirac structures. The first notion of maps I call \emph{Dirac maps}, and the category of Dirac manifolds is seen to contain the categories of Poisson and complex…
The aim of this article is to give a rigorous geometric interpretation of the completion of a ring with respect to an ideal. To this end, we define the infinitesimal neighbourhood of an immersion of formal schemes as the largest possible…
We define virtual immersions, as a generalization of isometric immersions in a pseudo-Riemannian vector space. We show that virtual immersions possess a second fundamental form, which is in general not symmetric. We prove that a manifold…
We study curves consisting of unions of projective lines whose intersections are given by graphs. Under suitable hypotheses on the graph, these so-called \emph{graph curves} can be embedded in projective space as line arrangements. We…
We introduce an invariant linked to some foundational questions in geometric measure theory and provide bounds on this invariant by decomposing an arbitrary cycle into uniformly rectifiable pieces. Our invariant measures the difficulty of…
Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc…
Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…
We explicitly construct an embedding of a right-angled Artin group into a classical pure braid group. Using this we obtain a number of corollaries describing embeddings of arbitrary Artin groups into right-angled Artin groups and linearly…
Maximally embedding dimension (MED) numerical semigroups are a wide and interesting family, with some remarkable algebraic and combinatorial properties. Associated to any numerical semigroup one can construct a MED closure, as it is well…
The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of…
We give complete geometric invariants of cobordisms of fold maps with oriented singular set and cobordisms of even codimensional fold maps. These invariants are given in terms of cobordisms of stably framed manifolds and cobordisms of…
Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…
We present several characterizations of circle graphs, which follow from Bouchet's circle graph obstructions theorem.
The score of a vertex $x$ in an oriented graph is defined to be its outdegree, \emph{i.e.}, the number of arcs with initial vertex $x$. The score sequence of an oriented graph is the sequence of all scores arranged in nondecreasing order.…
We provide the first documented examples of immersions of closed oriented manifolds which are not homologous to embeddings, thus answering a question posed by Zhenhua Liu. In these examples we show that for any representing self-transverse…
We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.
We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…
We consider structure of typical gradient flows bifurcations on closed surfaces with minimal number of singular points. There are two type of such bifurcations: saddle-node (SN) and saddle connections (SC). The structure of a bifurcation is…