Related papers: FKN, first proof, rewritten

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…

Despite their power, Transformers face challenges with long sequences due to the quadratic complexity of self-attention. To address this limitation, methods like $k$-Nearest-Neighbor ($k$NN) attention have been introduced [Roy, Saffar,…

We investigate the consistency requirements of the next-to leading BFKL equation with the renormalization group, with particular emphasis on running coupling effects and NL anomalous dimensions. We show that, despite some model dependence…

In this paper a new class of radial basis functions based on hyperbolic trigonometric functions will be introduced and studied. We focus on the properties of their generalised Fourier transforms with asymptotics. Therefore we will compute…

Given two positive integers n,r, we define the Gaudin function of level r to be quotient of the numerator of the determinant det(1/ ((x_i-y_j)(x_i-ty_j) ... (x_i-t^r y_j)), i,j=1..n, by the two Vandermonde in x and y. We show that it can be…

The results of LO {\it Fixed point} QCD (FP-QCD) analysis of the CCFR data for the nucleon structure function $~xF_3(x,Q^2)~$ are presented. The predictions of FP-QCD, in which the Callan-Symanzik $~\beta~$ function admits a {\it second…

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…

The function f:X -> Y is called k-monotonically increasing if there is a partition X = X_1 U ... U X_k such that f|X_i : X_i -> Y is monotonically increasing for i=1,...,k. It is proved that a one-to-one function f:N -> N is k-monotonically…

Let $\{f_i:\mathbb{F}_p^i \to \{0,1\}\}$ be a sequence of functions, where $p$ is a fixed prime and $\mathbb{F}_p$ is the finite field of order $p$. The limit of the sequence can be syntactically defined using the notion of ultralimit.…

Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…

A Boolean function is called read-once over a basis B if it can be expressed by a formula over B where no variable appears more than once. A checking test for a read-once function f over B depending on all its variables is a set of input…

On a cyclic group of prime order, the non-trivial Dirichlet characters together with their Fourier transforms have constant modulus outside 0 and vanish at 0. Answering a question of H. Cohn, we construct new functions with these…

We study the question of Eulerianity (factorizability) for Fourier coefficients of automorphic forms, and we prove a general transfer theorem that allows one to deduce the Eulerianity of certain coefficients from that of another…

We give a new proof of the Hansen-Mullen irreducibility conjecture. The proof relies on an application of a (seemingly new) sufficient condition for the existence of elements of degree $n$ in the support of functions on finite fields. This…

A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

This article presents a reformulation of the Theory of Functional Connections: a general methodology for functional interpolation that can embed a set of user-specified linear constraints. The reformulation presented in this paper exploits…

The spectral norm of a Boolean function $f:\{0,1\}^n \to \{-1,1\}$ is the sum of the absolute values of its Fourier coefficients. This quantity provides useful upper and lower bounds on the complexity of a function in areas such as learning…

Two classes of ternary bent functions of degree four with two and three terms in the univariate representation that belong to the completed Maiorana-McFarland class are found. Binomials are mappings $\F_{3^{4k}}\mapsto\fthree$ given by…

In this work we verify the sufficiency of a Jensen's necessary and sufficient condition for a class of genus 0 or 1 entire functions to have only real zeros. They are Fourier transforms of even, positive, indefinitely differentiable, and…