Related papers: Orientation of good covers
We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…
A strong triangle blocking arrangement is a geometric arrangement of some line segments in a triangle with certain intersection properties. It turns out that they are closely related to blocking sets. Our aim in this paper is to prove a…
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…
Solid matter is classified through symmetry of ordering phenomena. Experimentally, this approach is straightforward, except when distinct orderings occur with identical or almost identical symmetry breaking. Here we show that the cuprate…
The `linear orbit' of a plane curve of degree $d$ is its orbit in $\P^{d(d+3)/2}$ under the natural action of $\PGL(3)$. In this paper we obtain an algorithm computing the degree of the closure of the linear orbit of an arbitrary plane…
Understanding how molecules arrange on surfaces is fundamental to surface chemistry and essential for the rational design of catalytic and functional materials. In particular, the energetically most stable configuration provides valuable…
The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…
We investigate the orderability properties of fundamental groups of 3-dimensional manifolds. Many 3-manifold groups support left-invariant orderings, including all compact P^2-irreducible manifolds with positive first Betti number. For…
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…
This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by…
This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…
In this paper we firstly review how to \textit{explicitly} solve a system of $3$ \textit{first-order linear recursions }and outline the main properties of these solutions. Next, via a change of variables, we identify a class of systems of…
In a recent paper Y. Hu has given a sufficient condition for the fundamental group of the r-th cyclic branched covering of S^3 along a prime knot to be left-orderable in terms of representations of the knot group. Applying her criterion to…
Orientation estimation is a fundamental task in 3D shape analysis which consists of estimating a shape's orientation axes: its side-, up-, and front-axes. Using this data, one can rotate a shape into canonical orientation, where its…
In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…
We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three classes of the 3-net comprises concurrent lines, and irregular…
The family of complex projective surfaces in projective three space of degree $d$ having precisely $\delta$ nodes as their only singularities has codimension $\delta$ in the linear system of surfaces of degree $d$ for sufficiently large $d$…
The main purpose of this article is to pose three problems which are easy to be formulated in an elementary way. These problems which are specifically important also for the new class of partially ordered sets seem to be not yet solved.
We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in…
We construct a system of 33 essential simple closed curves that are pairwise non-homotopic and intersect at most once on the oriented, closed surface of genus 3. Moreover, we show that our construction is saturated, in the sense that it is…