## Tagged Questions

2answers
151 views

### Is it possible to reconstruct an order type from its initial segments?

Suppose $T$ is a totally ordered set without a maximal element, $\tau$ is the order type of $T$, $S$ is the set of order types of all proper initial segments (downward closed sub …
1answer
171 views

### Order dimension and weak poset partitions

The order dimension of a poset $(P,\leq)$ is the least number of linear extensions of $(P,\leq)$ such that the intersection of these extensions is $(P,\leq)$. The wikipedia entry p …
2answers
81 views

### Order-isomorphic down-set lattices

Let $X$ be an ordered set. A down-set (also called a lower set or an order ideal) of $X$ is a subset $D$ of $X$ such that for every $x, y \in D$, if $x \in D$ and $y \leq_X x$, the …
0answers
82 views

### Set of upper bounds is finite for any finite subset

Is there a term to describe a preordered set $P$ in which any finite subset $S \subset P$ has at most finitely many minimal upper bounds? The preordered sets I'm studying generally …
3answers
304 views

### Why do we choose the standard total order on the integers?

I understand why the set of natural numbers $\mathbb N = \{ 0, 1, 2, \cdots \}$ is equipped with a total order. Indeed, every monoid has a pre-order, where n' \succeq n \quad \ma …
1answer
60 views

### Counting linear extensions of unlabeled series parallel structures

I am interested in the problem of counting the number of linear extensions of series-parallel structures. The wikipedia article at http://en.wikipedia.org/wiki/Series-parallel_part …
0answers
37 views

### Rotation-invariant strict-inclusion-preserving preorderings on subsets of the circle

Say that a preordering $\le$ on a set of subsets of some space preserves strict inclusion provided that $A\lt B$ whenever $A\subset B$ (where $A\lt B$ iff $A\le B$ and \$B \not\le A …
1answer
83 views

### Distributive lattice embedding into a finite lattice.

Suppose one has an inclusion $\iota : D \hookrightarrow S$ where $D$ is a finite distributive lattice and $S$ is a finite join-semilattice. If $\iota$ preserves all meets and join …
1answer
210 views

### Is there a natural measurable structure on the $\sigma$-algebra of a measurable space?

Let $(X, \Sigma)$ denote a measurable space. Is there a non-trivial $\sigma$-algebra $\Sigma^1$ of subsets of $\Sigma$ so that $(\Sigma, \Sigma^1)$ is also a measurable space? …
2answers
181 views

### Banach lattice subspace of $C([0,1])$ not a sublattice

This is probably easy, but I did not see it in standard texts. Describe a closed subspace $V$ of $C([0,1])$ such that $V$ is a Banach lattice (in the pointwise ordering), but $V$ …
2answers
145 views

### Reference Book for supremum and infimum theorems

For my work I need many of the very easy and basic properties of suprema and infima. While they are all pretty easy to prove, I would prefer to refer to a standard text book. Howev …
1answer
78 views

### Covering of a partial order by upwards convex sets

First off: I'm not an expert in order theory, so some of my terms might be off; correct them if you wish. Let me call a subset $A$ of a lattice $(S,\le)$ upwards convex (not sure …
2answers
133 views

### Cardinality of Equivalence Relation of Eventually Sublinear Functions

Let $\Bbb{R}^{+}_{0}$ be the set of non-negative real numbers and $\Bbb{R}^{+}$be the set of positive reals. Let us say that a function \$f \colon \Bbb{R}^{+}_{0} \to \Bbb{R}^{+}_{0 …
0answers
27 views

### Looking for a uniform explanation of algebras with canonical generators.

Let $\mathcal{V}$ be a finitary variety i.e. the algebras for a signature whose operations have finite arity and for some arbitrary set of equations. Then any algebra \$A \in \mathc …
1answer
172 views

### Is it possible to decide in polynomial time if a poset is a subposet of another which is given ?

I am reading some theory on partial orders and I wonder something which perhaps has a simple answer : Given two partial orders $G_1,G_2$ (by their hasse diagrams), is it possible t …

15 30 50 per page
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 44, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8999494314193726, "perplexity_flag": "head"}