Search Results
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 |
The theory of lattices in the sense of order theory. For the number-theoretic notion, use the tag "lattices" instead.
10
votes
2
answers
468
views
Are all monomorphisms in the category of bounded lattices regular?
Let $\mathbf{Lat}_{01}$ be the category of bounded lattices with lattice homomorphisms that respect the smallest and the largest element. Is there a monomorphism in $\mathbf{Lat}_{01}$ that is not reg …
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?
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 …
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 …
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 …
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}$, …
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}( …
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?
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 …
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 …
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 …
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 …
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 …
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 …
4
votes
3
answers
513
views
Non-principal prime ideals in infinite distributive lattices
Given an infinite distributive lattice $L$, does $L$ contain a non-principal prime ideal $I$, or a non-principal prime filter $F$? ($I$ is said to be principal if there is $x\in L$ such that $I=\{y\in …