Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Sperner property of a partially ordered set (view)

searching for Partially ordered set 35 found (281 total)

Inductive set (334 words) [view diff] exact match in snippet view article find links to article

Bourbaki also defines an inductive set to be a partially ordered set that satisfies the hypothesis of Zorn's lemma when nonempty. In descriptive set theory

Hierarchical task network (626 words) [view diff] exact match in snippet view article find links to article

its precondition. A compound task is a complex task composed of a partially ordered set of further tasks, which can either be primitive or abstract. A goal

Deviation of a poset (553 words) [view diff] exact match in snippet view article find links to article

measuring the complexity of a poset. A poset is also known as a partially ordered set. The deviation of a poset is used to define the Krull dimension

Hausdorff gap (634 words) [view diff] exact match in snippet view article find links to article

Hausdorff (1909). The existence of Hausdorff gaps shows that the partially ordered set of possible growth rates of sequences is not complete. Let ωω{\displaystyle

Axiom of choice (7,954 words) [view diff] exact match in snippet view article find links to article

Hausdorff maximal principle: Every partially ordered set has a maximal chain. Equivalently, in any partially ordered set, every chain can be extended to

Dickson's lemma (1,166 words) [view diff] exact match in snippet view article find links to article

x_{i}\leq x_{j}} holds with respect to the pointwise order. The partially ordered set ( N n , ≤ ) {\displaystyle (\mathbb {N} ^{n},\leq )} does not contain

Nerve (category theory) (1,379 words) [view diff] exact match in snippet view article

totally ordered finite sets and order-preserving morphisms. Every partially ordered set P yields a (small) category i(P) with objects the elements of P

Topological sorting (3,176 words) [view diff] exact match in snippet view article find links to article

concept of a linear extension of a partial order in mathematics. A partially ordered set is just a set of objects together with a definition of the "≤" inequality

Vertex figure (1,436 words) [view diff] no match in snippet view article find links to article

(e.g. Skilling, 1975) treat a vertex figure as the ordered (or partially ordered) set of points of all the neighboring (connected via an edge) vertices

Subset (1,631 words) [view diff] exact match in snippet view article find links to article

Inclusion is the canonical partial order, in the sense that every partially ordered set ( X , ⪯ ) {\displaystyle (X,\preceq )} is isomorphic to some collection

Directed acyclic graph (5,628 words) [view diff] exact match in snippet view article find links to article

partial orders into DAGs works more generally: for every finite partially ordered set (S, ≤), the graph that has a vertex for every element of S and an

Trapezoid graph (1,507 words) [view diff] exact match in snippet view article find links to article

corresponding trapezoids intersect. The interval order dimension of a partially ordered set, P=(X,<){\displaystyle P=(X,<)}, is the minimum number d of interval

Esakia space (463 words) [view diff] exact match in snippet view article find links to article

category of Heyting algebras and the category of Esakia spaces. For a partially ordered set (X, ≤) and for x∈ X, let ↓x = {y∈ X : y≤ x} and let ↑x = {y∈ X :

Two-element Boolean algebra (1,311 words) [view diff] exact match in snippet view article find links to article

following in the literature, and will be employed here. B is a partially ordered set and the elements of B are also its bounds. An operation of arity

Tree rotation (1,443 words) [view diff] exact match in snippet view article find links to article

Day–Stout–Warren algorithm balances an unbalanced BST. Tamari lattice, a partially ordered set in which the elements can be defined as binary trees and the ordering

Inverse limit (2,266 words) [view diff] exact match in snippet view article find links to article

category C admit an alternative description in terms of functors. Any partially ordered set I can be considered as a small category where the morphisms consist

Workflow (3,150 words) [view diff] exact match in snippet view article find links to article

scheduling: A plan is a description of the logically necessary, partially ordered set of activities required to accomplish a specific goal given certain

Integer partition (3,388 words) [view diff] exact match in snippet view article find links to article

order on partitions given by inclusion of Young diagrams. This partially ordered set is known as Young's lattice. The lattice was originally defined

Felix Hausdorff (7,450 words) [view diff] exact match in snippet view article find links to article

him to study the concept of partially ordered set. The question of whether any ordered subset of a partially ordered set is contained in a maximal ordered

Miklós Simonovits (616 words) [view diff] case mismatch in snippet view article find links to article

Structure of Edge Graphs-2 (coauthor, 1976) Spanning Retracts of a Partially Ordered Set (coauthor, 1980) Compactness Results in Extremal Graph-Theory (with

Curtis Greene (415 words) [view diff] exact match in snippet view article find links to article

MR 0389608. Greene, Curtis (1976), "Some partitions associated with a partially ordered set", Journal of Combinatorial Theory, Series A, 20 (1): 69–79, doi:10

Denotational semantics of the Actor model (3,346 words) [view diff] exact match in snippet view article find links to article

augmented Actor event diagrams [see Actor model theory] form a partially ordered set < Diagrams, ≤ > from which to construct the power domain P[Diagrams]

Persistent homology (1,446 words) [view diff] exact match in snippet view article find links to article

d(e_{s_{j}+r_{j}})=e_{r_{j}}}. A persistence module over a partially ordered set P{\displaystyle P} is a set of vector spaces Ut{\displaystyle U_{t}}

Interval order (890 words) [view diff] exact match in snippet view article find links to article

orders instead of linear orders. Thus, the interval dimension of a partially ordered set P = ( X , ≤ ) {\displaystyle P=(X,\leq )} is the least integer k

Ideal (set theory) (1,399 words) [view diff] exact match in snippet view article

boundedness Filter (mathematics) – In mathematics, a special subset of a partially ordered set Filter (set theory) – Family of sets representing "large" sets Ideal

Turing degree (3,130 words) [view diff] exact match in snippet view article find links to article

{\displaystyle {\mathcal {D}}} is not a lattice. Every countable partially ordered set can be embedded in the Turing degrees. An infinite strictly increasing

Boolean-valued model (2,447 words) [view diff] exact match in snippet view article find links to article

starts with a countable transitive model M of ZF set theory, a partially ordered set P, and a "generic" subset G of P, and constructs a new model of

Regular polytope (5,265 words) [view diff] exact match in snippet view article find links to article

called abstract polytopes. An abstract polytope is defined as a partially ordered set (poset), whose elements are the polytope's faces (vertices, edges

Filter quantifier (2,104 words) [view diff] exact match in snippet view article find links to article

work. Filter (mathematics) – In mathematics, a special subset of a partially ordered set Filter (set theory) – Family of sets representing "large" sets Generalized

Covariance and contravariance (computer science) (6,691 words) [view diff] exact match in snippet view article

represent the subtype relationship ≤. (This is an example of how any partially ordered set can be considered as a category.) Then for example the function

Club filter (804 words) [view diff] exact match in snippet view article find links to article

fallback Filter (mathematics) – In mathematics, a special subset of a partially ordered set Stationary set – Set-theoretic concept Jech, Thomas, 2003. Set Theory:

Topological data analysis (11,259 words) [view diff] exact match in snippet view article find links to article

is a functor from Z {\displaystyle \mathbb {Z} } considered as a partially ordered set to the category of vector spaces. The persistent homology group

Blackwell's informativeness theorem (1,463 words) [view diff] no match in snippet view article find links to article

cannot be ranked by it. More specifically, it is a chain of the partially-ordered set of information structures. The Blackwell order has many applications

Controlled grammar (7,381 words) [view diff] exact match in snippet view article find links to article

) {\displaystyle G=(\{S,X,Y,Z,A\},\{a\},S,P)} , where P is the partially ordered set described by the Hasse diagram The derivation for the string aaaa

Filters in topology (30,936 words) [view diff] exact match in snippet view article find links to article

(\operatorname {PointedSets} ({\mathcal {B}}),\leq )} is not, in general, a partially ordered set, it is a directed set if (and only if) B {\displaystyle {\mathcal