The tag has no wiki summary.

learn more… | top users | synonyms

2
votes
2answers
82 views

Completion of a single totally ordered down-set

This is a follow-up question to Complete sets of incompatible totally ordered down-set in a partially ordered set. Let $(P,\leq)$ be a partially ordered set such that for every $p\in P$ the set ...
3
votes
2answers
142 views

Complete sets of incompatible totally ordered down-set in a partially ordered set

Let $(P,\leq)$ be a partially ordered set. A down-set is a set $d\subseteq P$ such that $x\in d$ and $x'\in P, x'\leq x$ imply $x'\in d$. If the down-set is totally ordered, we say it is a totally ...
3
votes
1answer
97 views

Directed Hypercube Minimal Cuts

If $[n]:=\{1,2,\ldots, n\}$ for some $n\in\mathbb{N}$, then the hypercube digraph of dimension $n$, denoted $H_n$, is the graph whose set of vertices is the power-set $\wp([n])$ where two vertices ...
1
vote
2answers
70 views

Order-preserving image of a complete lattice

If $L$ is a complete lattice and $P$ is a poset and $f: L\to P$ is an order preserving surjective map, does this imply that $P$ is a (complete) lattice?
2
votes
1answer
66 views

Order-preserving images of $(\mathcal{P}(\kappa),\subseteq)$

Is there a cardinal $\kappa \neq \emptyset$ and a connected poset $P$ of cardinality $\leq \kappa$ such that there is no surjective order-preserving map from $(\mathcal{P}(\kappa),\subseteq)$ onto ...
2
votes
0answers
93 views

Isomorphic subcategories of directed graphs and presets

For the purposes of this post, a digraph (directed graph) has neither loops nor multiple parallel edges, and a preset is an ordered pair consisting of a set $S$ and a preorder (viz., a reflexive and ...
5
votes
2answers
108 views

Image of poset with Hausdorff interval topology

Given a poset $(P,\leq)$ the interval topology $\tau_{\text{int}}(P)$ on $P$ is generated by $$\{P\setminus\downarrow x : x\in P\} \cup \{P\setminus\uparrow x : x\in P\},$$ where $\downarrow x = ...
3
votes
1answer
62 views

Product of posets with Hausdorff interval topology

Given a poset $(P,\leq)$ the interval topology on $P$ is generated by $$\{P\setminus\downarrow x : x\in P\} \cup \{P\setminus\uparrow x : x\in P\},$$ where $\downarrow x = \{y\in P: y\leq x\}$ and ...
2
votes
0answers
105 views

Terminology question for maps between posets

Let $P$ and $Q$ be two poset (partially ordered sets) and $\phi : P \to Q$ an order-preserving function. I would like to know whether there is a name and perhaps a different characterizations of such ...
2
votes
1answer
158 views

When do infinitesimals split in dimension groups?

Let $G$ be a dimension group (i.e. a directed, unperforated abelian group satisfying the Riesz interpolation property) with order unit $u\in G^{+}$. There is a canonical positive group homomorphism ...
2
votes
1answer
66 views

Universal and left-factoring order-preserving maps

Trying to get a different angle for the question Fixed points and universal maps for posets, I want to compare universal maps to a different kind of functions. First recall that for posets $P,Q$ an ...
2
votes
0answers
83 views

Pre-Order induced by continuous functions

I'm an newbie in category theory, but I want use it to solve a pre-order question I encountered in my research: Let $X$ be a convex&compact subset of $\mathbb{R}^n$. $f,g: X \rightarrow [0,1]$ ...
10
votes
3answers
220 views

Is the homomorphism poset directed if the codomain is directed?

Let $P,Q$ be partially ordered sets (posets). We consider the set $\text{Hom}(P,Q)$ of order-preserving functions $f:P\to Q$. (We call a function $f:P\to Q$ order preserving if $x\leq y$ in $P$ ...
3
votes
1answer
198 views

When is the homomorphism poset between posets a lattice?

Let $P,Q$ be partially ordered sets (posets). We consider the set $\text{Hom}(P,Q)$ of order-preserving functions $f:P\to Q$. There is a natural ordering relation on $\text{Hom}(P,Q)$ given by $f\leq ...
3
votes
0answers
28 views

Unique representability of bounded distributive lattices

Priestley Duality assigns to every bounded distributive lattice $L$ a compact totally order-disconnected topological space $P(L)$, also called a Priestley space. A poset $(P,\leq)$ is called ...
3
votes
1answer
59 views

Minor ordering for finite graphs

Let $\mathcal{G}_{<\omega}$ be the set of graphs $G = (V,E)$ such that $V = \{0,\ldots,n\}$ for some $n \geq 0$ and $E \subseteq \mathcal{P}_2(V) = \{\{a,b\} : a,b \in V \textrm{ and } a\neq b\}$. ...
1
vote
1answer
110 views

Does the category of posets have pushouts and pullbacks? [duplicate]

Let $\mathbf{Poset}$ be the category of partially ordered sets with order-preserving maps. Does $\mathbf{Poset}$ have both pushouts and pullbacks?
3
votes
1answer
149 views

Uniformizing a relation on ordered sets

Suppose $A$ and $B$ are (complete) ordered sets. Suppose $R\subseteq A\times B$, and $f(a)=\inf\{b : (a,b)\in R\}$ $g(b)=\inf\{a : (a,b)\in R\}$ then what can we call $f$ and $g$? Perhaps there is ...
3
votes
0answers
98 views

Order dimension vs topological dimension of a poset

Let $(P,\leq)$ be a partially ordered set (poset). We define the ordering dimension $\textrm{dim}_\textrm{ord}(P)$ of $(P,\leq)$ to be the smallest cardinal $\kappa$ such that there exist a set of ...
4
votes
3answers
276 views

Classification of countable posets?

Is there a classification of countable posets where between each two comparable elements there is a third element between them?
13
votes
1answer
1k views

Is every continuous function measurable?

This question has already been asked on Math StackExchange here, but was too old to be migrated, and I think will be more appropriate to MathOverflow. In non-Hausdorff topology it is standard to ...
27
votes
3answers
844 views

Is the fixed point property for posets preserved by products?

Recall that a partially ordered set (poset) $P$ has the fixed point property (FPP) if any order preserving function $f:P\longrightarrow P$ has a fixed point. Theorem. Suppose $P$ and $Q$ are posets ...
3
votes
1answer
88 views

reduction to np hard ordering problem

I am trying to show a reduction from a problem of ordering problem to an np-hard problem that has approximation poly-time algorithm. My problem is: I have M auctions and in each auction I have N ...
3
votes
2answers
168 views

Directed subposet of a poset containing the minimal elements

The following appears naturally in a certain context: Let $P$ be a graded partially ordered set. Let $M$ be the subset of minimal elements of $P$. Define subsets $E_i$ inductively as follows: First, ...
3
votes
3answers
110 views

Are there any results on well-quasi-ordering of languages?

There are a number of papers that I can find about well-quasi-orders in formal lnaguage theory, by Kunc, de Luca, D'Alessandro, and Varricchio, among others. I am interested, however, in well-quasi ...
5
votes
0answers
89 views

Mapping graphs to ordinals

Robertson-Seymour theorem implies that graph minor relation is a well-quasi-ordering, which means (among other things) that this relation can be extended to a well-order, and other result says that ...
7
votes
1answer
235 views

The category of categories and adjunctions

What is known about the category that has small categories as objects and adjunctions as morphisms? Obviously, it has neither terminal nor initial objects. But what about other kinds of limits? Are ...
8
votes
0answers
116 views

Can $Ded(\kappa)$ be a supremum?

Definition If there is a dense linear order w/o endpoints of size $\lambda$ with a dense subset of size $\kappa$ then write $D(\kappa,\lambda)$. $Ded(\kappa)=\sup_\lambda \{D(\kappa,\lambda)\}$. It ...
4
votes
1answer
169 views

Profinite completion of a partial order

In Johnstone's Stone Spaces it is proved that the category of profinite partial orders is (equivalent to) the category of ordered Stone spaces (also called Priestley spaces) and that the obvious ...
3
votes
2answers
155 views

Finite lattices whose number of join-irreducibles does not exceed its height

In a finite distributive lattice $L$ one has $height(L) = |J(L)|$ i.e. the size of the largest chain equals the number of join-irreducible elements. Briefly, this follows by arranging the subposet ...
4
votes
2answers
260 views

Equality-preserving embeddings of finite trees

For finite trees $T_{1}$ and $T_{2}$ labelled by elements of some infinite set $S$, (we may assume that $S=\mathbb{N}$ without loss of generality), we define an equality-preserving embedding $f$ to be ...
8
votes
1answer
185 views

Status of Barany's conjecture?

One of Barany's most intriguing conjectures is about the $f$-vectors of convex polytopes. It asks: Let $P$ be a convex $d$-polytope. Is it always true that $f_k \geq \min(f_0, f_{d-1})$? A ...
0
votes
1answer
202 views

Examples of groups such that order isomorphism of the subgroups of $G\times G$ and $H\times H$ does not imply isomorphism of $G$ and $H$

Let $G$ and $H$ be groups, $\operatorname{Sub}(G\times G)$ be the set of all subgroups of $G\times G$ and $\operatorname{Sub}(H\times H)$ be the set of all subgroups of $H\times H$. Assume there ...
4
votes
2answers
163 views

Embedding a linearly ordered free monoid into a linearly ordered group

A linearly ordered (shortly, l.o.) monoid is a triple $\mathbb M = (M, \cdot, \le)$ for which $(M, \cdot)$ is a (multiplicatively written) monoid and $\le$ is a total order on $M$ such that $xy < ...
3
votes
2answers
198 views

Combinatorial design for minimization problem over binary strings

Suppose the cost of a binary string $B$ of length $k$ is the number of $1$s that occur before the last $0$. For example, $1110$ has cost 3 while $0111$ has cost 0. Now suppose you can choose $k$ ...
1
vote
1answer
109 views

Linearly ordered set arithmetic: reference request

A lot has been written about the arithmetic of ordinal numbers. However, we can also do arithmetic with linearly ordered sets. Question. Is there an article or book where I can learn the basics of ...
2
votes
0answers
310 views

An equivariant Hahn Embedding Theorem?

The Hahn Embedding Theorem asserts that for any (linearly) ordered abelian group $\Lambda$, there exists a linearly ordered indexing set $\Omega$ such that $\Lambda$ admits an order-preserving group ...
7
votes
2answers
340 views

Which linearly ordered sets have the property that their completion is equipotent with their powerset?

As is well-known, ZFC proves the equipotency of $\mathbb{R}$ and $\mathcal{P}(\mathbb{Q}).$ Is there a nice characterization of those linearly ordered sets $L$ which, like $\mathbb{Q}$, have the ...
-2
votes
1answer
82 views

Monotonic sequence (edited) [closed]

For any two n-dim vector $v$ and $v'$ define $v\leq v'$ iff for each $1\leq i\leq n$, $v_i\leq v_i'$. Suppose further that the entry of vectors can only take values from $m$ distinct values $\{a_1, ...
3
votes
1answer
87 views

existence of more distributive Boolean lattices

Are there a Boolean lattice $(X,\le)$ and a nonempty collection $(a_{ij})_{i\in I,j\in J}\subseteq X$ such that $$\bigvee_{i\in I}\bigwedge_{j\in J}{a_{ij}}\ne \bigwedge_{f:I\to J}\bigvee_{i\in ...
1
vote
1answer
417 views

Compactness and completeness in Gödel logic

The standard proof of the completeness theorem in first-order Gödel logic is based on a first-order countable language. I want to know that is there any proof of the completeness theorem in ...
0
votes
1answer
99 views

Characterizing Inf and Sup sets

Suppose $X$ is a set. Let $\Xi$ be the set of all pairs $(\mathcal A,\mathcal B)$ such that $$\mathcal A, \mathcal B \subseteq \mathcal P(X)$$ and for some partial order $\le$ on $X$, $\mathcal A$ is ...
4
votes
0answers
66 views

Reference for statement that almost every $n$-element partial order has trivial automorphism group

I'm looking for a reference for the statement that almost every partial order on $n$ elements has trivial automorphism group. I've been told that this is a folklore result. Does anyone know of a ...
1
vote
0answers
62 views

First-order Peano Axioms and order-completeness of $\mathbb{N}$ [closed]

Definition: An ordered set is order-complete if any nonempty subset with an upper bound, has a lowest upper bound or supremo. Notation: We denote the system of first-order Peano Axioms (along with ...
2
votes
1answer
164 views

Semitransitive relations

By a digraph, let us mean an ordered pair $(X,r)$ with $r : X \times X \rightarrow B,$ where $X$ is a set and $B = \{\mathrm{False}, \mathrm{True}\}.$ Then supposing $\mathbb{X} =(X,r)$ is a digraph, ...
1
vote
0answers
83 views

A categorical analogue of Debreu's independent factors theorem

Background A major question in Decision Theory is that of the cardinal meaning of a utility function. That is, given a set $X$, a utility function $u:X\rightarrow \mathbb{R}$ represents the choices ...
2
votes
1answer
101 views

Has the single sorted case of formal concept analysis been investigated?

A formal context in formal concept analysis is a triple $K = (G, M, I)$ where $G$ is a set of objects, $M$ is a set of attributes and the binary relation $I \subset G \times M$ shows which objects ...
2
votes
3answers
122 views

name for a subset of a binary relational structure which is “closed downward”?

Let $X$ be a set and suppose that $R$ is a binary relation on $X$. Suppose further that $S\subseteq X$ has the property that whenever $y\in S$ and $xRy$ ($x\in X$), then also $x\in S$. Does such an ...
1
vote
1answer
112 views

Uniqueness of minimal completions of a partially ordered set

The partially ordered set $(Y,\le)$ is called a superspace of the partially ordered set $(X,\le')$ iff $X\subseteq Y$. $\le'=(\le\cap X^2)$. and a completion of $(X,\le')$ if in addition $~~ 3$. ...
2
votes
1answer
93 views

Example involving partially ordered Abelian groups

Definition 1: Let $(G,\leq)$ be a nonzero partially ordered Abelian group with order unit $u$. (Recall that $u\in G$ is a order unit if, for every $g\in G$, there exists $N\in\mathbb N$ such that ...