Related papers: Smoothed Analysis of Order Types
In this paper, we extend the notion of orthogonality to the general elements of an absolute matrix order unit space and relate it to the orthogonality among positive elements. We introduce the notion of a partial isometry in an absolute…
We classify the most common local forms of smooth maps from a smooth manifold L to the plane. The word "local" can refer to locations in the source L, but also to locations in the target. The first point of view leads us to a classification…
The set of quasipositive surfaces is closed under incompressible inclusion. We prove that the induced order on fibre surfaces of positive braid links is almost a well-quasi-order. When restricting to quasipositive surfaces containing a…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
Let $(X,d)$ be a nonempty metric space and let $n\in \mathbb N^+$. We shall say that $T\colon X\to X$ is a graphic contraction of order $n$ if there exists $\alpha\in (0,1)$ such that the inequality $$ d(T^n x,T^{2n}x) \leqslant \alpha…
For a given polyhedral convex set-valued mapping we define a polyhedral convex cone which we call the natural ordering cone. We show that the solution behavior of a polyhedral convex set optimization problem can be characterized by this…
For the task of moving a group of indistinguishable agents on a connected graph with unit edge lengths into an arbitrary goal formation, it was previously shown that distance optimal paths can be scheduled to complete with a tight…
Let $A$ be a commutative noetherian ring, containing a field $k$, with $1/2\in k$, $\dim A=d$, and let $P$ be a projective $A$-module or $rank(P)=n$. In continuation of \cite{MM}, we study Homotopy obstructions for $P$ to split off a free…
We describe an algorithm for compressing a partially ordered set, or \emph{poset}, so that it occupies space matching the information theory lower bound (to within lower order terms), in the worst case. Using this algorithm, we design a…
Sorting algorithms are fundamental to computer science, and their correctness criteria are well understood as rearranging elements of a list according to a specified total order on the underlying set of elements. As mathematical functions,…
The jaggedness of an order ideal I in a poset P is the number of maximal elements in I plus the number of minimal elements of P not in I. A probability distribution on the set of order ideals of P is toggle-symmetric if for every p in P,…
Crystals and other condensed phases are defined primarily by their inherent symmetries, which play a crucial role in dictating their structural properties. In crystallization studies, local order parameters (OPs) that describe bond…
An order ideal is a finite poset X of (monic) monomials such that, whenever M is in X and N divides M, then N is in X. If all, say t, maximal monomials of X have the same degree, then X is pure (of type t). A pure O-sequence is the vector,…
Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…
We study the Orchard relation for generic configurations of points in the plane (also called order types). We introduce infinitesimally-close points and analyse the relation of this notion with the Orchard relation. The second part of the…
If and only if each point of a set of the phase-space is in the topological hull of a trajectory running through any other point of this set, we call this set a quasiergodic set. But which are these so defined quasiergodic sets in the case…
This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
We study the complexity of deciding the equality of infinite objects specified by systems of equations, and of infinite objects specified by lambda-terms. For equational specifications there are several natural notions of equality: equality…
Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the ``shape'' of the set. For that purpose, this paper introduces the formal…