Questions tagged [lattice-theory]

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

111 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
25 votes
0 answers
542 views

A conjecture about inclusion–exclusion

$\newcommand\calF{\mathcal{F}} \def\cupdot {\stackrel{\bullet}{\cup}} \def\minusdot {\stackrel{\bullet}{\setminus}}$This post presents a conjecture that we have with some colleagues. It is about ...
M.Monet's user avatar
  • 351
22 votes
0 answers
1k views

Given a lattice L with n elements, are there finite groups H < G such that L $\cong$ the lattice of subgroups between H and G?

If there is no restriction on $n$, this is a famous open problem. I'm wondering if any recent work has been done for small $n>6$. I believe the question is answered (positively) for $n=6$ by ...
William DeMeo's user avatar
10 votes
0 answers
307 views

Differential posets, the Plancherel state $\varphi_\mathrm{P}$, and minimality

$\newcommand\rank[1]{\lvert#1\rvert}$Let $\Bbb{P}$ be a 1-differential poset with a unique bottom element $\emptyset \in \Bbb{P}$. With some minor abuse in terminology, The Plancherel measure state $...
Jeanne Scott's user avatar
  • 1,847
10 votes
1 answer
2k 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 ...
porton's user avatar
  • 739
9 votes
0 answers
245 views

Is there a notion analogous to separability but requiring definable rather than countable sets?

Among models of $\lambda$-calculus, some like the Bohm tree model have the property that every element is a directed sup of definable elements, whereas others like the $D_\infty$ and $P(\omega)$ ...
fritzo's user avatar
  • 221
9 votes
1 answer
423 views

Structure of $Hom(L_1,L_2)$, where $L_i$ are distributive lattices

Is there known structures/ or has there been studies on $Hom(L_1,L_2)$ of distributive lattices? Could it be made into a lattice naturally? Is there any structure on the set of ring valued functions $...
mukhujje's user avatar
  • 281
8 votes
1 answer
499 views

Can one characterize maximal antichains in terms of distributive lattices?

This is inspired by the recent question Verification of a maximal antichain The celebrated duality between finite posets and finite distributive lattices has several nice formulations. One of them ...
მამუკა ჯიბლაძე's user avatar
8 votes
0 answers
154 views

Periods of Coxeter transformation associated to root posets

$\DeclareMathOperator\Co{Co}$Let $P$ be the root poset associated to a simple Lie algebra. Let $L=L(P)$ denote the distributive lattice of order ideals of $P$ and let $\Co_L$ denote the Coxeter matrix ...
Mare's user avatar
  • 25.8k
7 votes
0 answers
582 views

A new and subtle order-theoretic fixed point theorem

Sometimes a very simple argument appears out of the blue and overturns a subject. It is not based on pre-existing theory and heavy involvement in such a theory is actually a handicap in finding such ...
Paul Taylor's user avatar
  • 7,986
7 votes
0 answers
245 views

Interesting uniform posets

A sequence $(P_0,P_1,\ldots)$ of finite posets is called uniform if: each $P_n$ is graded of rank $n$ with a minimum $\hat{0}_n$ and a maximum $\hat{1}_n$; for any $p \in P_n$ with $\mathrm{rank}(p)=n-...
Sam Hopkins's user avatar
  • 22.7k
7 votes
0 answers
138 views

poset of lattice properties

Is there a good overview of the dependencies between properties that a (finite) lattice poset can have? To give a practical example, I was looking for a property weaker than congruence uniform and ...
Martin Rubey's user avatar
  • 5,533
7 votes
0 answers
337 views

A homological algebra approach to the Union-closed sets conjecture

I noted a while ago that there is a nice homological formulation using incidence algebra of the Union-closed sets conjecture (https://en.wikipedia.org/wiki/Union-closed_sets_conjecture). It might just ...
Mare's user avatar
  • 25.8k
7 votes
0 answers
182 views

Classification of posets that are quotient posets of the Boolean lattice

Quotient posets of the Boolean lattice $B_n$ have interesting properties and are for example discussed in chapter 5 of Stanley's book on algebraic combinatorics. $B_n/G$ for a subgroup $G$ of the ...
Mare's user avatar
  • 25.8k
7 votes
0 answers
147 views

On the isomorphism of the lattices of submodules of certain free modules

Let $K,L$ be two finite extensions of the $p$-adic field $\mathbb{Q}_p$ of the same degree. Let $\mathcal{O}_K$ and $\mathcal{O}_L$ be the ring of integers of these two fields, and let $\mathcal{O}_K^...
Richard Stanley's user avatar
6 votes
0 answers
148 views

Natural bijection between join- and meet-irreducibles in modular lattices?

A well known property of finite modular lattices is that they have the same number of join-irreducible and meet-irreducible elements. I was wondering if there exists a natural bijection between these ...
Igor Makhlin's user avatar
  • 3,493
6 votes
0 answers
79 views

Representing meet-semilattices with vector spaces of specified dimensions

Take $K$ to be a field and take $L$ to be a finite meet-semilattice. I'm interested in the set of functions $n: L \rightarrow \mathbb{Z}^{\ge 0}$ such that there is some function $V$ from $L$ to ...
Alexander Smith's user avatar
6 votes
0 answers
690 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 ...
Tom LaGatta's user avatar
  • 8,372
5 votes
0 answers
187 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
  • 22.7k
5 votes
0 answers
172 views

"Cluster algebra" structure for finite distributive lattices

Let $P$ be an $n$-element poset and $J(P)$ the distributive lattice of its order ideals (i.e., the downwards-closed sets). For each $I\in J(P)$ let $x_I \in \mathbb{R}^{n}$ be the indicator function ...
Sam Hopkins's user avatar
  • 22.7k
5 votes
0 answers
195 views

Weak compactness is to trees as [?] is to lattices?

Let $\kappa$ be an inaccessible cardinal. Recall that $\kappa$ is weakly compact if every tree of height $\kappa$ has either a level of size $\kappa$ or a branch of size $\kappa$. So if $\kappa$ is a ...
Tim Campion's user avatar
  • 60.6k
5 votes
0 answers
191 views

Monster group as automorphism group of a distributive lattice

It is known that every finite group is the automorphism group of a finite distributive lattice. Question: What is the minimal order of a distributive lattice $L$ such that the automorphism group of $...
Mare's user avatar
  • 25.8k
5 votes
0 answers
162 views

(When) is the Dedekind-MacNeille completion of a po-set Hausdorff?

Let $X$ be a p.o. Consider the topology on $X$ generated by $$U_{x}^{-}:=X\setminus (x\uparrow),\quad U_{x}^{+}:=X\setminus (x\downarrow), \quad x\in X$$ Throughout this discussion I shall refer to ...
Thomas's user avatar
  • 263
5 votes
0 answers
196 views

Maximal subgroups of infinite index and profinite completion

Preliminary remark: I'm mainly interested in an answer (or link to ressources) in the specific context of the first Grigorchuk group, but I believe that it may be of some interest to state the ...
PHL's user avatar
  • 123
5 votes
0 answers
148 views

Sup preserving maps between distributive lattices

I have been looking at categories of sup semilattices and sup preserving maps. If $A$ and $B$ are two such, the set I denote $[A,B]$ is sup preserving homomorphisms between is also a sup semilattice ...
Michael Barr's user avatar
5 votes
0 answers
94 views

Is there an interval of finite groups, at index n, with strictly more elements than the subgroup lattice of any group, of order n?

Let $G$ be a finite group and $\mathcal{L}(G)$ its subgroup lattice. Let $s(n):= max\{|\mathcal{L}(G)| \text{ for } |G|=n \}$. There is an OEIS page for the sequence $s(n)$: A018216 1, 2, 2, 5, 2, ...
Sebastien Palcoux's user avatar
5 votes
0 answers
456 views

Have you seen this sort of an anti-involution on a lattice?

While looking at a representation theory question, I came up with the following sort of object. I want to know if it comes up often in combinatorics or some other area of mathematics. Let $P$ be a ...
Amritanshu Prasad's user avatar
5 votes
0 answers
615 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 $x$...
Martin Rubey's user avatar
  • 5,533
4 votes
0 answers
103 views

Can we extend "every finite lattice is a sublattice of partitions of a finite set" to linear and/or finitary lattices?

Pudlák and Tůma https://link.springer.com/article/10.1007/BF02482893 proved that every finite lattice can be embedded as a sublattice of the partition lattice of a finite set. Can this be generalized ...
Dale's user avatar
  • 431
4 votes
0 answers
173 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
  • 22.7k
4 votes
0 answers
121 views

Distributive lattices with periodic Coxeter matrix

Let $L$ be a finite distributive lattice and $U$ its incidence matrix with entries $u_{i,j}=1$ iff $i \leq j$ and $u_{i,j}=0$ else. Then $U^{-1}$ is the Moebius matrix of $L$ and $C_L:=- U^{-1} U^{T}$ ...
Mare's user avatar
  • 25.8k
4 votes
0 answers
122 views

A multiplication for distributive lattices via rowmotion

Let $L$ be a finite distributive lattice. In case $L$ is Boolean one can define a multiplication by $a*b:=(a \cup b) \setminus (a \cap b)=(a \cup b) \cap (a \cap b)^c$, where $(-)^c$ denotes the ...
Mare's user avatar
  • 25.8k
4 votes
0 answers
511 views

How should the proof of the XYZ theorem be understood?

The XYZ Theorem of Shepp [1] states the following for a given poset $P$. Consider the probability space of all the linear extensions of $P$, where each possible extension is equally likely. Then for ...
Hao's user avatar
  • 571
4 votes
0 answers
245 views

Generalization of a theorem of Øystein Ore in group theory: the infinite case

This post is the infinite version of this one, and is motivated by an exchange with Carmela Musella and Maria De Falco. We are interested in relative versions of the following Ore's theorem and ...
Sebastien Palcoux's user avatar
4 votes
0 answers
85 views

Is there a name for this kind of structure? (Not quite a lattice-ordered group)

I'm looking at a certain class of groups $G$ that come with a partial order $\le$ on the elements. So far it looks like $(G,\le)$ has the following properties: The partial order is invariant under ...
Colin Reid's user avatar
  • 4,678
4 votes
0 answers
408 views

Can infinite bounded distibutive lattices be "arbitrarily wide"?

I was always thinking, in an informal way, that the powerset lattices ${\cal P}(X)$ (where $X$ is an infinite set) are the "widest" bounded distributive lattices with respect to their height. (In ${\...
Dominic van der Zypen's user avatar
4 votes
0 answers
82 views

Cases of equality in Daykin's theorem

Let $A$ and $B$ be sets of subsets of $\{1, \dots, n\}$, and let $A \wedge B = \{a \cap b : a\in A, b\in B\}$, $A\vee B=\{a\cup b: a\in A, b\in B\}$. Then $$ |A \wedge B| |A\vee B| \geq |A||B|, $$ as ...
crestmods's user avatar
  • 141
4 votes
0 answers
122 views

About some distributive laws in the Bousfield lattice

It is know that for any $\alpha$-well generated tensor triangulated category $\mathcal{T}$ the collection of Bousfield classes forms a set, furthermore this set is a complete lattice, denoted by $\...
Angel Zaldívar's user avatar
4 votes
0 answers
95 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 (...
Dominic van der Zypen's user avatar
4 votes
1 answer
249 views

Constructing ordered fields with lattice structure from ordered fields without lattice structure, and vice versa, in constructive mathematics

This post originated from my reference request for the definition of an ordered field in constructive mathematics: Proper definition of ordered field in constructive mathematics We are working in ...
Madeleine Birchfield's user avatar
3 votes
0 answers
135 views

Counting integer partitions below some Young diagram

Question: Given positive, coprime integers $m<n$, consider the Young diagram $Y$ formed by the lattice points in the Cartesian plane lying below the line from $(0,0)$ to $(m,n)$ and within the ...
Yly's user avatar
  • 946
3 votes
0 answers
111 views

Book and article recommendations with the purpose of studying the intersection between probability theory and lattice theory

Lately, I have been studying probability theory and lattice theory separately and I would like to investigate ideas which relate both subjects together. Having said that, I would like to know if ...
user1234's user avatar
  • 159
3 votes
0 answers
131 views

Partial orders on $\mathbb{N}^m$ compatible with addition

I'm looking for a classification (or just non-trivial examples) of partial orders on monoid $\mathbb{N}^{m}$ that are compatible with addition. That is, partial orders $\leq$ satisfying two additional ...
Rybin Dmitry's user avatar
3 votes
0 answers
205 views

Does every finite lattice embed into a finite Eulerian lattice?

A finite Boolean lattice is a lattice isomorphic to the subset lattice of a finite set. Every Boolean lattice is Eulerian, namely, a graded lattice $L$ such that $\mu(a,b) = (-1)^{|b|-|a|}$ for all $a,...
Sebastien Palcoux's user avatar
3 votes
0 answers
100 views

Do Frobenius algebras have a lattice basis and what lattices do appear?

Let $K$ be for simplicity be the field with two or three elements (or alternatively we could restrict to ideals containing only the field elements $-1$ or $1$ as coefficients). A (commutative) ...
Mare's user avatar
  • 25.8k
3 votes
0 answers
98 views

Shellability and order filters in the partition lattice

Choose $n\in\mathbb N$. Let $B$ be a non-empty subset of $[n]:=\{1,2,\dots,n\}$. Consider the set of partitions of the set $[n]$ with exactly $|B|$ parts such that each part has exactly one member ...
Tri's user avatar
  • 1,366
3 votes
0 answers
397 views

Equivalence of the union-closed sets conjecture that is locally weaker of any use?

Let $F$ be a union-closed family. We call $F$ minimal if for every $x\in \cup(F)$ we find $S\in F$ such that $S\backslash \{x\} \in F$. It is sufficient to proof the union-closed sets conjecture for ...
kevkev1695's user avatar
  • 1,023
3 votes
0 answers
92 views

Terminology for set systems: "trace" or "projection"?

Although the following question is not in itself mathematical, it is the expertise/breadth of the research community in mathematics that I wish to appeal to, beyond the filtered/trained search results ...
Yemon Choi's user avatar
  • 25.5k
3 votes
0 answers
130 views

Open sets on a Stone space

If $B$ is a Boolean algebra (possibly assumed complete), is there a standard name for the Heyting algebra (or frame) $L := \Omega(S(B))$ of open sets on the Stone space $S(B)$ of $B$, — or for the ...
Gro-Tsen's user avatar
  • 29.9k
3 votes
0 answers
102 views

A largest lattice of a given Vapnik-Chervonekis dimension

Prove (or disprove) that a largest lattice of Vapnik-Chervonekis dimension at most $k$ which has at most $n\cdot k$ join-irreducible and $n\cdot k$ meet-irreducible elements is the distributive ...
Lviv Scottish Book's user avatar
3 votes
0 answers
65 views

Word problem for finitely presented bounded lattices

There is a solution to the word problem for finitely presented (non-bounded) lattices, as well as a solution to the word problem for free bounded lattices. I am assuming that there is a solution to ...
User7819's user avatar
  • 203