中文
相关论文

相关论文: A Poset Hierarchy

200 篇论文

We study the problem of topologically order-embedding a given topological poset X in the space of all closed subsets of X which is topologized by the Fell topology and ordered by set inclusion. We show that this can be achieved whenever X…

一般拓扑 · 数学 2021-11-24 Gerald Beer , Efe A. Ok

Given a finite poset $\mathcal P$ and two distinct elements $x$ and $y$, we let $\operatorname{pr}_{\mathcal P}(x \prec y)$ denote the fraction of linear extensions of $\mathcal P$ in which $x$ precedes $y$. The balance constant…

组合数学 · 数学 2023-10-03 Evan Chen

A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…

组合数学 · 数学 2012-01-31 Graham Brightwell , Malwina Luczak

The incidence algebra of a partially ordered set (poset) supports in a natural way also a coalgebra structure, so that it becomes a m-weak bialgebra even a m-weak Hopf algebra with M\"obius function as antipode. Here m-weak means that…

量子代数 · 数学 2012-09-20 Dieter Denneberg

The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…

组合数学 · 数学 2014-09-16 Mahir Bilen Can , Michael Joyce , Benjamin Wyser

The chain covering number $\Cov(P)$ of a poset $P$ is the least number of chains needed to cover $P$. For a cardinal $\nu$, we give a list of posets of cardinality and covering number $\nu$ such that for every poset $P$ with no infinite…

组合数学 · 数学 2022-11-08 Uri Abraham , Maurice Pouzet

A recent work of Abbasi et al. [FOCS 2023] introduced the notion of $\varepsilon$-scatter dimension of a metric space and showed a general framework for efficient parameterized approximation schemes (so-called EPASes) for a wide range of…

离散数学 · 计算机科学 2024-10-15 Romain Bourneuf , Marcin Pilipczuk

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…

数据结构与算法 · 计算机科学 2007-07-12 Constantinos Daskalakis , Richard M. Karp , Elchanan Mossel , Samantha Riesenfeld , Elad Verbin

A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…

环与代数 · 数学 2013-01-01 Gábor Czédli

We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.

逻辑 · 数学 2018-11-14 James Cummings , Mirna Džamonja , Itay Neeman

We initiate the study of model structures on (categories induced by) lattice posets, a subject we dub homotopical combinatorics. In the case of a finite total order $[n]$, we enumerate all model structures, exhibiting a rich combinatorial…

代数拓扑 · 数学 2023-04-20 Scott Balchin , Kyle Ormsby , Angélica M. Osorno , Constanze Roitzheim

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

We study higher order quantum maps in the context of a *-autonomous category of affine subspaces. We show that types of higher order maps can be identified with certain Boolean functions that we call type functions. By an extension of this…

量子物理 · 物理学 2026-05-06 Anna Jenčová

We define a partial order $\mathcal{P}_n$ on permutations of any given size $n$, which is the image of a natural partial order on inversion sequences. We call this the ``middle order''. We demonstrate that the poset $\mathcal{P}_n$ refines…

组合数学 · 数学 2024-08-30 Mathilde Bouvel , Luca Ferrari , Bridget Eileen Tenner

A finite poset (partially ordered set) $P$ with ${\hat 0}$ is called of distributive type if every interval $[{\hat 0}, a]$, $a \in P$, of $P$ is a distributive lattice. From a viewpoint of ASL's (algebras with straightening laws), the…

交换代数 · 数学 2026-02-17 Takayuki Hibi , Seyed Amin Seyed Fakhari

A frame in an $n$-dimensional Hilbert space $H_n$ is a possibly redundant collection of vectors $\{f_i\}_{i\in I}$ that span the space. A tight frame is a generalization of an orthonormal basis. A frame $\{f_i\}_{i\in I}$ is said to be…

We use coherent systems of FS iterations on a power set, which can be seen as matrix iteration that allows restriction on arbitrary subsets of the vertical component, to prove general theorems about preservation of certain type of unbounded…

逻辑 · 数学 2020-07-07 Diego A. Mejía

Bipartitional relations were introduced by Foata and Zeilberger in their characterization of relations which give rise to equidistribution of the associated inversion statistic and major index. We consider the natural partial order on…

组合数学 · 数学 2011-08-17 Gábor Hetyei , Christian Krattenthaler

Given a family $\F$ of posets closed under disjoint unions and the operation of taking convex subposets, we construct a category $\C_{\F}$ called the \emph{incidence category of $\F$}. This category is "nearly abelian" in the sense that all…

量子代数 · 数学 2009-10-29 Matt Szczesny

We introduce $\delta$-cliffs, a generalization of permutations and increasing trees depending on a range map $\delta$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we…

组合数学 · 数学 2022-04-11 Camille Combe , Samuele Giraudo
‹ 上一页 1 8 9 10 下一页 ›