Related papers: Filters in the partition lattice

In this master thesis, we extend results from classical simple homotopy theory to the world of stratified homotopy theory. To obtain a well-established framework to work in, we prove a series of results on two model categories of simplicial…

To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…

The second-order differential equation describes harmonic oscillators, as well as currents in LCR circuits. This allows us to study oscillator systems by constructing electronic circuits. Likewise, one set of closed commutation relations…

Let H and K be finite composition series of a group G. The intersections H_i\cap K_j of their members form a lattice CSL(H,\K) under set inclusion. Improving the Jordan-H\"older theorem, G. Gr\"atzer, J.B. Nation and the present authors…

We study the Hodge filtrations of Schmid and Vilonen on unipotent representations of real reductive groups. We show that for various well-defined classes of unipotent representations (including, for example, the oscillator representations…

Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a combinatorial analog of the classic Helmholz-Hodge decomposition of a smooth vector field. Specifically, we show that for every polyhedral…

The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…

We classify certain categories of partitions of finite sets subject to specific rules on the colorization of points and the sizes of blocks. More precisely, we consider pair partitions such that each block contains exactly one white and one…

Two fundamental algorithm-design paradigms are Tree Search and Dynamic Programming. The techniques used therein have been shown to complement one another when solving the complete set partitioning problem, also known as the coalition…

This paper establishes the separation of complexity classes $\mathbf{P}$ and $\mathbf{NP}$ through a novel homological algebraic approach grounded in category theory. We construct the computational category $\mathbf{Comp}$, embedding…

Since Henrik Strietz's 1975 paper proving that the lattice Part($n$) of all partitions of an $n$-element finite set is four-generated, more than half a dozen papers have been devoted to four-element generating sets of this lattice. We prove…

In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…

Compact quantum groups can be studied by investigating their co-representation categories in analogy to the Schur-Weyl/Tannaka-Krein approach. For the special class of (unitary) "easy" quantum groups these categories arise from a…

The observation that a graph of rank $n$ can be assembled from graphs of smaller rank $k$ with $s$ leaves by pairing the leaves together leads to a process for assembling homology classes for $Out(F_n)$ and $Aut(F_n)$ from classes for…

Here we show that, given a finite homological system $({\cal P},\leq,\{\Delta_u\}_{u\in {\cal P}})$ for a finite-dimensional algebra $\Lambda$ over an algebraically closed field, the category ${\cal F}(\Delta)$ of $\Delta$-filtered modules…

Classical and quantum Hamiltonian reductions of free geodesic systems of complete Riemannian manifolds are investigated. The reduced systems are described under the assumption that the underlying compact symmetry group acts in a polar…

To do homological algebra with unbounded chain complexes one needs to first find a way of constructing resolutions. Spaltenstein solved this problem for chain complexes of R-modules by truncating further and further to the left, resolving…

Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…