The tag has no wiki summary.

learn more… | top users | synonyms

9
votes
1answer
436 views

Any further applications of Freudenthal's 1936 Spectral Theorem ?

Seemingly completely forgotten, back in 1936, the Dutch mathematician Freudenthal, quite well known at the time, proved his so called Spectral Theorem, see chapter 6 in Luxemburg & Zaanen : Riesz ...
9
votes
0answers
198 views

Reference for sparseness of incomparability graphs implying sparseness of covering graphs

If a partial order on $n$ elements has $m$ incomparable pairs, then its covering graph (aka Hasse diagram aka transitive reduction, the graph of pairs of elements that are comparable but are not the ...
8
votes
0answers
125 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 ...
8
votes
0answers
267 views

Higher-order dimension in posets: a reference request

Let $P = (X, \le)$ be a partially-ordered set. Then the dimension of $P$ is the minimum number of total orders over $X$ whose intersection yields $P$. Alternately, the dimension of $P$ is the minimum ...
6
votes
0answers
75 views

Optimal strategy for game of 'online sorting' into a poset

Consider a single-player game played with an arbitrary finite poset, and a random number generator with a known distribution: Each turn, the RNG produces a number, and the player must assign that ...
6
votes
0answers
424 views

What is the structure of a space of $\sigma$-algebras?

Let $X$ be a compact metric space, and consider the Banach space $\Omega = C(X,\mathbb R)$ of continuous, real-valued functions on $X$, equipped with the supremum norm. Let $\delta_x \in \Omega^*$ be ...
5
votes
0answers
94 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 ...
5
votes
0answers
190 views

Proving equivalence of a tree-based version of Countable Choice for families of finite sets

In this paper by Good and Tree, the following result is mentioned without proof as part of Proposition 6.5: Each of the following statements imply those beneath it. The countable union of ...
4
votes
0answers
277 views

Order theory as a foundation of mathematics?

I know the followings kinds of formalization of mathematics: based on set theory (e.g. ZFC) based on type theory (e.g. the formalism of Coq proof assistant, as an advanced example) based on category ...
4
votes
0answers
33 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 ...
4
votes
0answers
70 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 ...
4
votes
0answers
191 views

Oriented matroids and posets?

Is there a characterization of oriented matroids in terms of order theory, similar to that of matroids as geometric lattices? Does this question make sense at all? I have seen (for instance in ...
3
votes
0answers
110 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 ...
3
votes
0answers
94 views

Expected size of $k$-th layer of a POSET

Is this known? What is the expected width of the $k$-th layer (anti-chain layer) of a $d$-dimensional partially ordered set of $n$ elements formed by product of $d$ random linear orders chosen from ...
3
votes
0answers
209 views

When Aut(M) preserves a linear order?

I have a general-type question: Suppose $M$ is a countable structure that is ultrahomogeneous, i.e. every (partial) isomorphism between finitely generated substructures of $M$ extends to an ...
3
votes
0answers
371 views

a poset with small “cycles”

(a followup to this recent question) I noticed the following curious property of a poset (which I strongly believe to be a lattice, I'm still trying to prove that...): Suppose that $z$ is covered by ...
3
votes
0answers
194 views

An elegant formulation for typed sets

Fix a poset $T$, which we'll think of as a set of "types," interpreting $a \leq b$ as "$a$ is more general than $b$." Construct a category of TSet as follows. Objects: Pairs ($X$, $\tau : X ...
3
votes
0answers
179 views

How linearly independent are the obvious combinatorial invariants of a Bruhat interval?

Let $[u, v]$ be a Bruhat interval in some Coxeter group. Let $I$ be the set of all Bruhat intervals. I am interested in functions $I \to \mathbb{Z}$ which are invariant under poset isomorphisms. ...
2
votes
0answers
52 views

Is the order convergence topology on a poset always Hausdorff?

In this post two topologies on a poset $(P,\leq)$ were defined: the interval topology $\tau_i(P)$ and the order convergence topology $\tau_o(P)$. It turns out that $\tau_i(P)$ is always $T_1$ and ...
2
votes
0answers
28 views

Conditions for monotone function to take maximal chains to maximal chains surjectively

Suppose that $P$ and $Q$ are graded posets (with rank function $r$) and suppose that all maximal chains of $P$ and $Q$ have length $n$. Let $f:P \to Q$ be a surjective monotone function such that ...
2
votes
0answers
59 views

Is $\mathcal{P}(\omega)/fin$ with the interval topology path-connected?

Is $\mathcal{P}(\omega)/fin$ with the interval topology path-connected? (You find the definition of $\mathcal{P}(\omega)/fin$ here.)
2
votes
0answers
96 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 ...
2
votes
0answers
88 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]$ ...
2
votes
0answers
314 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 ...
2
votes
0answers
117 views

Generalization of order dimension and interval orders

A partial order $(X, <_X)$ has order dimension $n$ if it can be realized as the product order of $n$ total orders, which means that there is an order-embedding between $(X, \lt_X)$ and $(Y^n, ...
2
votes
0answers
78 views

A specific notion between the notions of transversal and system of distinct representatives.

Let $X$ be a set, let $\mathcal{C}$ be a collection of subsets of $X$, and let $x_1, \dots , x_k \in X$. Say that the sequence $\{x_i\}_{i=1\dots k}$ is a sequential transversal (of length $k$) ...
1
vote
0answers
95 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 ...
1
vote
0answers
94 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 aren't ...
1
vote
0answers
57 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 \mathcal{V}$ has a ...
1
vote
0answers
126 views

How many more join-irreducibles can there be in a sub join-semilattice of a finite lattice?

Let $L$ be a finite lattice. Then $L$ is generated by its join-irreducible elements $J(L)$ or alternatively its meet-irreducible elements $M(L)$. If $S \subseteq L$ is a sub join-semilattice then ...
1
vote
0answers
204 views

What is known about orbifolding ordered groups and sets? Who has been involved? Links to Lee metrics?

In mathematical music theory several ordered groups are considered. Some examples contain the frequency space or Tonnetzes. Other groups (commutative and non-commutative ones) are discussed by Dawid ...
1
vote
0answers
222 views

Modern books about orders and algebras on trees

Please help to find books about orders and algebras on trees. If there is no modern books, please advice good old ones! I'm more interested in finite trees (my current problem), but infinite ones are ...
1
vote
0answers
321 views

Functoriality of a standard integral domain construction.

The evident forgetful functor from fields to integral domains has a left adjoint, namely the construction of the quotient field for a given integral domain. Another standard construction is taking the ...
0
votes
0answers
43 views

Quasi-transitive decomposition of a transitive graph

Let $G=(V,E)$ be a simple digraph that is semi-complete (ie. there's at least one arc between each unordered pair of vertices) and quasi-transitive (ie. its complement is transitive). Is it true that ...
0
votes
0answers
226 views

Transitive closures and inductive reasoning [solved]

Let's say that r is an endorelation over A (i.e. $r$ is a subset of $A \times A$), $\bar{r}$ is the transitive closure of r (i.e. the least set containing r and being transitive). Furthermore $r$ has ...
0
votes
0answers
170 views

Vector-valued valuations on lattices

There's a fair amount of work on valuations on (modular) lattices, by which I mean functions $v : \mathcal{L} \rightarrow R$ that satisfy the modular expression $$v(x) + v(y) = v(x \wedge y) + v(x ...