中文
相关论文

相关论文: A Poset Hierarchy

200 篇论文

This paper studies topological properties of the lattices of non-crossing partitions of types A and B and of the poset of injective words. Specifically, it is shown that after the removal of the bottom and top elements (if existent) these…

组合数学 · 数学 2011-04-13 Myrto Kallipoliti , Martina Kubitzke

We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special…

组合数学 · 数学 2018-12-27 Benjamin Braun , Wesley K. Hough

Smallish large cardinals $\kappa$ are often characterized by the existence of a collection of filters on $\kappa$, each of which is an ultrafilter on the subsets of $\kappa$ of some transitive $\mathrm{ZFC}^-$-model of size $ \kappa$. We…

逻辑 · 数学 2021-05-14 Erin Carmody , Victoria Gitman , Miha E. Habič

In 1920s R. L. Moore introduced \emph{upper semicontinuous} and \emph{lower semicontinuous} decompositions in studying decomposition spaces. Upper semicontinuous decompositions were studied very well by himself and later by R.H. Bing in…

代数拓扑 · 数学 2020-06-23 Shoji Yokura

We show that the order dimension of the partial order of all finite subsets of $\kappa$ under set inclusion is ${\log}_{2}({\log}_{2}(\kappa))$ whenever $\kappa$ is an infinite cardinal. We also show that the order dimension of any locally…

逻辑 · 数学 2019-02-19 Kojiro Higuchi , Steffen Lempp , Diip Raghavan , Frank Stephan

We contribute to the study of $\aleph_1$-dense sets of reals, a mainstay in set theoretic research since Baumgartner's seminal work in the 70s. In particular, we show that it is consistent with $\textsf{MA}$ that there exists an…

逻辑 · 数学 2025-12-25 Pedro Marun , Saharon Shelah , Corey Bacal Switzer

We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its M\"obius function. We show that the weak order on Coxeter groups of type A, B, affine A, and the flag weak order…

组合数学 · 数学 2015-10-23 François Viard

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…

组合数学 · 数学 2011-02-25 David Cook

Motivated by work of Stembridge, we study rank functions for Viennot's heaps of pieces. We produce a simple and sufficient criterion for a heap to be a ranked poset and apply the results to the heaps arising from fully commutative words in…

组合数学 · 数学 2007-05-23 R. M. Green

We introduce Hausdorff (complexity) classes, which provide canonical characterizations of the intermediate levels of the iterated exponential hierarchies, including the Polynomial Hierarchy, the (Weak) Exponential Hierarchy, and…

计算复杂性 · 计算机科学 2026-04-14 Enrico Malizia

Let $(X,\le)$ be a {\em non-empty strictly inductive poset}, that is, a non-empty partially ordered set such that every non-empty chain $Y$ has a least upper bound lub$(Y)\in X$, a chain being a subset of $X$ totally ordered by $\le$. We…

逻辑 · 数学 2015-02-24 Frédéric Blanqui

For a poset $(P;\leq)$, the quasiorders (AKA preorders) extending the poset order "$\leq$" form a complete lattice $F$, which is a filter in the lattice of all quasiorders of the set $P$. We prove that if the poset order "$\leq$" is small,…

环与代数 · 数学 2024-02-26 Gábor Czédli

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

离散数学 · 计算机科学 2024-05-10 Susumu Kubo

This paper establishes a link between the theory of cluster algebras and the theory of representations of partially ordered sets. We introduce a class of posets by requiring avoidance of certain types of peak-subposets and show that these…

表示论 · 数学 2019-12-17 Ralf Schiffler , Robinson-Julian Serna

Let $X$ be a topological space. A subset of $C(X)$, the space of continuous real-valued functions on $X$, is a partially ordered set in the pointwise order. Suppose that $X$ and $Y$ are topological spaces, and $A(X)$ and $A(Y)$ are subsets…

泛函分析 · 数学 2014-08-22 Denny H. Leung , Wee-Kee Tang

We introduce posets with interfaces (iposets) and generalise their standard serial composition to a new gluing composition. In the partial order semantics of concurrency, interfaces and gluing allow modelling events that extend in time and…

形式语言与自动机理论 · 计算机科学 2022-11-07 Uli Fahrenberg , Christian Johansen , Georg Struth , Krzysztof Ziemiański

The set of weights of a finite-dimensional representation of a reductive Lie algebra has a natural poset structure ("weight poset"). Studying certain combinatorial problems related to antichains in weight posets, we realised that the best…

组合数学 · 数学 2017-10-17 Dmitri I. Panyushev

We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…

组合数学 · 数学 2012-11-20 Mike Develin , Matthew Macauley , Victor Reiner

For finite semidistributive lattices the map $\kappa$ gives a bijection between the sets of completely join-irreducible elements and completely meet-irreducible elements. Here we study the $\kappa$-map in the context of torsion classes. It…

表示论 · 数学 2020-07-17 Emily Barnard , Gordana Todorov , Shijie Zhu

We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…

逻辑 · 数学 2010-10-13 Damir D. Dzhafarov