Related papers: Orientation of good covers
There are various results connecting ranks of incidence matrices of graphs and hypergraphs with their combinatorial structure. Here, we consider the generalized incidence matrix $N_2$ (defined by inclusion of pairs in edges) for one natural…
We show the nonequivalence of combinations of several natural geometric restrictions on trapezoid representations of trapezoid orders. Each of the properties unit parallelogram, unit trapezoid and proper parallelogram, unit trapezoid and…
Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…
Triangle centers are usually studied individually or through special geometric relationships, but little attention has been given to global structure among them. In this paper we introduce several natural ways to order triangle centers,…
An orientation of $G$ is a digraph obtained from $G$ by replacing each edge by exactly one of two possible arcs with the same endpoints. We call an orientation \emph{proper} if neighbouring vertices have different in-degrees. The proper…
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged…
Let ${\cal H}(P,C_3)$ be the set of order homomorphisms from a poset $P$ to the chain $C_3 = 1 < 2 < 3$. We develop a recursive approach for the calculation of the cardinality of ${\cal H}(P,C_3)$, and we apply it on several types of…
In this paper we theoretically show that interior-point methods based on self-concordant barriers possess favorable global complexity beyond their standard application area of convex optimization. To do that we propose first- and…
We consider conditions which force a well-quasi-ordered poset (wqo) to be better-quasi-ordered (bqo). In particular we obtain that if a poset $P$ is wqo and the set $S_{\omega}(P)$ of strictly increasing sequences of elements of $P$ is bqo…
Motivated by applications in production planning and storage allocation in hierarchical databases, we initiate the study of covering partially ordered items (CPO). Given a capacity $k \in \mathbb{Z}^+$, and a directed graph $G=(V,E)$ where…
Reading order detection is the foundation of document understanding. Most existing methods rely on uniform supervision, implicitly assuming a constant difficulty distribution across layout regions. In this work, we challenge this assumption…
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$…
We use a combination of neutron and X-ray total scattering measurements together with pair distribution function (PDF) analysis to characterise the variation in local structure across the orbital order--disorder transition in LaMnO$_3$. Our…
Let $\mathcal{T}$ be a set of $n$ flat (planar) semi-algebraic regions in $\mathbb{R}^3$ of constant complexity (e.g., triangles, disks), which we call plates. We wish to preprocess $\mathcal{T}$ into a data structure so that for a query…
We classify primitive non-symplectic automorphisms of order 6 on K3 surfaces. We show how their study can be reduced to the study of non-symplectic automorphisms of order 3 and to a local analysis of the fixed loci. In particular, we…
In this paper we study graphs which admit acyclic orientations that contain a pair of arc-disjoint out-branching and in-branching (such an orientation is called good) and we focus on edge-minimal such graphs. A 2T-graph is a graph whose…
We explicitly construct a collection of bad 3-orbifolds, \(\mathcal{X}\), satisfying the following properties: \begin{enumerate} \item The underlying topological space of any \(X \in \mathcal{X}\) is homeomorphic to $S^2\times I$ or…
We consider a certifiable object pose estimation problem, where -- given a partial point cloud of an object -- the goal is to not only estimate the object pose, but also to provide a certificate of correctness for the resulting estimate.…
An n-simplex is said to be n-well-centered if its circumcenter lies in its interior. We introduce several other geometric conditions and an algebraic condition that can be used to determine whether a simplex is n-well-centered. These…
We consider the orbital ordering in LaMnO3 and similar systems, proceeding from the band picture. We show that for the realistic magnetic structure of A-type there exists a complete nesting betweeen two e_g-bands. As a result there occurs…