English
Related papers

Related papers: Orientation of good covers

200 papers

Consider an ordered point set $P = (p_1,\ldots,p_n)$, its order type (denoted by $\chi_P$) is a map which assigns to every triple of points a value in $\{+,-,0\}$ based on whether the points are collinear(0), oriented clockwise(-) or…

Computational Geometry · Computer Science 2019-07-11 Ivor van der Hoog , Tillmann Miltzow , Martijn van Schaik

Coordination geometries describe how the neighbours of a central particle are arranged around it. Such geometries can be thought to lie in an abstract topological space; a model of this space could provide a mathematical basis for…

Mathematical Physics · Physics 2023-06-28 John Çamkıran , Fabian Parsch , Glenn D. Hibbard

A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…

Logic · Mathematics 2025-06-12 Lorenzo Carlucci , Leonardo Mainardi , Konrad Zdanowski

We study graphs which admit an acyclic orientation that contains an out-branching and in-branching which are arc-disjoint (such an orientation is called {\bf good}). A {\bf 2T-graph} is a graph whose edge set can be decomposed into two…

Combinatorics · Mathematics 2019-12-11 Joergen Bang-Jensen , Matthias Kriesell

Given a real finite hyperplane arrangement A and a point p not on any of the hyperplanes, we define an arrangement vo(A,p), called the *valid order arrangement*, whose regions correspond to the different orders in which a line through p can…

Combinatorics · Mathematics 2013-06-11 Richard P. Stanley

If a finite group of orientation-preserving diffeomorphisms of the 3-dimensional torus leaves invariant an oriented, closed, embedded surface of genus g>1 and preserves the orientation of the surface, then its order is bounded from above by…

Geometric Topology · Mathematics 2018-04-10 Chao Wang , Bruno Zimmermann

A relatively common sight in graphic designs is a planar arrangement of three gears in contact. However, since neighboring gears must rotate in opposite directions, none of the gears can move. We give a non-planar, and non-frozen,…

History and Overview · Mathematics 2013-04-26 Saul Schleimer , Henry Segerman

A balanced pair in an ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We define the notion of a good pair and…

Combinatorics · Mathematics 2017-06-20 Imed Zaguia

We discuss initial-boundary value problems of arbitrary spatial order subject to arbitrary boundary conditions. We formalise the concept of the conditioning of such a problem and show that it represents a necessary criterion for…

Analysis of PDEs · Mathematics 2012-12-24 David A. Smith

A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of pseudocircles was initiated by Gr\"unbaum, who defined them as collections of simple closed curves that pairwise intersect in exactly two…

Computational Geometry · Computer Science 2020-01-20 Stefan Felsner , Manfred Scheucher

Using a well-ordering on the reals, one can prove there exists a partition of the three-dimensional Euclidean space into unit circles (PUC). We show that the converse does not hold: there exist models of $\mathsf{ZF}$ without a…

Logic · Mathematics 2025-01-07 Azul Fatalini

We show that a closed orientable 3--dimensional manifold admits a round fold map into the plane, i.e. a fold map whose critical value set consists of disjoint simple closed curves isotopic to concentric circles, if and only if it is a graph…

Geometric Topology · Mathematics 2023-11-15 Naoki Kitazawa , Osamu Saeki

It is a classical result that an unrooted tree $T$ having positive real-valued edge lengths and no vertices of degree two can be reconstructed from the induced distance between each pair of leaves. Moreover, if each non-leaf vertex of $T$…

Combinatorics · Mathematics 2017-07-26 Stefan Gruenewald , Katharina T. Huber , Vincent Moulton , Mike Steel

Given a planar triangulation, a 3-orientation is an orientation of the internal edges so all internal vertices have out-degree three. Each 3-orientation gives rise to a unique edge coloring known as a Schnyder wood that has proven powerful…

Data Structures and Algorithms · Computer Science 2012-02-23 Sarah Miracle , Dana Randall , Amanda Pascoe Streib , Prasad Tetali

In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…

Algebraic Geometry · Mathematics 2026-04-15 Simone Marchesi , Jean Vallès

It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…

Combinatorics · Mathematics 2014-10-10 Jürgen Bokowski , Jurij Kovič , Tomaž Pisanski , Arjana Žitnik

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

Finding the Time-Optimal Parameterization of a Path (TOPP) subject to second-order constraints (e.g. acceleration, torque, contact stability, etc.) is an important and well-studied problem in robotics. In comparison, TOPP subject to…

Robotics · Computer Science 2017-09-20 Hung Pham , Quang-Cuong Pham

In this paper we study the (equivariant) topological types of a class of 3-dimensional closed manifolds (i.e., 3-dimensional small covers), each of which admits a locally standard $(\mathbb{Z}_2)^3$-action such that its orbit space is a…

Geometric Topology · Mathematics 2011-04-08 Zhi Lü , Li Yu

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…