相关论文: Planar Linkages and Algebraic Sets
A rectangular drawing of a planar graph $G$ is a planar drawing of $G$ in which vertices are mapped to grid points, edges are mapped to horizontal and vertical straight-line segments, and faces are drawn as rectangles. Sometimes this latter…
We define and study complex structures and generalizations on spaces consisting of geodesics or harmonic maps that are compatible with the symmetries of these spaces. The main results are about existence and uniqueness of such structures.
A multi-relational graph maintains two or more relations over a vertex set. This article defines an algebra for traversing such graphs that is based on an $n$-ary relational algebra, a concatenative single-relational path algebra, and a…
In this note we show that abstract planar algebras are algebras over the topological operad of moduli spaces of stable maps with Lagrangian boundary conditions, which in the case of the projective line are described in terms of real…
Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…
Many, if not most network analysis algorithms have been designed specifically for single-relational networks; that is, networks in which all edges are of the same type. For example, edges may either represent "friendship," "kinship," or…
Algebraic operations are understood as topologiztion of algebra. They become an example of simplest convergence space. In our article the convergence is a arbitrary multivalued appointment. The continuity of some mapping between two…
Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown that spanning forcing paths of a zero forcing process form a…
The parallel linear transports defined by flat linear connection are axiomatically described. On this basis a number of properties, some of which are new, of these transports and connections are derived.
The task of link prediction for knowledge graphs is to predict missing relationships between entities. Knowledge graph embedding, which aims to represent entities and relations of a knowledge graph as low dimensional vectors in a continuous…
In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
The complete classification of hexapods - also known as Stewart Gough platforms - of mobility one is still open. To tackle this problem, we can associate to each hexapod of mobility one an algebraic curve, called the configuration curve. In…
There are various concepts of structure preserving mappings in geometry. It is the aim of the present paper to give a survey on geometrical characterizations of some of those mappings. We discuss the results for projective spaces in some…
For finite abstract simplicial complex $\Sigma$, initial realization $\alpha$ in $\mathbb{E}^d$, and desired edge lengths $L$, we give practical sufficient conditions for the existence of a non-self-intersecting perturbation of $\alpha$…
This article is concerned with the rigidity properties of geometric realizations of incidence geometries of rank two as points and lines in the Euclidean plane; we care about the distance being preserved among collinear points. We discuss…
Graphical (Linear) Algebra is a family of diagrammatic languages allowing to reason about different kinds of subsets of vector spaces compositionally. It has been used to model various application domains, from signal-flow graphs to Petri…
A graph drawn on the plane is called $1$-plane if each edge is crossed at most once by another edge. In this paper, we show that every $4$-connected $1$-plane graph has a connected spanning plane subgraph. We also show that there exist…
Let $L$ be a sequence $(\ell_1,\ell_2,\ldots,\ell_n)$ of $n$ lines in $\mathbb{C}^3$. We define the {\it intersection graph} $G_L=([n],E)$ of $L$, where $[n]:=\{1,\ldots, n\}$, and with $\{i,j\}\in E$ if and only if $i\neq j$ and the…