Related papers: Antichain cutsets in real-ranked lattices

A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such…

We prove that the rank polynomial of the lattice of order ideals of a loop fence poset is unimodal. This poset arises as the poset of join-irreducibles in the lattice of good matchings of loop graphs associated with notched arcs.…

We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…

Obtaining high quality particle distribution representing clean geometry in pre-processing is essential for the simulation accuracy of the particle-based methods. In this paper, several level-set based techniques for cleaning up `dirty'…

We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in…

For commutative rings, we introduce the notion of a {\em universal grading}, which can be viewed as the "largest possible grading". While not every commutative ring (or order) has a universal grading, we prove that every {\em reduced order}…

We give sharp upper bounds on the anticanonical degree of fake weighted projective spaces, only depending on the dimension and the Gorenstein index.

This paper studies partitions in the space of antimonotonic boolean functions on sets of n elements. The antimonotonic functions are the antichains of the partially ordered set of subsets. We analyse and characterise a natural partial…

We show that a free vector lattice over a real vector space $V$ can be realised canonically as a vector lattice of real-valued positively homogeneous functions on any linear subspace of its dual space that separates the points of $V$. This…

We give a case-free proof that the lattice of noncrossing partitions associated to any finite real reflection group is EL-shellable. Shellability of these lattices was open for the groups of type $D_n$ and those of exceptional type and rank…

We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…

We present a generic and systematic approach for constructing D-dimensional lattice models with exactly solvable d-dimensional boundary states localized to corners, edges, hinges and surfaces. These solvable models represent a class of…

Adversarial examples, which are usually generated for specific inputs with a specific model, are ubiquitous for neural networks. In this paper we unveil a surprising property of adversarial noises when they are put together, i.e.,…

For a partially ordered set P, let Co(P) denote the lattice of all order-convex subsets of P. For a positive integer n, we denote by SUB(LO) (resp., SUB(n)) the class of all lattices that can be embedded into a product of lattices of convex…

Semantic segmentation is a task that traditionally requires a large dataset of pixel-level ground truth labels, which is time-consuming and expensive to obtain. Recent advancements in the weakly-supervised setting show that reasonable…

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…

In this short note we confirm the deep structural correspondence between the complexity of a countable scattered chain (= strict linear order) and its big Ramsey combinatorics: we show that a countable scattered chain has finite big Ramsey…

Cut and project sets are obtained by projecting an irrational slice through a lattice to a lower dimensional subspace. Under standard conditions, the resulting pattern has no translational periods even though it retains some regularity of…

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…