Related papers: A Note on Vectorial Boolean Functions as Embedding…

We study the $n$-variable Boolean functions which keep their algebraic degree unchanged when they are restricted to any (affine) hyperplane, or more generally to any affine space of a given co-dimension $k$. For cryptographic applications…

Decision Diagrams(DDs) are one of the most popular representations for boolean functions. They are widely used in the design and verification of circuits. Different types of DDs have been proven to represent important functions in…

We present a set of explicit trial wavefunctions for the filling factors \nu=n/(2n\pm 1) and \nu=1/2 in the symmetric gauge. We show that the zeroes of the wavefunction, except those dictated by the Fermi statistics, are detached from the…

Consider a very ample line bundle $ E \to X$ over a compact complex manifold, endowed with a hermitian metric of curvature $-i \omega $, and the space $\mathcal{O}(E)$ of its holomorphic sections. The Fubini--Study map associates with…

Partial combinatory algebras are algebraic structures that serve as generalized models of computation. In this paper, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene's models, of…

We prove that functions $f:\f{2^m} \to \f{2^m}$ of the form $f(x)=x^{-1}+g(x)$ where $g$ is any non-affine polynomial are APN on at most a finite number of fields $\f{2^m}$. Furthermore we prove that when the degree of $g$ is less then 7…

We study combinatorial properties of plateaued functions $F \colon \mathbb{F}_p^n \rightarrow \mathbb{F}_p^m$. All quadratic functions, bent functions and most known APN functions are plateaued, so many cryptographic primitives rely on…

A function $\varphi:\{0,1\}^n \to \{0,1\}^N$ is called an isometric embedding of the $n$-dimensional Hamming metric space to the $N$-dimensional edit metric space if, for all $x,y\in\{0,1\}^n$, the Hamming distance between $x$ and $y$ is…

Dillon-like Boolean functions are known, in the literature, to be those trace polynomial functions from $\mathbb{F}_{2^{2n}}$ to $\mathbb{F}_{2}$, with all the exponents being multiples of $2^n-1$ often called Dillon-like exponents. This…

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

We investigate estimating scalar oscillatory integrals by integrating by parts in directions based on $(x_1 \partial_{x_1} f(x) ,..., x_n \partial_{x_n}f(x))$, where $f(x)$ is the phase function. We prove a theorem which provides estimates…

The necessary and sufficient conditions for a class of functions $f:\mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$, where $q \geq 2$ is an even positive integer, have been recently identified for $q=4$ and $q=8$. In this article we give an…

We consider the imbedding inequality || f ||_{L^r(R^d)} <= S_{r,n,d} || f ||_{H^{n}(R^d)}; H^{n}(R^d) is the Sobolev space (or Bessel potential space) of L^2 type and (integer or fractional) order n. We write down upper bounds for the…

Deformable elastic bodies in viscous and viscoelastic media constitute a large portion of synthetic and biological complex fluids. We present a parallelized 3D-simulation methodology which fully resolves the momentum balance in the solid…

For a topological space $X$ we study continuous maps $f : X\to \mathbb R^m$ such that images of every pairwise distinct $k$ points are affinely (linearly) independent. Such maps are called affinely (linearly) $k$-regular embeddings. We…

We call a function $f$ in $C(X)$ to be hard-bounded if $f$ is bounded on every hard subset, a special kind of closed subset, of $X$. We call a subset $T$ of $X$ to be $S$-embedded if every hard-bounded continuous function of $T$ can be…

Recent advances in convex optimization have led to new strides in the phase retrieval problem over finite-dimensional vector spaces. However, certain fundamental questions remain: What sorts of measurement vectors uniquely determine every…

The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai [FK96] seeks to relate two fundamental measures of Boolean function complexity: it states that $H[f] \leq C Inf[f]$ holds for every Boolean function $f$, where $H[f]$…

We assess whether a confined Wigner molecule constituted by $2N$ fermions behaves as $N$ bosons or $2N$ fermions. Following the work by C. K. Law [Phys. Rev. A \textbf{71}, 034306 (2005)] and Chudzicki et al. [Phys. Rev. Lett. \textbf{104},…

Secure multi-party computation using a physical deck of cards, often called card-based cryptography, has been extensively studied during the past decade. Card-based protocols to compute various Boolean functions have been developed. As each…