Related papers: A Theory of L-shaped Floor-plans
We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…
The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back…
The notion of L-boundary, a new causal boundary proposed by R. Low based on constructing a `sky at infinity' for any light ray, is discussed in detail. The analysis of the notion of L-boundary will be done in the 3-dimensional situation for…
An oriented graph is said positively multiplicative when its adjacency matrix $A$ embeds in a matrix algebra admitting a basis $\mathsf{B}$ with nonnegative structure constants in which the matrix of the multiplication by $A$ coincides with…
This paper presents a geometric description on Lie algebroids of Lagrangian systems subject to nonholonomic constraints. The Lie algebroid framework provides a natural generalization of classical tangent bundle geometry. We define the…
It is proved that a generic simple, closed, piecewise regular curve in space can be the boundary of only finitely many developable surfaces with nonvanishing mean curvature. The relevance of this result in the context of the dynamics of…
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median…
We show existence of solutions to the least gradient problem on the plane for boundary data in $BV(\partial\Omega)$. We also provide an example of a function $f \in L^1(\partial\Omega) \backslash (C(\partial\Omega) \cup…
Suppose that $R$ is an associative unital ring and that $E=(E^0,E^1,r,s)$ is a directed graph. Utilizing results from graded ring theory we show, that the associated Leavitt path algebra $L_R(E)$ is simple if and only if $R$ is simple,…
A graph is reducible if it is the lexicographic product of two smaller non-trivial graphs. It is well-known a 1-planar graph with $n ~(\ge3)$ vertices has at most $4n-8$ edges, and a graph $G$ with $n$ vertices is optimal if $G$ has exactly…
We consider three simple quadratic time algorithms for the problem Level Planarity and give a level-planar instance that they either falsely report as negative or for which they output a drawing that is not level planar.
In this paper, we introduce the notion of 2-boundary planar graphs. A graph is 2-boundary planar if it has an embedding in the plane so that all vertices lie on the boundary of at most two faces and no edges are crossed. A proper coloring…
Suppose that $G=(V, E)$ be a locally finite and connected graph with symmetric weight and uniformly positive measure, where $V$ denotes the vertex set and $E$ denotes the edge set. We are concered with the following problem $$…
Considering regular graphs with every edge in a triangle we prove lower bounds for the number of triangles in such graphs. For r-regular graphs with r <= 5 we exhibit families of graphs with exactly that number of triangles and then…
We construct examples of smooth surfaces S in P^6 with no trisecant lines. This list includes examples of surfaces not cut out by quadrics. We prove that unless S has a finite number of disjoint $(-1)$-lines, and each one meets some other…
We classify completely the surfaces of general type whose canonical map is 3-to-1 onto a surface of minimal degree in projective space. These surfaces fall into 5 distinct classes and we give explicit examples belonging to each of these…
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 establish a concavity principle for solutions to elliptic and parabolic equations on locally symmetric spaces with nonnegative sectional curvature, extending the results of Langford and Scheuer. To the best of our knowledge, this is the…
A one-degree-of-freedom graph is a graph obtained from a minimally rigid graph in the plane and removing an edge. For such graph, the set of realisations with fixed edge length, modulo rotations and reflections, is an algebraic curve. The…
Any simple planar graph can be triangulated, i.e., we can add edges to it, without adding multi-edges, such that the result is planar and all faces are triangles. In this paper, we study the problem of triangulating a planar graph without…