中文
相关论文

相关论文: Pseudo Unique Sink Orientations

200 篇论文

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$…

组合数学 · 数学 2023-10-03 Michaela Borzechowski , Simon Weber

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…

组合数学 · 数学 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…

组合数学 · 数学 2022-03-30 Yuan Gao , Bernd Gärtner , Jourdain Lamperski

A unique sink orientation (USO) is an orientation of the edges of a polytope in which every face contains a unique sink. For a product of simplices $\Delta_{m-1} \times \Delta_{n-1}$, Felsner, G\"artner and Tschirschnitz (2005) characterize…

计算几何 · 计算机科学 2026-04-07 Sandro M. Roch

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…

数据结构与算法 · 计算机科学 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…

组合数学 · 数学 2022-11-14 Michaela Borzechowski , Joseph Doolittle , Simon Weber

An acyclic USO on a hypercube is formed by directing its edges in such as way that the digraph is acyclic and each face of the hypercube has a unique sink and a unique source. A path to the global sink of an acyclic USO can be modeled as…

离散数学 · 计算机科学 2012-05-25 Yoshikazu Aoshima , David Avis , Theresa Deering , Yoshitake Matsumoto , Sonoko Moriyama

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…

计算几何 · 计算机科学 2022-09-07 Michaela Borzechowski , Wolfgang Mulzer

Pseudo-cones are a class of unbounded closed convex sets, not containing the origin. They admit a kind of polarity, called copolarity. With this, they can be considered as a counterpart to convex bodies containing the origin in the…

度量几何 · 数学 2023-10-24 Rolf Schneider

Which surfaces can be realized with two-dimensional faces of the five-dimensional cube (the penteract)? How can we visualize them? In recent work, Aveni, Govc, and Roldan, show that there exist 2690 connected closed cubical surfaces up to…

几何拓扑 · 数学 2024-03-20 Manuel Estevez , Erika Roldan , Henry Segerman

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…

概率论 · 数学 2016-11-11 Richard Kenyon , Jason Miller , Scott Sheffield , David B. Wilson

We consider the problem of orienting the edges of the $n$-dimensional hypercube so only two different in-degrees $a$ and $b$ occur. We show that this can be done, for two specified in-degrees, if and only if an obvious necessary condition…

组合数学 · 数学 2010-07-15 Joe Buhler , Steve Butler , Ron Graham , Eric Tressler

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…

离散数学 · 计算机科学 2017-05-30 Malte Milatz

A nonempty closed convex set in ${\mathbb R}^n$, not containing the origin, is called a pseudo-cone if with every $x$ it also contains $\lambda x$ for $x\ge 1$. We consider pseudo-cones with a given recession cone $C$, called…

度量几何 · 数学 2023-11-29 Rolf Schneider

We count orientable small covers over cubes. We also get estimates for $O_n/R_n$, where $O_n$ is the number of orientable small covers and $R_n$ is the number of all small covers over an $n$-cube up to the Davis-Januszkiewicz equivalence.

几何拓扑 · 数学 2010-07-06 Suyoung Choi

We study the Unique Set Cover problem on unit disks and unit squares. For a given set $P$ of $n$ points and a set $D$ of $m$ geometric objects both in the plane, the objective of the Unique Set Cover problem is to select a subset…

计算几何 · 计算机科学 2016-07-26 Saeed Mehrabi

We investigate a type of a Sudoku variant called Sudo-Kurve, which allows bent rows and columns, and develop a new, yet equivalent, variant we call a Sudo-Cube. We examine the total number of distinct solution grids for this type with or…

历史与综述 · 数学 2018-08-27 Tanya Khovanova , Wayne Zhao

We provide an integral combinatorial characterization of pseudo-Anosov maps on closed oriented surfaces of genus g > 1. We show that an orientation-preserving pseudo-Anosov homeomorphism with orientable foliations and fixing all critical…

动力系统 · 数学 2024-08-29 John H. Hubbard , Ahmad Rafiqi , Tom Schang

This paper explores the Fano variety of lines in hypersurfaces, particularly focusing on those with mild singularities. Our first result explores the irreducibility of the variety $\Sigma$ of lines passing through a singular point $y$ on a…

代数几何 · 数学 2025-03-12 Jiayi Hu , Fengyang Wang , Xinlang Zhu

We introduce a novel definition of orientation on the triples of a family of pairwise intersecting planar convex sets and study its properties. In particular, we compare it to other systems of orientations on triples that satisfy a…

组合数学 · 数学 2024-04-26 Péter Ágoston , Gábor Damásdi , Balázs Keszegh , Dömötör Pálvölgyi
‹ 上一页 1 2 3 10 下一页 ›