Related papers: On the normality of Boolean quartics
Suppose that f is a boolean function from F_2^n to {0,1} with spectral norm (that is the sum of the absolute values of its Fourier coefficients) at most M. We show that f may be expressed as +/- 1 combination of at most 2^(2^(O(M^4)))…
We present the complete set of universal one-loop beta functions of cubic gravity in six dimensions. The system admits over 8000 distinct fixed points, of which more than 200 are real. Some of them might be relevant for the quantisation of…
We ask whether most Boolean functions are determined by their low frequencies. We show a partial result: for almost every function $f: \{-1,1\}^p \to \{-1,1\}$ there exists a function $f': \{-1,1\}^p \to (-1,1)$ that has the same…
The problem of obtaining a gauge independent beta function for Newton's constant is addressed. By a specific parameterisation of metric fluctuations a gauge independent functional integral is constructed for the semiclassical theory around…
Monotone Boolean functions (MBFs) are Boolean functions $f: {0,1}^n \rightarrow {0,1}$ satisfying the monotonicity condition $x \leq y \Rightarrow f(x) \leq f(y)$ for any $x,y \in {0,1}^n$. The number of MBFs in n variables is known as the…
We say that a random vector $X=(X_1,...,X_n)$ in $R^n$ is an $n$-dimensional version of a random variable $Y$ if for any $a\in R^n$ the random variables $\sum a_iX_i$ and $\gamma(a) Y$ are identically distributed, where $\gamma:R^n\to…
We argue that in general renormalizable field theories the topological angles may develop an additive beta function starting no earlier than 2-loop order. The leading expression is uniquely determined by a single model-independent…
We prove that there is a constant $C\leq 6.614$ such that every Boolean function of degree at most $d$ (as a polynomial over $\mathbb{R}$) is a $C\cdot 2^d$-junta, i.e. it depends on at most $C\cdot 2^d$ variables. This improves the $d\cdot…
We study in detail the application of renormalisation theory to models of cluster aggregation and fragmentation of relevance to nucleation and growth processes. In particular, we investigate the Becker-Doring (BD) equations, originally…
We study a natural complexity measure of Boolean functions known as the rational degree. Denoted $\textrm{rdeg}(f)$, it is the minimal degree of a rational function that is equal to $f$ on the Boolean hypercube. For total functions $f$, it…
We study the beta functions for four-dimensional conformal gravity using two different parametrizations of metric fluctuation, linear split and exponential parametrization. We find that after imposing the traceless conditions, the beta…
Let $F$ be a vectorial Boolean function from $\mathbb{F}_2^n$ to $\mathbb{F}_2^m$, with $m \geq n$. We define $F$ as an embedding if $F$ is injective. In this paper, we examine the component functions of $F$, focusing on constant and…
Boolean functions can be represented in many ways including logical forms, truth tables, and polynomials. Additionally, Boolean functions have different canonical representations such as minimal disjunctive normal forms. Other canonical…
Based on the definition of generalized partially bent functions, using the theory of linear transformation, the relationship among generalized partially bent functions over ring Z N, generalized bent functions over ring Z N and affine…
Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…
We prove density of smooth functions in subspaces of Sobolev- and higher order $BV$-spaces of kind $W^{m,p}(\Omega)\cap L^q(\Omega-D)$ and $BV^m(\Omega)\cap L^q(\Omega-D)$, respectively, where $\Omega\subset\mathbb{R}^n$ ($n\in\mathbb{N}$)…
Statistical inferences for quadratic functionals of linear regression parameter have found wide applications including signal detection, global testing, inferences of error variance and fraction of variance explained. Classical theory based…
The theorem states that: Every Boolean function can be $\epsilon -approximated$ by a Disjunctive Normal Form (DNF) of size $O_{\epsilon}(2^{n}/\log{n})$. This paper will demonstrate this theorem in detail by showing how this theorem is…
We establish the first partial regularity results for (strongly) symmetric quasiconvex functionals of linear growth on BD, the space of functions of bounded deformation. By Rindler's foundational work (Lower semicontinuity for integral…
Understanding the inductive bias of neural networks is critical to explaining their ability to generalise. Here, for one of the simplest neural networks -- a single-layer perceptron with n input neurons, one output neuron, and no threshold…