Back to search

University of North Dakota

Thresholds In Modular Lattices

Abstract

dc:description.abstract

This study investigates threshold phenomena in infinite modular lattices, extending classical threshold theory beyond Boolean and distributive lattice settings. Specifically, let\(P\) be a finite graded modular lattice with a finite graded modular lattice with rank function \(r: P \rightarrow \mathbb {N}\). By adapting probabilistic combinational methods, notably the methods used by Janson, Łuczak, and Ruciński (2011), we establish rigorously that every monotone property \(F\subseteq P\) possesses a threshold under the chain-uniform random model.Formally, this threshold is characterized by a critical rank M*, at which the probability \mathbb{P}(\GammaM\in F) transitions sharply from nearly 0 to nearly 1 as the parameter \(M\) passes through M*. Significant contributions include deriving explicit thresholds in various algebraic contexts. In particular, for lattices of normal subgroups \(N\triangleleft G\) of finite groups \(G\), thresholds distinguish probabilistically between abelian and anabelian subgroups. Additionally, analogous threshold phenomena are investigated within the lattice of finite fields in terms of cyclic Galois extensions, highlighting their algebraic significance.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kwakye, Daniel Atta
Contributors dc:contributor
  • Bryce Christopherson

Identifiers

dc:identifier.*
Repository record dc:identifier
https://commons.und.edu/theses/7131

Chain of custody

source
Harvested from
University of North Dakota
Base URL
commons.und.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Kwakye, Daniel Atta. Thresholds In Modular Lattices. Thesis thesis, https://commons.und.edu/theses/7131