Related papers: Thin Sidon sets and the nonlinearity of vectorial …

The purpose of this paper is to present the extended definitions and characterizations of the classical notions of APN and maximum nonlinear Boolean functions to deal with the case of mappings from a finite group K to another one N with the…

We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of the Euclidean plane we prove an upper bound for their…

The present paper establishes equivalence between uniform rectifiability of the boundary of a domain and the property that the Green function for elliptic operators is well approximated by affine functions (distance to the hyperplanes). The…

We establish vanishing results for limits of characters in various discrete groups, most notably irreducible lattices in higher rank semisimple Lie groups. As an application, we show that any sequence of finite-dimensional representations…

The classification of algebraic vector bundles of rank 2 over smooth affine fourfolds is a notoriously difficult problem. Isomorphism classes of such vector bundles are not uniquely determined by their Chern classes, in contrast to the…

In this paper we formulate and solve extremal problems in the d-dimensional Euclidean space and further in hypergraphs, originating from problems in stoichiometry and elementary linear algebra. The notion of affine simplex is the bridge…

For a line arrangement in the complex projective plane $\mathbb{P}^2$, we investigate the compactification $\overline{F}$ of the affine Milnor fiber in $\mathbb{P}^3$ and its minimal resolution $\widetilde{F}$. We compute the Chern numbers…

A subset $E$ of a discrete abelian group is called $\epsilon $-Kronecker if all $E$-functions of modulus one can be approximated to within $\epsilon$ by characters. $E$ is called a Sidon set if all bounded $E$-functions can be interpolated…

In this article, we study algebraic decompositions and secondary constructions of almost perfect nonlinear (APN) functions. In many cases, we establish precise criteria which characterize when certain modifications of a given APN function…

We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…

This paper investigates stability properties of affine optimal control problems constrained by semilinear elliptic partial differential equations. This is done by studying the so called metric subregularity of the set-valued mapping…

This paper presents generalized Arlery-Tan-Rabaste-Levenshtein lower bounds on the maximum aperiodic ambiguity function (AF) magnitude of unimodular sequences under certain delay-Doppler low ambiguity zones (LAZ). Our core idea is to…

This paper is concerned with convergence estimates for fully discrete tree tensor network approximations of high-dimensional functions from several model classes. For functions having standard or mixed Sobolev regularity, new estimates…

A theorem of Dorronsoro from the 1980s quantifies the fact that real-valued Sobolev functions on Euclidean spaces can be approximated by affine functions almost everywhere, and at all sufficiently small scales. We prove a variant of…

We show that the problem of tiling the Euclidean plane with a finite set of polygons (up to translation) boils down to prove the existence of zeros of a non-negative convex function defined on a finite-dimensional simplex. This function is…

We give an explicit construction of a large subset of F^n, where F is a finite field, that has small intersection with any affine variety of fixed dimension and bounded degree. Our construction generalizes a recent result of Dvir and Lovett…

Finding the maximum size of a Sidon set in $\mathbb{F}_2^t$ is of research interest for more than 40 years. In order to tackle this problem we recall a one-to-one correspondence between sum-free Sidon sets and linear codes with minimum…

Rank-constrained matrix problems appear frequently across science and engineering. The convergence analysis of iterative algorithms developed for these problems often hinges on local error bounds, which correlate the distance to the…

We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…