中文
相关论文

相关论文: About posets for which no lower cover or no upper …

200 篇论文

For a connected finite poset $P$, let $E(P)$ be the poset induced by the extremal points of $P$. We show that the fixed point property of $E(P)$ implies the fixed point property of $P$. On the other hand, we show that a homomorphism $f :…

组合数学 · 数学 2024-10-30 Frank a Campo

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

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…

组合数学 · 数学 2007-05-23 Bridget Eileen Tenner

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

组合数学 · 数学 2025-07-30 Kevin Ivan Piterman , Volkmar Welker

The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…

表示论 · 数学 2019-02-27 Vyacheslav Futorny , Kostiantyn Iusenko

We give conditions for a locally finite poset $P$ to have the property that for any functions $f:P\to {\bf C}$ and $g:P\to {\bf C}$ not identically zero and linked by the M\"obius inversion formula, the support of at least one of $f$ and…

组合数学 · 数学 2026-03-03 Marcel K. Goh

Which finite sets $P \subseteq \mathbb{Z}^r$ with $|P| \ge 3$ have the following property: for every $A \subseteq [N]^r$, there is some nonzero integer $d$ such that $A$ contains $(\alpha^{|P|} - o(1))N^r$ translates of $d \cdot P = \{d p :…

组合数学 · 数学 2021-08-02 Ashwin Sah , Mehtaab Sawhney , Yufei Zhao

The fixed point property for finite posets of width 3 and 4 is studied in terms of forbidden retracts. The ranked forbidden retracts for width 3 and 4 are determined explicitly. The ranked forbidden retracts for the width 3 case that are…

组合数学 · 数学 2007-05-23 Jonathan David Farley

It has been known for more than 40 years that there are posets with planar cover graphs and arbitrarily large dimension. Recently, Streib and Trotter proved that such posets must have large height. In fact, all known constructions of such…

组合数学 · 数学 2018-12-21 David M. Howard , Noah Streib , William T. Trotter , Bartosz Walczak , Ruidong Wang

A well-known result from Brouwer states that any orientation preserving homeomorphism of the plane with no fixed points has an empty non-wandering set. In particular, an invariant compact set implies the existence of a fixed point. In this…

动力系统 · 数学 2019-06-11 Alejo García

We prove that a poset with no induced subposet $S_k$ (for fixed $k\geq 3$) must have dimension that is sublinear in terms of the number of elements.

组合数学 · 数学 2013-11-27 Csaba Biro , Peter Hamburger , Attila Por

We study two new parameters for finite posets motivated by the problem of efficiently determining the set of successors of a given element. A plane map of a poset $P=(X,\leq)$ is an injective mapping of $X$ into the Cartesian plane…

组合数学 · 数学 2026-05-21 Stefan Felsner , Jędrzej Hodor , Giacomo Ortali , Alexander Wolff

We define the infinite dimensional simplex to be the closure of the convex hull of the standard basis vectors in R^infinity, and prove that this space has the 'fixed point property': any continuous function from the space into itself has a…

一般拓扑 · 数学 2007-08-28 Douglas Rizzolo , Francis Edward Su

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

组合数学 · 数学 2018-02-02 Emily J. Olson , Bruce E. Sagan

A poset $\mathbf{P} = (X,\preceq)$ is {\em $m$-partite} if $X$ has a partition $X = X_1 \cup ... \cup X_m$ such that (1) each $X_i$ forms an antichain in $\mathbf{P}$, and (2) $x\prec y$ implies $x\in X_i$ and $y\in X_j$ where $i<j$. In…

组合数学 · 数学 2007-06-12 Geir Agnarsson

Let $\mathfrak{P}_r$ be a representation system of the non-isomorphic finite posets, and let ${\cal H}(P,Q)$ be the set of order homomorphisms from $P$ to $Q$. For finite posets $R$ and $S$, we write $R \sqsubseteq_G S$ iff, for every $P…

组合数学 · 数学 2019-08-20 Frank a Campo

A poset $P$ is said to satisfy the finite antichain condition, or FAC for short, if it has no infinite antichain. It was conjectured by Aharoni and Korman in 1992 that any FAC poset $P$ possesses a chain $C$ and a partition into antichains…

组合数学 · 数学 2025-05-23 Lawrence Hollom

The Brouwer fixed point theorem states that the disk $D^n$ has the fixed point property. More generally, by the Lefschetz fixed point theorem any compact ANR with trivial rational homology has the fixed point property. In this note we prove…

代数拓扑 · 数学 2013-07-09 Jonathan Ariel Barmak

We identify two key conditions that a subset $A$ of a poset $P$ may satisfy to guarantee the transfer of continuity properties from $P$ to $A$. We then highlight practical cases where these key conditions are fulfilled. Along the way we are…

组合数学 · 数学 2022-05-02 Paul Poncet

For P a poset or lattice, let Id(P) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P)=Id(P)-\{\emptyset\}. This note obtains various results to the effect that Id(P) is always,…

环与代数 · 数学 2013-05-10 George M. Bergman
‹ 上一页 1 2 3 10 下一页 ›