Related papers: Antichain cutsets in real-ranked lattices
We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…
We explore the existence of irreducible and reducible arc-sections in an irreducible hypersurface singularity germ along finite projections. In particular we provide examples of irreducible isolated hypersurface singularities for which no…
We construct a metrizable Lawson semitopological semilattice $X$ whose partial order $\le_X=\{(x,y)\in X\times X:xy=x\}$ is not closed in $X\times X$. This resolves a problem posed earlier by the authors.
Disjointness, bands, and band projections are a classical and essential part of the structure theory of vector lattices. If $X$ is such a lattice, those notions seem - at first glance - intimately related to the lattice operations on $X$.…
We completely determine all cancellable elements in the lattice OC of overcommutative semigroup varieties. In particular, we prove that an overcommutative semigroup variety is a cancellable element of the lattice OC if and only if it is a…
Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…
A method of embedding partially ordered sets into linear spaces is presented. The problem of finding all orthocomplementations in a finite lattice is reduced to a linear programming problem.
Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…
Given a linear ordering of the vertices of a graph, the cutwidth of a vertex $v$ with respect to this ordering is the number of edges from any vertex before $v$ (including $v$) to any vertex after $v$ in this ordering. The cutwidth of an…
Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement in…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
We introduce and explore a natural rank for totally disconnected locally compact groups called the bounded conjugacy rank. This rank is shown to be a lattice invariant for lattices in sigma compact totally disconnected locally compact…
Legged robots are popular candidates for missions in challenging terrains due to the wide variety of locomotion strategies they can employ. Terrain classification is a key enabling technology for autonomous legged robots, as it allows the…
We discuss a class of problems which we call lattice exit models. At one level, these problems provide undergraduate level exercises in labeling the vertices of graphs (e.g., depth first search). At another level (theorems about large scale…
We give a new method to construct linear spaces of matrices of constant rank, based on truncated graded cohomology modules of certain vector bundles as well as on the existence of graded Artinian modules with pure resolutions. Our method…
We present a novel approach for data set scaling based on scale-measures from formal concept analysis, i.e., continuous maps between closure systems, and derive a canonical representation. Moreover, we prove said scale-measures are lattice…
We prove that any analytic set in $\C^n$ with a unique tangent cone at infinity is an algebraic set. We prove that the degree of a complex algebraic set in $\C^n$, which is Lipschitz normally embedded at infinity, is equal to the degree of…
We prove that every interval order $P$ with no infinite antichain has a Gallai decomposition. That is, $P$ is a lexicographical sum of proper interval orders over a chain, an antichain or a prime interval order. This is a consequence of the…
We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…
For the family of graded lattice ideals of dimension 1, we establish a complete intersection criterion in algebraic and geometric terms. In positive characteristic, it is shown that all ideals of this family are binomial set theoretic…