Related papers: Dilworth's Theorem for Borel Posets

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

It is known that there is a linear dependence between the treewidth of a graph and its balanced separator number: the smallest integer $k$ such that for every weighing of the vertices, the graph admits a balanced separator of size at most…

We demonstrate how pipe dreams can be applied to the theory of poset polytopes to produce toric degenerations of flag varieties. Specifically, we present such constructions for marked chain-order polytopes of Dynkin types A and C. These…

The following is true in the Solovay model. 1. If $\le$ is a Borel partial order on a set $D$ of the reals, and $X$ is a ROD subset of $D$ linearly ordered by $\le$, then the restriction of $\le$ onto $X$ is countably cofinal. 2. If in…

We consider path ideals associated to special classes of posets such as tree posets and cycles. We express their property of being sequentially Cohen-Macaulay in terms of the underlying poset. Moreover, monomial ideals, which arise from the…

We study the deformation theory of morphisms of properads and props thereby extending to a non-linear framework Quillen's deformation theory for commutative rings. The associated chain complex is endowed with a Lie algebra up to homotopy…

Let X be a separable metric space and let \beta be the strict topology on the space of bounded continuous functions on X, which has the space of \tau-additive Borel measures as a continuous dual space. We prove a Banach-Dieudonne\'{e} type…

We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…

Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…

We characterize Hilbert polynomials that give rise to Hilbert schemes with two Borel-fixed points and determine when the associated Hilbert schemes or their irreducible components are smooth. In particular, we show that the Hilbert scheme…

We consider the class of {\em separable} $k$-hypergraphs, which can be viewed as uniform analogs of threshold Boolean functions, and the class of {\em equatable} $k$-hypergraphs. We show that every $k$-hypergraph is either separable or…

We present here quantitative versions in 1 dimension of Faltings'theorem according to which the set of the K-rational points (where K is a given number field) of an abelian variety A definied over K, which are close (with respect to a…

Given an algebraically closed field $K$ of characteristic zero, we study the incidence relation between points and irreducible projective curves, or more precisely the poset of irreducible proper subvarieties of $\mathbb P^2(K)$. Answering…

We introduce a new family of finite posets which we call 2-chains. These first arose in the study of 0-Hecke algebras, but they admit a variety of different characterisations. We give these characterisations, prove that they are equivalent…

We study dismantlability in graphs. In order to compare this notion to similar operations in posets (partially ordered sets) or in simplicial complexes, we prove that a graph G dismants on a subgraph H if and only if H is a strong…

We develop Grothendieck's theory of dualizing complexes on finite posets, and its subsequent theory of Cohen-Macaulayness.

We prove that octants are cover-decomposable into multiple coverings, i.e., for any k there is an m(k) such that any m(k)-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into k…

In a parameterized problem, every instance I comes with a positive integer k. The problem is said to admit a polynomial kernel if, in polynomial time, one can reduce the size of the instance I to a polynomial in k, while preserving the…

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…