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

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit? We argue that this question is certainly difficult.…

Assuming the Generalised Riemann Hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in $\MA$ having no arithmetic circuits of size O(n^k) over the complex field (allowing any complex constant). We also build…

We present the first complete (i.e., ambiguity-free) derivation of the equations of motion of two non-spinning compact objects up to the 4PN order, based on the Fokker action of point particles in harmonic coordinates. The last ambiguity…

We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the…

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…

We study the Dehn function at infinity in the mapping class group, finding a polynomial upper bound of degree four. This is the same upper bound that holds for arbitrary right-angled Artin groups.

We provide the reader with a (very) short review of recent advances in our understanding of the $\pi$-dependent terms in massless (Euclidean) 2-point functions as well as in generic anomalous dimensions and $\beta$-functions. We extend the…

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Boolean functions are mathematical objects used in diverse applications. Different applications also have different requirements, making the research on Boolean functions very active. In the last 30 years, evolutionary algorithms have been…

It is known that the Principal Poincar\'e Pontryagin Function is generically an Abelian integral. We give a sufficient condition on monodromy to ensure that it is an Abelian integral also in non generic cases. In non generic cases it is an…

We show that, in general, over a regular integral noetherian affine scheme X of dimension at least 6, there exist Brauer classes on X for which the associated division algebras over the generic point have no Azumaya maximal orders over X.…

Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…

This is the continuation of the article by the author that proves a broader class of families admitting the theorem of restriction of sections other than Abelian varieties and gives new examples of pseudo-N\'eron models. In this work, we…

We study the Lane-Emden conjecture, which asserts the non-existence of non-trivial, non-negative solutions to the Lane-Emden system \[ -\Delta u = v^p, \quad -\Delta v = u^q, \quad x \in \mathbb{R}^n\] in the subcritical regime. By…

We prove the existence of nontrivial unbounded exceptional domains in the Euclidean space $\R^N$, $N\geq4$. These domains arise as perturbations of complements of straight cylinders in $\R^N$, and by definition they support a positive…

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…

Let $p$ be a fixed prime number, and $N$ be a large integer. The 'Inverse Conjecture for the Gowers norm' states that if the "$d$-th Gowers norm" of a function $f:\F_p^N \to \F_p$ is non-negligible, that is larger than a constant…

We prove an average-case depth hierarchy theorem for Boolean circuits over the standard basis of $\mathsf{AND}$, $\mathsf{OR}$, and $\mathsf{NOT}$ gates. Our hierarchy theorem says that for every $d \geq 2$, there is an explicit…