Related papers: Combinatorial Applications of M\"obius Inversion
In this work, we give combinatorial proofs for generating functions of two problems, i.e., flushed partitions and concave compositions of even length. We also give combinatorial interpretation of one problem posed by Sylvester involving…
We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.
George Andrews and Ae Ja Yee recently established beautiful results involving bivariate generalizations of the third order mock theta functions $\omega(q)$ and $\nu(q)$, thereby extending their earlier results with the second author.…
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…
Jacobi's $\theta$ function has numerous applications in mathematics and computer science; a naive algorithm allows the computation of $\theta(z,\tau)$, for $z, \tau$ verifying certain conditions, with precision $P$ in $O(\mathcal{M}(P)…
In this paper, we present new applications of our general minimax theorems. In particular, one of them concerns the multiplicity of global minima for the integral functional of the Calculus of Variations.
We consider the M\"obius function on the poset of element centers and obtain some new results regarding centralizers in a $p$-group.
Partition functions of a canonical ensemble of non-interacting bound electrons are a key ingredient of the super-transition-array approach to the computation of radiative opacity. A few years ago, we published a robust and stable recursion…
We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…
Using a probabilistic approach, we derive several interesting identities involving beta functions. Our results generalize certain well-known combinatorial identities involving binomial coefficients and gamma functions.
We discuss the notion of the orbifold transform, and illustrate it on simple examples. The basic properties of the transform are presented, including transitivity and the exponential formula for symmetric products. The connection with the…
In this paper we revisit the work of E.T. Bell concerning partition polynomials in order to introduce the reciprocal partition polynomials. We give their explicit formulas and apply the result to compute closed formulae for some well-known…
We study M(n), the number of distinct values taken by multinomial coefficients with upper entry n, and some closely related sequences. We show that both pP(n)/M(n) and M(n)/p(n) tend to zero as n goes to infinity, where pP(n) is the number…
For the classical space of functions with bounded mean oscillation, it is well known that VMO** = BMO and there are many characterizations of the distance from a function f in BMO to VMO. When considering the Bloch space, results in the…
Multivariate orthogonal polynomials can be introduced by using a moment functional defined on the linear space of polynomials in several variables with real coefficients. We study the so-called Uvarov and Christoffel modifications obtained…
We use a q-series identity by Ramanujan to give a combinatorial interpretation of Ramanujan's tau function which involves t-cores and a new class of partitions which we call (m,k)-capsids. The same method can be applied in conjunction with…
We study the projective derivative as a cocycle of M\"obius transformations over groups of circle diffeomorphisms. By computing precise expressions for this cocycle, we obtain several results about reducibility and almost reducibility to a…
An alternative to the matrix inverse procedure is presented. Given a bit register which is arbitrarily large, the matrix inverse to an arbitrarily large matrix can be peformed in ${\cal O}(N^2)$ operations, and to matrix multiplication on a…
Embedding Calculus, as described by Weiss, is a calculus of functors, suitable for studying contravariant functors from the poset of open subsets of a smooth manifold M, denoted O(M), to a category of topological spaces (of which the…
Orthogonally invariant functions of symmetric matrices often inherit properties from their diagonal restrictions: von Neumann's theorem on matrix norms is an early example. We discuss the example of "identifiability", a common property of…