Related papers: Doubling chains on complements of algebraic hypers…

We give a differential-geometric construction of Calabi-Yau fourfolds by the `doubling' method, which was introduced in \cite{DY14} to construct Calabi-Yau threefolds. We also give examples of Calabi-Yau fourfolds from toric Fano fourfolds.…

For $d\geq 2$, we discuss $d$-dimensional complex manifolds $M$ that are the increasing union of bounded open sets $M_n$'s of $\mathbb{C}^d$ with a common uniform squeezing constant. The description of $M$ is given in terms of the corank of…

Resolving an open question from 2006, we prove the existence of light-weight bounded-degree spanners for unit ball graphs in the metrics of bounded doubling dimension, and we design a simple $\mathcal{O}(\log^*n)$-round distributed…

We introduce the so--called doubling metric on the collection of non--empty bounded open subsets of a metric space. Given a subset $U$ of a metric space $X$, the predecessor $U_{*}$ of $U$ is defined by doubling the radii of all open balls…

Bidirected graphs are a common generalisation of directed graphs where arcs can also be incoming to both their incident nodes, or outgoing from both their incident nodes. Such arcs allow a walk to change direction. Some algorithms can…

The paper is a contribution to the conjecture of Kobayashi that the complement of a generic curve in the projective plane is hyperbolic, provided the degree is at least five. Previously the authors treated the cases of two quadrics and a…

Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…

The $d$-dimensional hypercube graph $Q_d$ has as vertices all subsets of $\{1,\ldots,d\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture asserts that every matching of $Q_d$, $d\ge 2$, can be…

We study the chiral ring of four-dimensional superconformal field theories obtained by wrapping M5-branes on a complex curve inside a Calabi-Yau three-fold. We propose a field theoretic construction of all the theories found by Bah, Beem,…

We study the link between a compact hypersurface in $\P^{n+1}$ and the set of all its tangent planes. In this context, we identify $\P^{n+1}$ to the set of linear subspaces of codimension one by orthogonal complementarity. This gives rise…

A circuit double cover of a bridgeless graph is a collection of even subgraphs such that every edge is contained in exactly two subgraphs of the given collection. Such a circuit double cover describes an embedding of the corresponding graph…

The alpha complex is a fundamental data structure from computational geometry, which encodes the topological type of a union of balls $B(x; r) \subset \mathbb{R}^m$ for $x\in S$, including a weighted version that allows for varying radii.…

This is the fourth paper in the CayleyPy project, which applies AI methods to the exploration of large graphs. In this work, we suggest the existence of a new discrete version of holographic string dualities for this setup, and discuss…

We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…

Proximity maps and regions are defined based on the relative allocation of points from two or more classes in an area of interest and are used to construct random graphs called proximity catch digraphs (PCDs) which have applications in…

The Harary--Hill conjecture, still open after more than 50 years, asserts that the crossing number of the complete graph $K_n$ is $ H(n) = \frac 1 4 \left\lfloor\frac{\mathstrut n}{\mathstrut 2}\right\rfloor \left\lfloor\frac{\mathstrut…

A bond in a graph is a minimal nonempty edge-cut. A connected graph $G$ is dual Hamiltonian if the vertex set can be partitioned into two subsets $X$ and $Y$ such that the subgraphs induced by $X$ and $Y$ are both trees. There is much…

Working on doubling metric spaces, we construct generalised dyadic cubes adapting ultrametric structure. If the space is complete, then the existence of such cubes and the mass distribution principle lead into a simple proof for the…

The covering spectrum is a geometric invariant of a Riemannian manifold, more generally of a metric space, that measures the size of its one-dimensional holes by isolating a portion of the length spectrum. In a previous paper we…

Given a hypergraph $\mathcal{H}$, the dual hypergraph of $\mathcal{H}$ is the hypergraph of all minimal transversals of $\mathcal{H}$. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner…