中文
相关论文

相关论文: A Poset Hierarchy

200 篇论文

Given an inner model $W \subset V$ and a regular cardinal $\kappa$, we consider two alternatives for adding a subset to $\kappa$ by forcing: the Cohen poset $Add(\kappa,1)$, and the Cohen poset of the inner model $Add(\kappa,1)^W$. The…

逻辑 · 数学 2019-08-27 Jonas Reitz

For a new class of topological vector spaces, namely $\kappa $-normed spaces, and associated quasisemilinear topological preordered space is defined and investigated. This structure arise naturally from the consideration of a $\kappa…

泛函分析 · 数学 2007-05-23 S. V. Ludkovsky , J. C. Ferrando

To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…

组合数学 · 数学 2017-05-08 Thomas Chappell , Tobias Friedl , Raman Sanyal

For a stationary set S subseteq omega_1 and a ladder system C over S, a new type of gaps called C-Hausdorff is introduced and investigated. We describe a forcing model of ZFC in which, for some stationary set S, for every ladder C over S,…

逻辑 · 数学 2007-05-23 Uri Abraham , Saharon Shelah

Recent work of Hopkins establishes that the lattice of order ideals of a minuscule poset satisfies the coincidental down-degree expectations property of Reiner, Tenner, and Yong. His approach appeals to the classification of minuscule…

组合数学 · 数学 2016-07-28 David B Rush

Let $\mathcal{C}$ be a small, connected category with finite hom-sets. We show that if the embedding of a connected subcategory $\mathcal{J}$ is both initial and final, then the restriction of any $\mathcal{C}$-module along $\mathcal{J}$…

表示论 · 数学 2026-04-14 Thomas Brüstle , Justin Desrochers , Samuel Leblanc

We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…

组合数学 · 数学 2020-05-19 Sara C. Billey , Matjaž Konvalinka , Joshua P. Swanson

In 2022, Defant and Kravitz introduced extended promotion (denoted $\partial$), a map that acts on the set of labelings of a poset. Extended promotion is a generalization of Sch\"{u}tzenberger's promotion operator, a well-studied map that…

组合数学 · 数学 2022-08-19 Eliot Hodges

For every algebraic number $\kappa$ on the unit circle which is not a root of unity we prove the existence of a strict sequence of algebraic numbers whose height tends to zero, such that the averages of the evaluation of $f_\kappa(z)=\log|z…

数论 · 数学 2023-08-15 Gerold Schefer

Kim, Kim, and Neggers (2019) defined probability functions on a poset, by listing some very natural conditions that a function \(\pi: P \times P \to [0,1]\) should satisfy in order to capture the intuition of "the likelihood that \(a\)…

组合数学 · 数学 2025-02-05 Jan Snellman

Building on early work by Stevo Todorcevic, we describe a theory of stationary subtrees of trees of successor-cardinal height. We define the diagonal union of subsets of a tree, as well as normal ideals on a tree, and we characterize…

逻辑 · 数学 2015-07-22 Ari Meir Brodsky

The productivity of the $\kappa$-chain condition, where $\kappa$ is a regular, uncountable cardinal, has been the focus of a great deal of set-theoretic research. In the 1970s, consistent examples of $\kappa$-cc posets whose squares are not…

逻辑 · 数学 2018-12-05 Chris Lambie-Hanson , Assaf Rinot

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…

组合数学 · 数学 2025-06-11 Mikhail Gorsky , Nicholas J. Williams

A poset has the non-messing-up property if it has two covering sets of disjoint saturated chains so that for any labeling of the poset, sorting the labels along one set of chains and then sorting the labels along the other set yields a…

组合数学 · 数学 2010-09-23 Bridget Eileen Tenner

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…

逻辑 · 数学 2023-07-25 Keegan Dasilva Barbosa , Dragan Mašulović , Rajko Nenadov

Alon and Shapira proved that every monotone class (closed under taking subgraphs) of undirected graphs is strongly testable, that is, under the promise that a given graph is either in the class or $\varepsilon$-far from it, there is a test…

组合数学 · 数学 2024-09-25 Panna Tímea Fekete , Gábor Kun

We show that basic homotopical notions such as homotopy sets and groups, connected and truncated maps, cellular constructions and skeleta, etc., extend to the setting of $(\infty,\infty)$-categories, as well as to presentable categories…

代数拓扑 · 数学 2026-04-16 David Gepner , Hadrian Heine

Let $P$ and $Q$ be bounded posets. In this note, a lemma is introduced that provides a set of sufficient conditions for the proper part of $P$ being homotopy equivalent to the suspension of the proper part of~$Q$. An application of this…

组合数学 · 数学 2016-09-07 Jörg Rambau

We investigate a certain class of posets arising from semilattice actions. Let $S$ be a semilattice with identity. Let $S$ act on a set $C$. For $c,d\in C$ put $c\leq d$ iff there is some $s\in S$ with $ds=c$. Then $(C,\leq)$ is a poset.…

逻辑 · 数学 2016-09-16 Lawrence Valby

For a discrete poset $\mathcal X$, McCord proved that the natural map $|{\mathcal X}|\to {\mathcal X}$, from the order complex to the poset with the Up topology, is a weak homotopy equivalence. Much later, \u{Z}ivaljevi\'{c} defined the…

组合数学 · 数学 2021-07-14 Ulysses Alvarez , Ross Geoghegan