Related papers: Counting Unique-Sink Orientations
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…
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…
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…
A unique sink orientation (USO) is an orientation of the edges of a hypercube such that each face has a unique sink. Many optimization problems like linear programs reduce to USOs, in the sense that each vertex corresponds to a possible…
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$…
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…
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…
Algorithms for finding the sink in Unique Sink Orientations (USOs) of the hypercube can be used to solve many algebraic and geometric problems, most importantly including the P-Matrix Linear Complementarity Problem and Linear Programming.…
Unique Sink Orientations (USOs) are an appealing abstraction of several major optimization problems of applied mathematics such as for instance Linear Programming (LP), Markov Decision Processes (MDPs) or 2-player Turn Based Stochastic…
By considering appropriate finite covering spaces of closed non-orientable surfaces, we construct linear representations of their mapping class group which have finite index image in certain big arithmetic groups.
A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…
We study geometric properties of linear strata of uni-singular curves. The singularities of closures of the strata are resolved and the resolutions are represent as projective bundles. This enables to study their geometry. In particular we…
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…
We derive two types of linearity conditions for mapping class groups of orientable surfaces: one for once-punctured surface, and the other for closed surface, respectively. For the once-punctured case, the condition is described in terms of…
An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called ``ice-type…
This paper presents "oriented pivoting systems" as an abstract framework for complementary pivoting. It gives a unified simple proof that the endpoints of complementary pivoting paths have opposite sign. A special case are the Nash…
We study problems on uniqueness sets ($U$-sets) for multiple Walsh series converging over cubes and the properties of the coefficients of such series. New broad classes of $U$-sets are constructed. In particular, it is proved that…
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.
Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…
Let $S$ be a closed orientable hyperbolic surface, and let $\mathcal{O}(K,S)$ denote the number of mapping class group orbits of curves on $S$ with at most $K$ self-intersections. Building on work of Sapir [16], we give upper and lower…