Skip to main content

All Questions

Filter by
Sorted by
Tagged with
13 votes
2 answers
1k views

What's the deal with De Morgan algebras and Kleene algebras?

The notion of Boolean algebras, and the corresponding classical propositional logic, is very standard, and it is easy to find information about them (for example, among many other such works, there is ...
Gro-Tsen's user avatar
  • 32.5k
5 votes
0 answers
201 views

Is this "trimming" of a supersolvable semimodular lattice known?

Let $L$ be a finite (upper) semimodular lattice. Recall that this means $L$ is graded and its rank function $\rho\colon L \to \mathbb{N}$ satisfies $$ \rho(x) + \rho(y) \geq \rho(x\vee y)+\rho(x \...
Sam Hopkins's user avatar
  • 24.2k
4 votes
0 answers
234 views

To whom is the classification of atomic, modular finite lattices due?

Here lattice means a poset with meets and joins. A lattice is called atomic if every element is a join of atoms. There are a few different ways to define modular for finite lattices: one is that the ...
Sam Hopkins's user avatar
  • 24.2k
12 votes
11 answers
1k views

Lattices on classical combinatorial families

I am asking for examples of lattices defined on classical combinatorial families, such as Permutations, Catalan objects, set partitions or integer partitions, graphs. I am mosty interested in lattices ...
Martin Rubey's user avatar
  • 5,822
10 votes
1 answer
492 views

is there a ‘nice’ lattice on the set of unlabelled graphs with $n$ vertices?

It is easy to endow the set of vertex-labelled graphs with $n$ vertices with a lattice structure: take the union and the intersection of the edge set as meet and join respectively. However, I wonder ...
Martin Rubey's user avatar
  • 5,822
1 vote
2 answers
195 views

Reference request: lower sets of a preorder form a lattice

Consider a set $S$ with a preorder $\preceq$ (a preorder is a reflexive and transitive relation). A lower set $A$ of $S$ is defined as a subset of $S$ such that for all $x \in S$ and $y \in A$, if $...
Artemy's user avatar
  • 695
0 votes
0 answers
206 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 \...
Suresh Venkat's user avatar