Related papers: Incircular nets and confocal conics
A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. NIC-planarity generalizes IC-planarity, which allows a vertex to be…
We give necessary and sufficient criteria for a smooth Enriques surface S in P^r to be scheme-theoretically an intersection of quadrics. Moreover we prove in many cases that, when S contains plane cubic curves, the intersection of the…
On the one hand, artificial neural networks have many successful applications in the field of machine learning and optimization. On the other hand, interferometers are integral parts of any field that deals with waves such as optics,…
We introduce an end-to-end learnable technique to robustly identify feature edges in 3D point cloud data. We represent these edges as a collection of parametric curves (i.e.,lines, circles, and B-splines). Accordingly, our deep neural…
We prove that triangulated IC-planar and NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. A drawing is IC-planar if, in addition, each vertex is…
We study the existence of linear series on curves lying on an Enriques surface and general in their complete linear system. Using a method that works also below the Bogomolov-Reider range, we compute, in all cases, the gonality of such…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…
Given a set of objects $O$ in the plane, the corresponding intersection graph is defined as follows. Each object defines a vertex and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit…
We review recent results on Integrable Discrete Geometry. It turns out that most of the known (continuous and/or discrete) integrable systems are particular symmetries of the quadrilateral lattice, a multidimensional lattice characterized…
Quantification of symmetries in complex networks is typically done globally in terms of automorphisms. Extending previous methods to locally assess the symmetry of nodes is not straightforward. Here we present a new framework to quantify…
Let $C$ be a general plane quartic and let ${\rm Fl}(C)$ denote the configuration of inflection lines of $C$. We show that if $D$ is any plane quartic with the same configuration of inflection lines ${\rm Fl}(C)$, then the quartics $C$ and…
For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…
Consider the Euclidean space $\mathbb{R}^3$ endowed with a canonical semi-symmetric non-metric connection determined by a vector field $\mathsf{C}\in\mathfrak{X}(\mathbb{R}^3)$. We study surfaces when the sectional curvature with respect to…
Regular incidence complexes are combinatorial incidence structures generalizing regular convex polytopes, regular complex polytopes, various types of incidence geometries, and many other highly symmetric objects. The special case of…
Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We prove a ham-sandwich cut theorem: given two sets of n lines in R^2, there is a line l such that in both line…
We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, respectively. A drawing of a graph is 1-planar if every edge…
We show that every ridge unfolding of an $n$-cube is without self-overlap, yielding a valid net. The results are obtained by developing machinery that translates cube unfolding into combinatorial frameworks. Moreover, the geometry of the…
A central question in invariant theory is that of determining the relations among invariants. Geometric invariant theory quotients come with a natural ample line bundle, and hence often a natural projective embedding. This question…
In this paper, we continue the study of the relation between rational points of rational elliptic surfaces and plane curves. As an application, we give first examples of Zariski pairs of cubic-line arrangements that do not involve…
A cluster graph is a graph whose every connected component is a complete graph. Given a simple undirected graph $G$, a subset of vertices inducing a cluster graph is called an independent union of cliques (IUC), and the IUC polytope…