Related papers: A new large class of functions not APN infinitely …

The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean…

We prove that generalized exponential splitting methods making explicit use of commutators of the vector fields are limited to order four when only real coefficients are admitted. This generalizes the restriction to order two for classical…

A classical result of Rothschild and van Lint asserts that if every non-zero Fourier coefficient of a Boolean function $f$ over $\mathbb{F}_2^{n}$ has the same absolute value, namely $|\hat{f}(\alpha)|=1/2^k$ for every $\alpha$ in the…

We show that there exists an entire function without finite asymptotic values for which the associated Newton function tends to infinity in some invariant domain. The question whether such a function exists had been raised by Douady.

In this paper we compute the Fourier spectra of some recently discovered binomial APN functions. One consequence of this is the determination of the nonlinearity of the functions, which measures their resistance to linear cryptanalysis.…

In this paper we generalize the partial spread class and completely describe it for generalized Boolean functions from $\F_2^n$ to $\mathbb{Z}_{2^t}$. Explicitly, we describe gbent functions from $\F_2^n$ to $\mathbb{Z}_{2^t}$, which can be…

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

We give an infinite family of monoids $\Pi_N$ (for $N=2, 3, \dots$), each with a single defining relation of the form $bUa = a$, such that the Dehn function of $\Pi_N$ is at least exponential. More precisely, we prove that the Dehn function…

In the context of second-order polynomial-time computability, we prove that there is no general function space construction. We proceed to identify restrictions on the domain or the codomain that do provide a function space with…

For every natural number k we introduce the notion of k-th order convolution of functions on abelian groups. We study the group of convolution preserving automorphisms of function algebras in the limit. It turns out that such groups have…

We give a geometric characterization of vectorial boolean functions with differential uniformity less or equal to 4.

We show that the category of $n$-excisive functors from the $\infty$-category of spectra to a target stable $\infty$-category $\mathbf{E}$ is equivalent to the category of $\mathbf{E}$-valued Mackey functors on an indexing category built…

Solution of Monge equation of arbitrary degree (non linear differential equation n-orden) is connected with solution of functional equation for 4 functions with 4 different arguments. Some number solutions of this equation is represented in…

A burgeoning line of research leverages deep neural networks to approximate the solutions to high dimensional PDEs, opening lines of theoretical inquiry focused on explaining how it is that these models appear to evade the curse of…

We continue the investigation of Boolean-like algebras of dimension n (nBA) having n constants e1,...,en, and an (n+1)-ary operation q (a "generalised if-then-else") that induces a decomposition of the algebra into n factors through the…

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

We consider Gomory and Johnson's infinite group model with a single row. Valid inequalities for this model are expressed by valid functions and it has been recently shown that any valid function is dominated by some nonnegative valid…

In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems, showed that all these problems are either in P or NP-complete, and gave a…

It is well known that the Bernoulli polynomials $\mathbf{B}_n(x)$ have nonintegral coefficients for $n \geq 1$. However, ten cases are known so far in which the derivative $\mathbf{B}'_n(x)$ has only integral coefficients. One may assume…

Let $V$ be a vector space over a field $k, P:V\to k, d\geq 3$. We show the existence of a function $C(r,d)$ such that $rank (P)\leq C(r,d)$ for any field $k,char (k)>d$, a finite-dimensional $k$-vector space $V$ and a polynomial $P:V\to k$…