相关论文: On the computation of the M{\"o}bius transform
Let (G, V) be a prehomogeneous vector space, let O be any G(F_q)-invariant subset of V(F_q), and let f be the characteristic function of O. In this paper we develop a method for explicitly and efficiently evaluating the Fourier transform of…
Let M denote the space of Borel probability measures on the real line. For every nonnegative t we consider the transformation $\mathbb B_t : M \to M$ defined for any given element in M by taking succesively the the (1+t) power with respect…
We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set of rational-valued functions, which generalize constraints.…
Quantum information processing requires a high degree of isolation from the detrimental effects of the environment as well as an extremely precise level of control on the way quantum dynamics unfolds in the information-processing system. In…
A set of exactly computable orthonormal basis functions that are useful in computations involving constituent quarks is presented. These basis functions are distinguished by the property that they fall off algebraically in momentum space…
We explore the use of bi-orthogonal basis for continuous wavelet transformations, thus relaxing the so-called admissibility condition on the analyzing wavelet. As an application, we determine the eigenvalues and corresponding radial…
We explore the use of bi-orthogonal basis for continuous wavelet transformations, thus relaxing the so-called admissibility condition on the analyzing wavelet. As an application, we determine the eigenvalues and corresponding radial…
The homogeneous weights and the M\"obius functions and Euler phi-functions on finite rings are discussed; some computational formulas for these functions on finite principal ideal rings are characterized; for the residue rings of integers,…
Attempts to separate the power of classical and quantum models of computation have a long history. The ultimate goal is to find exponential separations for computational problems. However, such separations do not come a dime a dozen: while…
The process of replacing an arbitrary Boolean function by a bijective one, a fundamental tool in reversible computing and in cryptography, is interpreted algebraically as a particular instance of a certain group homomorphism from the X-fold…
We consider the algebras $M_p$ of Fourier multipliers and show that every bounded continuous function $f$ on $\mathbb R^d$ can be transformed by an appropriate homeomorphic change of variable into a function that belongs to $M_p(\mathbb…
This paper describes an extension of Fourier approximation methods for multivariate functions defined on the torus $\mathbb{T}^d$ to functions in a weighted Hilbert space $L_{2}(\mathbb{R}^d, \omega)$ via a multivariate change of variables…
The problem of finding weight matrices $W(x)$ of size $N \times N$ such that the associated sequence of matrix-valued orthogonal polynomials are eigenfunctions of a second-order matrix differential operator is known as the Matrix Bochner…
We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an…
A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…
Machine learning (ML) methods offer a wide range of configurable hyperparameters that have a significant influence on their performance. While accuracy is a commonly used performance objective, in many settings, it is not sufficient.…
Here we show, in the second paper in a series of articles, methods to calculate propositional statements with algebraic polyno mials as symbols for the connectives, which here are named operators. In the first article, we explained this…
A polynomial transformation of the real plane $\Bbb R^2$ is a mapping $\Bbb R^2\to\Bbb R^2$ given by two polynomials of two variables. Such a transformation is called cubic if the degrees of its polynomials are not greater than three. It…
Eulerian polynomials are fundamental in combinatorics and algebra. In this paper we study the linear transformation $\mathcal{A} : \mathbb{R}[t] \to \mathbb{R}[t]$ defined by $\mathcal{A}(t^n) = A_n(t)$, where $A_n(t)$ denotes the $n$-th…
Dominant areas of computer science and computation systems are intensively linked to the hypercube-related studies and interpretations. This article presents some transformations and analytics for some example algorithms and Boolean domain…