Related papers: On a classification of planar functions in charact…
In the context of isogeometric analysis, globally $C^1$ isogeometric spaces over unstructured quadrilateral meshes allow the direct solution of fourth order partial differential equations on complex geometries via their Galerkin…
The only known example of an almost perfect nonlinear (APN) permutation in even dimension was obtained by applying CCZ-equivalence to a specific quadratic APN function. Motivated by this result, there have been numerous recent attempts to…
Two important problems on almost perfect nonlinear (APN) functions are the enumeration and equivalence problems. In this paper, we solve these two problems for any biprojective APN function family by introducing a strong group theoretic…
The two function theories of monogenic and of slice monogenic functions have been extensively studied in the literature and were developed independently; the relations between them, e.g. via Fueter mapping and Radon transform, have been…
Using Stickelberger's theorem on Gauss sums, we show that if $F$ is a planar function on a finite field $\mathbb{F}_q$, then for all non-zero functions $G : \mathbb{F}_q \to \mathbb{F}_q$, we have \begin{equation*} d_{\mathsf{alg}}(G \circ…
We study rank functions on a triangulated category $\mathcal{C}$ via its abelianisation $\operatorname{mod}\mathcal{C}$. We prove that every rank function on $\mathcal{C}$ can be interpreted as an additive function on…
It is known that crooked functions can be used to construct many interesting combinatorial objects, and a quadratic function is crooked if and only if it is almost perfect nonlinear (APN). In this paper, we introduce two infinite classes of…
We prove that asymptotically almost all vectorial functions over finite fields have trivial extended-affine stabilizers. As a consequence, the number of EA-equivalence classes is asymptotically equal to the naive estimate, namely the total…
In this paper we study a new family of sinc--like functions, defined on an interval of finite width. These functions, which we call ``little sinc'', are orthogonal and share many of the properties of the sinc functions. We show that the…
The knowledge of the isotropic correlation function of a plane figure is useful to determine the correlation function of the cylinders having the plane figure as right-section and a given height as well as to analyze the out of plane…
The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph admits a planar drawing such that the clusters can be nicely represented by regions. We introduce the cd-tree data structure and give a new…
We exhibit a strong connection between the matchgate formalism introduced by Valiant and the ZW-calculus of Coecke and Kissinger. This connection provides a natural compositional framework for matchgate theory as well as a direct…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
In this paper, we develop and study approximately smooth basis constructions for isogeometric analysis over two-patch domains. One key element of isogeometric analysis is that it allows high order smoothness within one patch. However, for…
An explicit invariant-theoretic description of the moduli space $\mathcal{M}_3^1$ of degree-three rational maps on $\mathbb{P}^1$ is developed. A cubic map $\phi$ is represented, up to conjugation, by the pair of binary forms $(f, g) \in…
We derive an exact path integral formulation for the partition function for the Ising model using a mapping between spins and poles of a Laurent expansion for a field on the complex plane. The advantage in using this formulation for the…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
We prove that every triconnected planar graph is definable by a first order sentence that uses at most 15 variables and has quantifier depth at most $11\log_2 n+43$. As a consequence, a canonic form of such graphs is computable in $AC^1$ by…
This paper has two goals: to present some new results that are necessary for further study and applications of quasi-linear functionals, and, by combining known and new results, to serve as a convenient single source for anyone interested…