Related papers: Orientation of good covers
We introduce a forcing technique to construct three-dimensional arrays of generic extensions through FS (finite support) iterations of ccc posets, which we refer to as 3D-coherent systems. We use them to produce models of new constellations…
Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise…
The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…
We consider the \textsc{Steiner Orientation} problem, where we are given as input a mixed graph $G=(V,E,A)$ and a set of $k$ demand pairs $(s_i,t_i)$, $i\in[k]$. The goal is to orient the undirected edges of $G$ in a way that the resulting…
Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In…
We give a normal form for families of 3-dimensional Poisson structures. This allows us to classify singularities with nonzero 1-jet and typical bifurcations. The Appendix contains corollaries on classification of families of integrable…
It is well known that the P3P problem could have 1, 2, 3 and at most 4 positive solutions under different configurations among its 3 control points and the position of the optical center. Since in any real applications, the knowledge on the…
We present a novel approach to the detection and 3D pose estimation of objects in color images. Its main contribution is that it does not require any training phases nor data for new objects, while state-of-the-art methods typically require…
We provide linearizability criteria for a class of systems of third-order ordinary differential equations (ODEs) that is cubically semi-linear in the first derivative, by differentiating a system of second-order quadratically semi-linear…
A tri-linear rational map in dimension three is a rational map $\phi: (\mathbb{P}_\mathbb{C}^1)^3 \dashrightarrow \mathbb{P}_\mathbb{C}^3$ defined by four tri-linear polynomials without a common factor. If $\phi$ admits an inverse rational…
We extend the notion of canonical ordering (initially developed for planar triangulations and 3-connected planar maps) to cylindric (essentially simple) triangulations and more generally to cylindric (essentially internally) $3$-connected…
Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
In the present paper, we study conic-line arrangements having nodes, tacnodes, and ordinary triple points as singularities. We provide combinatorial constraints on such arrangements and we give the complete classification of free…
In this article, we find the complete list of all contact structures (up to isotopy) on closed three-manifolds which are supported by an open book decomposition having planar pages with three (but not less) boundary components. We…
We deal with the asymptotic enumeration of combinatorial structures on planar maps. Prominent instances of such problems are the enumeration of spanning trees, bipartite perfect matchings, and ice models. The notion of orientations with…
A theorem of Mandel allows to determine the covector set of an oriented matroid from its set of topes by using the composition condition. We provide a generalization of that result, stating that the covector set of a conditional oriented…
This paper gives a new way of characterizing L-space $3$-manifolds by using orderability of quandles. Hence, this answers a question of Adam Clay et al. [Question 1.1 of Canad. Math. Bull. 59 (2016), no. 3, 472-482]. We also investigate…
A planar order is a special linear extension of the edge poset (partially ordered set) of a processive plane graph. The definition of a planar order makes sense for any finite poset and is equivalent to the one of a conjugate order. Here it…
We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…