Related papers: On the computation of the M{\"o}bius transform

Fourier analysis on the Boolean hypercube is fundamentally defined as the orthogonal decomposition of the space of pseudo-Boolean functions with respect to the uniform probability measure. In this work, we propose an ANOVA-based…

Let $\mathbb{M}(\mathbb{S}^{n+1})$ denote the M\"{o}bius transformation group of the $(n+1)$-dimensional sphere $\mathbb{S}^{n+1}$. A hypersurface $x:M^n\to \mathbb{S}^{n+1}$ is called a M\"{o}bius homogeneous hypersurface if there exists a…

We prove an important property of the binomial transform: it converts multiplication by the discrete variable into a certain difference operator. We also consider the case of dividing by the discrete variable. The properties presented here…

The Eulerian transformation is the linear operator on polynomials in one variable with real coefficients which maps the powers of this variable to the corresponding Eulerian polynomials. The derangement transformation is defined similarly.…

We prove the existence of a unitary transformation that enables two arbitrarily given Hamiltonians in the same Hilbert space to be transformed into one another. The result is straightforward yet, for example, it lays the foundation to…

Normal multi-scale transform [4] is a nonlinear multi-scale transform for representing geometric objects that has been recently investigated [1, 7, 10]. The restrictive role of the exact order of polynomial reproduction $P_e$ 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…

Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…

In this paper, we focus on the links between Boolean function theory and quantum computing. In particular, we study the notion of what we call fully-balanced functions and analyse the Fourier--Hadamard and Walsh supports of those functions…

M\"obius inversion and Shapley values are two mathematical tools for characterizing and decomposing higher-order structure in complex systems. The former defines higher-order interactions as discrete derivatives over a partial order; the…

A fast Fourier transform method for computing the weight enumerator polynomial and trigonometric degree of lattice rules is introduced.

We consider the problem of computing the Boolean convolution (with wraparound) of $n$~vectors of dimension $m$, or, equivalently, the problem of computing the sumset $A_1+A_2+\ldots+A_n$ for $A_1,\ldots,A_n \subseteq \mathbb{Z}_m$. Boolean…

A space of entire functions of several complex variables rapidly decreasing on ${\mathbb R}^n$ and such that their growth along $i{\mathbb R}^n$ is majorized with a help of a family of weight functions (not radial in general) is considered…

In this paper we investigate the problem of quantifying the contribution of each variable to the satisfying assignments of a Boolean function based on the Shapley value. Our main result is a polynomial-time equivalence between computing…

The purpose of this paper is twofold. In the first part we concentrate on hyperplane sections of algebraic schemes, and present results for determining when Gr\"obner bases pass to the quotient and when they can be lifted. The main…

We establish nontrivial bounds for bilinear sums involving the M\"obius function evaluated over solutions to a broad class of equations. Several of our results may be regarded as M\"obius-function analogues of the ternary Goldbach problem.…

We study the quantum query complexity of the Boolean hidden shift problem. Given oracle access to f(x+s) for a known Boolean function f, the task is to determine the n-bit string s. The quantum query complexity of this problem depends…

The estimation of large covariance matrices has a high dimensional bias. Correcting for this bias can be reformulated via the tool of Free Probability Theory as a free deconvolution. The goal of this work is a computational and statistical…

Methods of solving big Boolean equations can be broadly classified as algebraic, tabular, numerical and map methods. The most prominent among these classes are the algebraic and map methods. This paper surveys and compares these two types…

Given a parametrised weight function $\omega(x,\mu)$ such that the quotients of its consecutive moments are M\"obius maps, it is possible to express the underlying biorthogonal polynomials in a closed form \cite{IN2}. In the present paper…