Related papers: A relation between additive and multiplicative com…
Given a principal bundle with a connection, we look for an asymptotic expansion of the holonomy of a loop in terms of its length. This length is defined relative to some Riemannian or sub-Riemannian structure. We are able to give an…
We propose an algebraic model of computation which formally relates symbolic listings, complexity of Boolean functions, and low depth arithmetic circuit complexity. In this model algorithms are arithmetic formula expressing symbolic…
We study sets of recurrence, in both measurable and topological settings, for actions of $(\mathbb{N},\times)$ and $(\mathbb{Q}^{>0},\times)$. In particular, we show that autocorrelation sequences of positive functions arising from…
In this paper, we study the abelian complexity of the Rudin-Shapiro sequence and a related sequence. We show that these two sequences share the same complexity function $\rho(n)$ which satisfies certain recurrence relations. As a…
The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of functions whose circuit complexity is…
A monotone Boolean (OR,AND) circuit computing a monotone Boolean function f is a read-k circuit if the polynomial produced (purely syntactically) by the arithmetic (+,x) version of the circuit has the property that for every prime implicant…
We prove a classification of additive polynomial superfunctors, which allows us to compute some extensions of a superfunctor of the form $F \circ A$ where $F$ is a classical polynomial functor and $A$ is additive. We get a formula which…
This paper describes a purely functional library for computing level-$p$-complexity of Boolean functions, and applies it to two-level iterated majority. Boolean functions are simply functions from $n$ bits to one bit, and they can describe…
The asymptotic expansion of $n$-dimensional cyclic integrals was expressed as a series of functionals acting on the symmetric function involved in the cyclic integral. In this article, we give an explicit formula for the action of these…
We show that any multiplicative bijection between the algebras of differentiable functions, defined on differentiable manifolds of positive dimension, is an algebra isomorphism, given by composition with a unique diffeomorphism.
In this paper, we give an elementary proof of the additivity of the functional inverses of the resolvents of large $N$ random matrices, using recently developed matrix model techniques. This proof also gives a very natural generalization of…
Generalized Additive Models (GAMs) are commonly considered *interpretable* within the ML community, as their structure makes the relationship between inputs and outputs relatively understandable. Therefore, it may seem natural to…
A method of estimating sums of multiplicative functions braided with Dirichlet characters is demonstrated, leading to a taxonomy of the characters for which such sums are large.
Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…
The additive energy plays a central role in combinatorial number theory. We show an uncertainty inequality which indicates how the additive energy of support of a Boolean function, its degree and subcube partition are related.
In this paper, we investigate the asymptotics of a class of weighted sums over multiplicative functions and apply our results to deduce a stronger asymptotic form of Yitang Zhang's smoothened GPY sieve with coefficient expressions that are…
Circuit lower bounds are important since it is believed that a super-polynomial circuit lower bound for a problem in NP implies that P!=NP. Razborov has proved superpolynomial lower bounds for monotone circuits by using method of…
Asymptotic expansions are derived for associated Legendre functions of degree $\nu$ and order $\mu$, where one or the other of the parameters is large. The expansions are uniformly valid for unbounded real and complex values of the argument…
Any monotone Boolean circuit computing the $n$-dimensional Boolean convolution requires at least $n^2$ and-gates. This precisely matches the obvious upper bound.
Consider a random polynomial $$ G(z):=\xi_0+\xi_1z+\dots+\xi_nz^n,\quad z\in\mathbb{C}, $$ where $\xi_0,\xi_1,\dots,\xi_{n}$ are independent real-valued random variables with probability density functions $f_0,\dots,f_n$. We give an…