Related papers: Direct Sum Testing: The General Case
Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…
In recent work, we derived a direct expression for one-loop tensor reduction using generating functions and Feynman parametrization in projective space, avoiding recursive relations. However, for practical applications, this expression…
Sufficient conditions are given for a hard implicit function theorem to hold. The result is established by an application of the Dynamical Systems Method (DSM). It allows one to solve a class of nonlinear operator equations in the case when…
In this paper we show that functions of the form $\prod_{n\ge1}\frac{1}{\left(1+\frac{x^{2}}{a_{n}^{2}}\right)}$ where $a_{n}>0$ and $\sum_{n\ge1}\frac{1}{a_{n}^{2}}<\infty$ are in the Schwartz space of the real line, answering a question…
It is demonstrated how an explicit expression of the (partial) sum of Tetranacci numbers can be found and proved using generating functions and the Hadamard product. We also provide a Binet-type formula for generalized Fibonacci numbers, by…
Given a boolean n by n matrix A we consider arithmetic circuits for computing the transformation x->Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative…
The study of derivations and their generalizations on non-associative algebras has proven to be fundamental in understanding the internal symmetries and algebraic dynamics of such structures. In this paper, we investigate derivations and…
We establish a calculus of differences for taut endofunctors of the category of sets, analogous to the classical calculus of finite differences for real valued functions. We study how the difference operator interacts with limits and…
In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean function is given by the function $f$ on $n=2^k$ bits defined by a complete binary tree…
Indicator functions mentioned in the title are constructed on an arbitrary nondiscrete locally compact Abelian group of finite dimension. Moreover, they can be obtained by small perturbation from any indicator function fixed beforehand. In…
The starting point of this work is that the class of evolution algebras over a fixed field is closed under tensor product. This arises questions about the inheritance of properties from the tensor product to the factors and conversely. For…
Sums of independent random variables form the basis of many fundamental theorems in probability theory and statistics, and therefore, are well understood. The related problem of characterizing products of independent random variables seems…
Let $n$ be a positive integer and $f$ a differentiable function from a convex subset $C$ of the Euclidean space $\mathbb{R}^n$ to a smooth manifold. We define an invariant of $f$ via counting certain threshold functions associated to $f$.…
We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…
Consider a pair of elements $f$ and $g$ in a commutative ring $Q$. Given a matrix factorization of $f$ and another of $g$, the tensor product of matrix factorizations, which was first introduced by Kn\"orrer and later generalized by…
Bernstein's theorem (also called Hausdorff--Bernstein--Widder theorem) enables the integral representation of a completely monotonic function. We introduce a finite completely monotonic function, which is a completely monotonic function…
An efficient coordinate-free notation is elucidated for differentiating matrix expressions and other functions between higher-dimensional vector spaces. This method of differentiation is known, but not explained well, in the literature.…
We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between…
We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…
Higher order derivatives of functions are structured high dimensional objects which lend themselves to many alternative representations, with the most popular being multi-index, matrix and tensor representations. The choice between them…