Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 8628

The theory of lattices in the sense of order theory. For the number-theoretic notion, use the tag "lattices" instead.

3 votes
1 answer
117 views

Non-isomorphic $T_0$-spaces with order-isomorphic topologies

Are there non-isomorphic $T_0$-spaces $(X_i, \tau_i)$ for $i = 1,2$ such that $\tau_1 \cong \tau_2$ when considered as partially ordered sets?
Dominic van der Zypen's user avatar
0 votes
0 answers
114 views

"Infima" and "suprema" in the homomorphism preorder on hypergraphs on $\omega$

$\newcommand{Po}{{\cal P}(\omega)}$ $\newcommand{lh}{\leq_{\text{hom}}}$ If $H_i = (V_i, E_i)$ are hypergraphs for $i = 1,2$, then a map $f:V_1 \to V_2$ is said to be a (hypergraph) homomorphism if $f …
Dominic van der Zypen's user avatar
9 votes
1 answer
358 views

Are the Boolean algebras ${\cal P}(\omega)/(\text{fin})$ and ${\cal P}(\omega)/(\text{thin})...

A set $A\subseteq \omega$ is said to be thin if $$\lim\sup_{n\to\infty}\frac{|A\cap \{0,\ldots, n\}|}{n+1} = 0.$$ We say for $A, B\subseteq \omega$ that $A\simeq_\text{fin} B$ if the symmetric differe …
Dominic van der Zypen's user avatar
13 votes
1 answer
274 views

Can any poset of cardinality $\leq 2^{\aleph_0}$ be embedded in ${\cal P}(\omega)/(\text{fin...

We endow ${\cal P}(\omega)$ with an equivalence relation by saying that $A\simeq_{\text{fin}} B$ iff the symmetric difference $A\Delta B$ is finite. The resulting set of equivalence classes is denoted …
Dominic van der Zypen's user avatar
6 votes
1 answer
355 views

Is every homogeneous poset a lattice?

A poset $(P,\leq)$ is homogeneous if $P\cong [a,b]$ for all $a,b\in P$ with $a<b$ (where $[a,b] := \{x\in P: a\leq x\leq b\}$). Examples of homogeneous posets include $[0,1]$, $[0,1]\cap \mathbb{Q}$, …
Dominic van der Zypen's user avatar
2 votes
0 answers
114 views

Product-decomposition of ${\cal P}(\omega)/\rm{fin}$ [closed]

For $A,B\in {\cal P}(\omega)$ let us say that $A\simeq_{\rm{fin}} B$ if both $A\setminus B$ and $B\setminus A$ are finite. It is easy to see that this establishes an equivalence relation on ${\cal P}( …
Dominic van der Zypen's user avatar
3 votes
2 answers
140 views

Is $(\omega+1)^\omega/{\cal U}$ complete for ${\cal U}$ free ultrafilter?

Let ${\cal U}$ be a free ultrafilter on $\omega$. Is the linearly ordered set $(\omega+1)^\omega/{\cal U}$ complete?
Dominic van der Zypen's user avatar
2 votes
1 answer
117 views

Dedekind-MacNeille completion of ${\cal P}(\omega)/({\rm fin})$

Let ${\cal P}(\omega)/({\rm fin})$ be the quotient of the Boolean algebra ${\cal P}(\omega)$ where two sets are considered to be equivalent if they differ by a finite number of elements. It turns out …
Dominic van der Zypen's user avatar
3 votes
2 answers
500 views

"Pseudo-Boolean" lattice (almost every element has several complements)

If $(L,\leq)$ is a lattice with bottom element $0$ and top element $1$ and $x\in L$ we say that $y$ is a complement of $x$ if $x\vee y = 1$ and $x\wedge y = 0$. Is there a lattice $(L,\leq)$ with more …
Dominic van der Zypen's user avatar
0 votes
2 answers
102 views

Is this ordering on the set of all covers of $\omega$ a (complete) lattice?

Let ${\frak C} \subseteq {\cal P}({\cal P}(\omega))$ be the collection of all covers of $\omega$ (that is, ${\cal C} \in {\frak C}$ iff $\bigcup {\cal C} = \omega$.) We define the following binary re …
Dominic van der Zypen's user avatar
4 votes
1 answer
288 views

Does the lattice of partitions map onto the lattice of subsets?

Let $X\neq \emptyset$ be a set and let $X^X$ denote the collection of all functions $f:X\to X$. We put a binary relation (reflexive and transitive), the composition preorder on $X^X$ by setting for $f …
Dominic van der Zypen's user avatar
1 vote
1 answer
100 views

Are non-trivial interval-isomorphic posets lattices?

We say that a partially ordered set $(P,\leq)$ is interval-isomorphic if for all $a<b \in P$ we have $P \cong [a,b]$, where $[a,b]=\{x\in P:a\leq x\leq b\}$. Suppose $(P,\leq)$ is interval-isomorphi …
Dominic van der Zypen's user avatar
6 votes
1 answer
212 views

Pairwise non-isomorphic interval-isomorphic lattices

Let us call a lattice $(L,\leq)$ interval-isomorphic if for all $a<b \in L$ we have $L \cong [a,b]$, where $[a,b]=\{x\in L:a\leq x\leq b\}$. Are there $2^{\aleph_0}$ pairwise non-isomorphic interval …
Dominic van der Zypen's user avatar
2 votes
2 answers
186 views

Infima and suprema in the "transfer" function ordering

Let $X,Y$ be sets, $f, g:X\to Y$ be functions. We say $u:Y\to Y$ is a transfer function for $g$ to $f$ if $$f = u \circ g.$$ In that case we write $f \leq_t g$. Let $\mathrm{Fct}(X,Y)$ denote the coll …
Dominic van der Zypen's user avatar
1 vote
2 answers
229 views

Can the Boolean Algebra of regular open sets be isomorphic to ${\cal P}(\omega)/(\text{fin})$?

Let $(X,\tau)$ be a topological space. $A\subseteq X$ is said to be regular open if $A = \text{int}(\text{cl}(A))$ and let $\text{RO}(X,\tau)$ denote the collection of regular open sets of $X$. A stan …
Dominic van der Zypen's user avatar

1
2 3 4 5 6
15 30 50 per page