Related papers: The M\"obius Function on Implication sublattices o…
We consider a scalar-valued implicit function of many variables, and provide two closed formulae for all of its partial derivatives. One formula is based on products of partial derivatives of the defining function, the other one involves…
The aim of this paper is to build a new family of lattices related to some combinatorial extremal sum problems, in particular to a conjecture of Manickam, Mikl\"os and Singhi. We study the fundamentals properties of such lattices and of a…
We establish a Crapo complementation formula for the M\"obius function $\mu^X$ in a general decomposition space $X$ in terms of a convex subspace $K$ and its complement: $\mu^X \simeq \mu^{X\setminus K} + \mu^X*\zeta^K*\mu^X$. We work at…
Estimating nonlinear functionals of probability distributions from samples is a fundamental statistical problem. The "plug-in" estimator obtained by applying the target functional to the empirical distribution of samples is biased.…
It is known that, in general, the coboundary polynomial and the M\"obius polynomial of a matroid do not determine each other. Less is known about more specific cases. In this paper, we will try to answer if it is possible that the M\"obius…
In this paper we classify some special reducts of the countable atomless Boolean algebra which we call functional reducts. We prove that there are exactly $13$ such structures up to first order interdefinability.
An elementary recursive relation for M$\ddot{\mathrm{o}}$bius function $\mu (n)$ is introduced by two simple ways. With this recursive relation, $\mu (n)$ can be calculated without directly knowing the factorization of the $n$. $\mu (1)…
The superamalgamation property is a strong form of the amalgamation property which applies to ordered structures; it has found many applications in algebraic logic. We show that superamalgamation has some interest also from the pure…
We introduce a formal definition of a pattern poset which encompasses several previously studied posets in the literature. Using this definition we present some general results on the M\"obius function and topology of such pattern posets.…
In this note, we discuss a generalization of the well-known implicit function theorem to the time-delay case. We show that the latter problem is closely related to the bicausal changes of coordinates of time-delay systems. An iterative…
We prove that the derivative $\theta'$ of an inner function $\theta$ is outer if and only if $\theta$ is a M\"obius transformation. An alternative characterization involving a reverse Schwarz--Pick type estimate is also given.
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…
Let K be a subset of a smooth manifold M. In some cases functor calculus methods lead to a homotopical formula for M minus K in terms of the subspaces M minus S, where S runs through the finite subsets of K.
We obtain complete characterizations of the Unique Bipartite Perfect Matching function, and of its Boolean dual, using multilinear polynomials over the reals. Building on previous results, we show that, surprisingly, the dual description is…
We introduce a general result relating "short averages" of a multiplicative function to "long averages" which are well understood. This result has several consequences. First, for the M\"obius function we show that there are cancellations…
We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…
We introduce the M\"obius polynomial $ M_n(x) = \sum_{d|n} \mu\left( \frac nd \right) x^d $, which gives the number of aperiodic bracelets of length $n$ with $x$ possible types of gems, and therefore satisfies $M_n(x) \equiv 0$ (mod $n$)…
Hemi-implicative semilattices (lattices), originally defined under the name of weak implicative semilattices (lattices), were introduced by the second author of the present paper. A hemi-implicative semilattice is an algebra…
We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…