Related papers: k-nets embedded in a projective plane over a field

Many mathematical models have been leveraged to design embeddings for representing Knowledge Graph (KG) entities and relations for link prediction and many downstream tasks. These mathematically-inspired models are not only highly scalable…

We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…

Let $K_4$ be the complete graph on four vertices. Let $f$ be a continuous map of $K_4$ to the plane such that $f$-images of non-adjacent edges are disjoint. For any vertex $v \in K_4$ take the winding number of the $f$-image of the cycle…

We present a new model for hybrid planarity that relaxes existing hybrid representations. A graph $G = (V,E)$ is $(k,p)$-planar if $V$ can be partitioned into clusters of size at most $k$ such that $G$ admits a drawing where: (i) each…

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

A maximal arc of degree k in a finite projective plane P of order q = ks is a set of (q-s+1)k points that meets every line of P in either k or 0 points. The collection of the nonempty intersections of a maximal arc with the lines of P is a…

A pentagonal geometry PENT($k$, $r$) is a partial linear space, where every line, or block, is incident with $k$ points, every point is incident with $r$ lines, and for each point $x$, there is a line incident with precisely those points…

This paper discusses some geometric ideas associated with knots in real projective 3-space $\mathbb{R}P^3$. These ideas are borrowed from classical knot theory. Since knots in $\mathbb{R}P^3$ are classified into three disjoint classes, -…

Over any field $\mathbb K$, there is a bijection between regular spreads of the projective space ${\rm PG}(3,{\mathbb K})$ and $0$-secant lines of the Klein quadric in ${\rm PG}(5,{\mathbb K})$. Under this bijection, regular parallelisms of…

The $2$-layer drawing model is a well-established paradigm to visualize bipartite graphs. Several beyond-planar graph classes have been studied under this model. Surprisingly, however, the fundamental class of $k$-planar graphs has been…

In this paper, we make use of the relations between the braid and mapping class groups of a compact, connected, non-orientable surface N without boundary and those of its orientable double covering S to study embeddings of these groups and…

Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…

We introduce a new method to study mixed characteristic deformation of line bundles. In particular, for sufficiently large smooth projective families $f : \mathscr{X} \to \mathscr{S}$ defined over the ring of $N$-integers…

Let E be the supersingular elliptic curve defined over k, the algebraic closure of the finite field with two elements, which is unique up to k-isomorphism. Denote by 0 its identity element and let C be the quotient of E-{0} under the action…

Let $f:X \to \mathbb{P}^1$ be a non-isotrivial family of semi-stable curves of genus $g\geq 1$ defined over an algebraically closed field $k$ with $s_{nc}$ singular fibers whose Jacobians are non-compact. We prove that $s_{nc}\geq 5$ if…

In Functional Analysis, certain conclusions apply to sequences, but they cannot be carried over when we consider nets. In fact, some nets, including sequences, can behave unexpectedly. In this paper we are interested in exploring the…

We consider the class F of 2-connected non-planar K_{3,3}-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K_5 (the core) where the edges are replaced by…

Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest $k$ such that the graph is $k$-splittable into a planar graph. A $k$-split operation…

A graph $G$ is $k$-edge geodetic graph if every edge of $G$ lies in at least one geodesic of length $k$. We studied some basic properties of $k$-edge geodetic graphs. We investigated the $k$ edge-geodeticity of complete bipartite graph…

The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…