Related papers: Smoothed Analysis of Order Types

Iterated Segre mappings of real analytic generic submanifolds in complex space have been an essential tool in the study of holomorphic, formal, and CR mappings between such manifolds. In this paper we present a theory of iterated Segre…

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

We rewrite simplicially the standard definitions of a complete first order theory, a model of it, and various characterisations of stability of a complete first order theory. In our reformulations the simplicial language replaces the…

An L-shaped embedding of a tree in a point set is a planar drawing of the tree where the vertices are mapped to distinct points and every edge is drawn as a sequence of two axis-aligned line segments. There has been considerable work on…

The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…

We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as…

In order to have a compact visualization of the order type of a given point set S, we are interested in geometric graphs on S with few edges that unambiguously display the order type of S. We introduce the concept of exit edges, which…

We study discrete orderings in the real spectrum of a commutative ring by defining discrete prime cones and give an algebro-geometric meaning to some kind of diophantine problems over discretely ordered rings. Also for a discretely ordered…

We study self-similar groupoid actions on arbitrary directed graphs together with $\mathbb{T}$-valued twists that exhaust the second cohomology group of the associated Zappa-Sz\'ep product category. We define and analyse the associated…

The purpose of this paper is to establish bounds on the rate of convergence of the conjugate gradient algorithm when the underlying matrix is a random positive definite perturbation of a deterministic positive definite matrix. We estimate…

We consider the \textsc{Steiner Orientation} problem, where we are given as input a mixed graph $G=(V,E,A)$ and a set of $k$ demand pairs $(s_i,t_i)$, $i\in[k]$. The goal is to orient the undirected edges of $G$ in a way that the resulting…

Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…

Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…

We give a necessary condition for two diagrams of $3$-regular spatial graphs with the same underlying abstract graph $G$ to represent isotopic spatial graphs. The test works by reading off the writhes of the knot diagrams coming from a…

Two labeled point configurations $\{p_1,\ldots,p_n\}$ and $\{q_1,\ldots,q_n\}$ are of the same order type if, for every $i,j,k$, the triples $(p_i,p_j,p_k)$ and $(q_i,q_j,q_k)$ have the same orientation. In the 1980's, Goodman, Pollack and…

Let $K[\mathcal{O}(P)]$ denote the toric ring of the order polytope $\mathcal{O}(P)$ of a finite partially ordered set $P$ and $K[\mathcal{C}(P)]$ that of the chain polytope $\mathcal{C}(P)$. It will be shown that $\beta_{p,…

We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…

Join ordering is the NP-hard problem of selecting the most efficient order in which to evaluate joins (conjunctive, binary operators) in a database query. Because query execution performance critically depends on this choice, join ordering…

Enumeration algorithms have been one of recent hot topics in theoretical computer science. Different from other problems, enumeration has many interesting aspects, such as the computation time can be shorter than the total output size, by…

Order-reduction is a standard automated approximation technique for computer-aided design, analysis, and simulation of many classes of systems, from circuits to buildings. For a given system, these methods produce a reduced-order system…