Related papers: An Introduction to the Moebius Function
Moebius number systems represent points using sequences of Moebius transformations. Thorough the paper, we are mainly interested in representing the unit circle (which is equivalent to representing R\cup\{\infty\}). The main aim of the…
We give a short proof of "Pellet's Formula" for the M\"{o}bius Function on $\mathbb{F}_q[T]$, deriving an intermediate formula (which we call "Proto-Pellet's Formula") along the way. We then construct and prove an analogous "Proto-Pellet's…
Kim, Kim, and Neggers (2019) defined probability functions on a poset, by listing some very natural conditions that a function \(\pi: P \times P \to [0,1]\) should satisfy in order to capture the intuition of "the likelihood that \(a\)…
Transit functions were introduced as models of betweenness on undirected structures. Here we introduce directed transit function as the directed analogue on directed structures such as posets and directed graphs. We first show that…
We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e.,…
This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…
We introduce persistence with an emphasis on its algebraic foundations, using the representation theory of posets. Linear representations of posets arise in several areas of mathematics, including the representation theory of quivers and…
We present the M\"{o}bius functions of several posets of annular noncrossing objects, namely a self-dual extension of the annular noncrossing permutations, minimal length annular partitioned permutations, and annular noncrossing partitons.
This paper shows how to construct a discrete Morse function with a relatively small number of critical cells for the order complex of any finite poset with $\hat{0} $ and $\hat{1}$ from any lexicographic order on its maximal chains.…
We study in general algebras Gratzer's notion of congruence preserving function, characterizing functions in terms of stability under inverse image of particular Boolean algebras of subsets generated from any subset of the algebra.…
There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of parking functions a poset whose Hasse diagram is the union of…
We initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering…
The aim of this paper is to classify order-preserving functions according to their arity gap. Noteworthy examples of order-preserving functions are so-called aggregation functions. We first explicitly classify the Lov\'asz extensions of…
We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its…
We study higher order quantum maps in the context of a *-autonomous category of affine subspaces. We show that types of higher order maps can be identified with certain Boolean functions that we call type functions. By an extension of this…
This work proposes an alternative approach to the so-called lattice of embedded subsets, which is included in the product of the subset and partition lattices of a finite set, and whose elements are pairs consisting of a subset and a…
We develop a new method to compute the homology groups of finite topological spaces (or equivalently of finite partially ordered sets) by means of spectral sequences giving a complete and simple description of the corresponding…
We define a birational map between labelings of a rectangular poset and its associated trapezoidal poset. This map tropicalizes to a bijection between the plane partitions of these posets of fixed height, giving a new bijective proof of a…
We study several aspects of the M\"{o}bius function, $\mu[\sigma,\pi]$, on the poset of permutations under the pattern containment order. First, we consider cases where the lower bound of the poset is indecomposable. We show that…
The M\"obius function of the subgroup lattice of a finite group has been introduced by Hall and applied to investigate several questions. In this paper, we consider the M\"obius function defined on an order ideal related to the lattice of…