English
Related papers

Related papers: Signotopes Induce Unique Sink Orientations on Grid…

200 papers

A unique sink orientation (USO) is an orientation of the $n$-dimensional cube graph ($n$-cube) such that every face (subcube) has a unique sink. The number of unique sink orientations is $n^{\Theta(2^n)}$. If a cube orientation is not a…

Combinatorics · Mathematics 2017-04-28 Vitor Bosshard , Bernd Gärtner

Unique-sink orientations (USOs) are an abstract class of orientations of the n-cube graph. We consider some classes of USOs that are of interest in connection with the linear complementarity problem. We summarise old and show new lower and…

Combinatorics · Mathematics 2014-06-26 Jan Foniok , Bernd Gärtner , Lorenz Klaus , Markus Sprecher

A unique sink orientation (USO) is an orientation of the hypercube graph with the property that every face has a unique sink. A number of well-studied problems reduce in strongly polynomial time to finding the global sink of a USO; most…

Combinatorics · Mathematics 2022-03-30 Yuan Gao , Bernd Gärtner , Jourdain Lamperski

A unique sink orientation (USO) is an orientation of the $n$-dimensional hypercube graph such that every non-empty face contains a unique sink. Schurr showed that given any $n$-dimensional USO and any dimension $i$, the set of edges $E_i$…

Combinatorics · Mathematics 2023-10-03 Michaela Borzechowski , Simon Weber

An orientation of a grid is called unique sink orientation (USO) if each of its nonempty subgrids has a unique sink. Particularly, the original grid itself has a unique global sink. In this work we investigate the problem of how to find the…

Data Structures and Algorithms · Computer Science 2017-09-26 Xiaoming Sun , Jialin Zhang , Zhijie Zhang

Unique Sink Orientations (USOs) of cubes can be used to capture the combinatorial structure of many essential algebraic and geometric problems. For various structural and algorithmic questions, including enumeration of USOs and algorithm…

Combinatorics · Mathematics 2022-11-14 Michaela Borzechowski , Joseph Doolittle , Simon Weber

The complexity classes Unique End of Potential Line (UEOPL) and its promise version PUEOPL were introduced in 2018 by Fearnly et al. UEOPL captures search problems where the instances are promised to have a unique solution. UEOPL captures…

Computational Geometry · Computer Science 2022-09-07 Michaela Borzechowski , Wolfgang Mulzer

Let $P$ be a simple polytope with $n-d = 2$, where $d$ is the dimension and $n$ is the number of facets. The graph of such a polytope is also called a grid. It is known that the directed random walk along the edges of $P$ terminates after…

Discrete Mathematics · Computer Science 2017-05-30 Malte Milatz

A k-system of the graph G(P) of a simple polytope P is a set of induced subgraphs of G(P) that shares certain properties with the set of subgraphs induced by the k-faces of P. This new concept leads to polynomial-size certificates in terms…

Combinatorics · Mathematics 2007-05-23 Michael Joswig , Volker Kaibel , Friederike K"orner

We give bijections between bipolar-oriented (acyclic with unique source and sink) planar maps and certain random walks, which show that the uniformly random bipolar-oriented planar map, decorated by the "peano curve" surrounding the tree of…

Probability · Mathematics 2016-11-11 Richard Kenyon , Jason Miller , Scott Sheffield , David B. Wilson

The simplex algorithm using the random edge pivot-rule on any realization of a dual cyclic 4-polytope with n facets does not take more than O(n) pivot-steps. This even holds for general abstract objective functions (AOF) / acyclic unique…

Combinatorics · Mathematics 2007-05-23 Rafael Gillmann

A divide on an orientable 2-orbifold gives rise to a fibration of the unit tangent bundle to the orbifold.We characterize the corresponding monodromies as exactly the products of a left-veering horizontal and a right-veering vertical…

Dynamical Systems · Mathematics 2019-10-03 Pierre Dehornoy , Livio Liechti

Unidirectional light emission from planar photonic structures is highly advantageous for a wide range of optoelectronic applications. Recently, it has been demonstrated that unidirectional guided resonances (UGRs) can be realized by…

Optics · Physics 2023-12-04 Sun-Goo Lee , Seong-Han Kim , Wook-Jae Lee

A sink-free orientation of a finite undirected graph is a choice of orientation for each edge such that every vertex has out-degree at least 1. Bubley and Dyer (1997) use Markov Chain Monte Carlo to sample approximately from the uniform…

Probability · Mathematics 2009-09-25 Henry Cohn , Robin Pemantle , James Propp

We describe an algorithm which, given two essential curves on a surface $S$, computes their distance in the curve graph of $S$, up to multiplicative and additive errors. As an application, we present an algorithm to decide the…

Geometric Topology · Mathematics 2024-02-02 Filippo Baroni

We study the displacement function of homeomorphisms isotopic to the identity of the universal one-dimensional solenoid and we get a characterization of the lifting property for an open and dense subgroup of the isotopy component of the…

Dynamical Systems · Mathematics 2019-03-05 Francisco José López Hernández

We propose a class of spectral singularities that are sensitive to the direction of excitation and are arising in nonlinear systems with broken parity symmetry. These spectral singularities are sensitive to the direction of the incident…

Optics · Physics 2021-05-05 Hamidreza Ramezani

In the author's earlier work there appeared a new way to specify any smooth closed 4-manifold by a surface diagram, which consists of an orientable surface decorated with simple closed curves. These curves are cyclically indexed, and each…

Geometric Topology · Mathematics 2018-04-26 Jonathan D. Williams

The polytope $ASM_n$, the convex hull of the $n\times n$ alternating sign matrices, was introduced by Striker and by Behrend and Knight. A face of $ASM_n$ corresponds to an elementary flow grid defined by Striker, and each elementary flow…

Combinatorics · Mathematics 2025-03-17 Elizabeth A. Dinkelman , Walter D. Morris

An orthotube consists of orthogonal boxes (e.g., unit cubes) glued face-to-face to form a path. In 1998, Biedl et al. showed that every orthotube has a grid unfolding: a cutting along edges of the boxes so that the surface unfolds into a…

Computational Geometry · Computer Science 2023-05-02 Erik D. Demaine , Kritkorn Karntikoon
‹ Prev 1 2 3 10 Next ›