相关论文: The nine Morse generic tetrahedra
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…
A subset $S$ of vertices of a graph $G$ is in \emph{general position} if no shortest path in $G$ contains three vertices of $S$. The \emph{general position problem} consists of finding the number of vertices in a largest general position…
A Reeb space is defined as the space of all the connected components of inverse images of a smooth map, which is a fundamental tool in studying smooth manifolds using generic smooth maps whose codimensions are not positive such as Morse…
The mixed metric dimension ${\rm mdim}(G)$ of a graph $G$ is the cardinality of a smallest set of vertices that (metrically) resolves each pair of elements from $V(G)\cup E(G)$. We say that $G$ is a max-mdim graph if ${\rm mdim}(G) = n(G)$.…
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in the problem for mixed graphs, where we allow both undirected…
Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…
In this survey we present a generalization of the notion of metric space and some applications to discrete structures as graphs, ordered sets and transition systems. Results in that direction started in the middle eighties based on the…
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…
We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…
The real number system is geometrically extended to include three new anticommuting square roots of plus one, each such root representing the direction of a unit vector along the orthonormal coordinate axes of Euclidean 3-space. The…
We give a classification of ordered five points in $\mathbb P^3$ under the diagonal action of $GL_4$ over an algebraically closed field of characteristic $0$, by an explicit description of the diagonal action of $GL_4$ on the quintuple of…
We study biplane graphs drawn on a finite point set $S$ in the plane in general position. This is the family of geometric graphs whose vertex set is $S$ and which can be decomposed into two plane graphs. We show that every sufficiently…
We present the algebraic classification of the gravitational field in four-dimensional general metric-affine geometries, thus extending the current results of the literature in the particular framework of Weyl-Cartan geometry by the…
Consider a smooth, geometrically irreducible, projective curve of genus $g \ge 2$ defined over a number field of degree $d \ge 1$. It has at most finitely many rational points by the Mordell Conjecture, a theorem of Faltings. We show that…
Motivated by the graph associahedron KG, a polytope whose face poset is based on connected subgraphs of G, we consider the notion of associativity and tubes on posets. This leads to a new family of simple convex polytopes obtained by…
The center, median and the security center are three central parts defined for any connected graph whereas the characteristic set, subtree core and core vertices are three central parts defined for trees only. We extend the concept of the…
We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…
The invisibility graph $I(X)$ of a set $X \subseteq \mathbb{R}^d$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if and only if the straight-line segment connecting the two…
We define treetopes, a generalization of the three-dimensional roofless polyhedra (Halin graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base facet such that every face of dimension greater than one…
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity…