Related papers: The M\"obius function of the composition poset
We present the poset of Borel congruence classes of anti-symmetric matrices ordered by containment of closures. We show that there exists a bijection between the set of these classes and the set of involutions of the symmetric group. We…
We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…
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…
In these notes we study several categorical generalizations of the M\"obius function and discuss the relations between the various approaches. We emphasize the topological and geometric meaning of these constructions.
In important work on the parity of the partition function, Ono related values of the partition function to coefficients of a certain mock theta function modulo 2. In this paper, we use M\"obius inversion to give analogous results which…
We investigate the internal space of Bessel functions which is associated to the group Z of positive and negative integers defining their orders. As a result we propose and prove a new unifying formula (to be added to the huge literature on…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
A poset is called upper homogeneous (or "upho") if every principal order filter of the poset is isomorphic to the whole poset. We observe that the rank and characteristic generating functions of upho posets are multiplicative inverses of…
Paraorthomodular posets are bounded partially ordered set with an antitone involution induced by quantum structures arising from the logico-algebraic approach to quantum mechanics. The aim of the present work is starting a systematic…
We define the notion of componentwise regularity and study some of its basic properties. We prove an analogue, when working with weight orders, of Buchberger's criterion to compute Gr\"obner bases; the proof of our criterion relies on a…
We give conditions for a locally finite poset $P$ to have the property that for any functions $f:P\to {\bf C}$ and $g:P\to {\bf C}$ not identically zero and linked by the M\"obius inversion formula, the support of at least one of $f$ and…
By using exclusively real analysis, we give explicit estimates of some classical summatory functions involving the M\"obius function.
Let $G$ be the simple group ${\rm PSL}(3,2^p)$, where $p$ is a prime number. For any subgroup $H$ of $G$, we compute the M\"obius function of $H$ in the subgroup lattice of $G$. To this aim, we describe the intersections of maximal…
We derive a generating function for the number of integer compositions of $n$ into $k$ parts (i.e., $k$-compositions of $n$) with a given number of inversions, and obtain similar results for $k$-compositions of $n$ with a given number of…
We obtain a formula for the M\"obius number of the socle of any group. Specifically, the M\"obius number of a direct product of simple groups is computed in terms of the M\"obius numbers of the simple groups which make up the product.
In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…
In $\mathcal L$, the semilattice of faces of an $n$-cube, we count the number of automorphisms of $\mathcal L$ that fix a given subalgebra -- either pointwise or as a subalgebra. By using M\"obius inversion we get a formula for the number…
A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…
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…
We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…