Related papers: On well-splitting posets

The category of Hilbert spaces and contractions has filtered colimits, and tensoring preserves them. We also discuss (problems with) bounded maps.

Boij and S\"oderberg made a pair of conjectures, which were subsequently proven by Eisenbud and Schreyer and then extended by Boij and S\"oderberg, about the structure of Betti diagrams of Graded modules. In the theory, a particular family…

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…

For any $2 \le n < \omega$, we introduce a forcing poset using generalized promises which adds a normal $n$-splitting subtree to a $(\ge \! n)$-splitting normal Aronszajn tree. Using this forcing poset, we prove several consistency results…

We introduce persistence with an emphasis on its algebraic foundations, using the representation theory of posets. Linear representations of posets arise in several areas of mathematics, including the representation theory of quivers and…

We give a counterexample to a conjecture made by Cigler, Jerman and Wojciechowski stating that all posets are conclusive. We also provide combinatorial characterizations for conclusiveness of finite posets and the existence of outer…

We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).

We develop the theory of layered posets, and use the notion of layering to prove a new iteration theorem (Theorem 6): if $\kappa$ is weakly compact then any universal Kunen iteration of $\kappa$-cc posets (each possibly of size $\kappa$) is…

We give a broad survey of inequalities for the number of linear extensions of finite posets. We review many examples, discuss open problems, and present recent results on the subject. We emphasize the bounds, the equality conditions of the…

In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal $\kappa \ge \omega_2$, $\textsf{ISP}(\kappa)$ implies that $\textsf{SCH}$ holds above $\kappa$, and (3) forcing posets…

We discuss a possible characterization, by means of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains.

The theorem we prove is a slight strengthening of some results by Just, Miller, Scheepers and Szeptycki [JMSS]. We use the Michael technique instead of the combinatorial approach in the literature. Comments by the submitter: This short…

We prove a generalization of Gotzmann's persistence theorem in the case of modules with constant Hilbert polynomial. As a consequence, we show that the defining equations that give the embedding of a Quot scheme of points into a…

We give the optimal conditions for the existence of a club consisting of former regular over an inaccessible and a measurable. The foricing construction based on iteration of distributive posets.

We consider Shimura varieties associated to a unitary group of signature $(n-s,s)$ where $n$ is even. For these varieties, by using the spin splitting models from Zachos-Zhao, we construct flat, Cohen-Macaulay, and normal $p$-adic integral…

We provide new techniques to construct sets of reals without perfect subsets and with the Hurewicz or Menger covering properties. In particular, we show that if the Continuum Hypothesis holds, then there are such sets which can be mapped…

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

We extend the results of arXiv:1808.01509 on nonamalgamable forcing extensions to families of posets with wide projections. We also use a different coding method to obtain nonamalgamable extensions by filter-based Mathias forcing.

We consider the coset poset associated with the families of proper subgroups, proper subgroups of finite index, and proper normal subgroups of finite index. We investigate under which conditions those coset posets have contractible…

The splitting number can be singular. The key method is to construct a forcing poset with finite support matrix iterations of ccc posets introduced by Blass and the second author "Ultrafilters with small generating sets", Israel J. Math.,…