13,012 research outputs found
The graph of minimal distances of bent functions and its properties
A notion of the graph of minimal distances of bent functions is introduced. It is an undirected graph (, ) where is the set of all bent functions in variables and if the Hamming distance between and is equal to (it is the minimal possible distance between two different bent functions). The maximum degree of the graph is obtained and it is shown that all its vertices of maximum degree are quadratic. It is proven that a subgraph of the graph induced by all functions affinely equivalent to Maiorana---McFarland bent functions is connected
Properties of Ridges in Elastic Membranes
When a thin elastic sheet is confined to a region much smaller than its size
the morphology of the resulting crumpled membrane is a network of straight
ridges or folds that meet at sharp vertices. A virial theorem predicts the
ratio of the total bending and stretching energies of a ridge. Small strains
and curvatures persist far away from the ridge. We discuss several kinds of
perturbations that distinguish a ridge in a crumpled sheet from an isolated
ridge studied earlier (A. E. Lobkovsky, Phys. Rev. E. 53 3750 (1996)). Linear
response as well as buckling properties are investigated. We find that quite
generally, the energy of a ridge can change by no more than a finite fraction
before it buckles.Comment: 13 pages, RevTeX, acknowledgement adde
On metric complements and metric regularity in finite metric spaces
This review deals with the metric complements and metric regularity in the Boolean cube and in arbitrary finite metric spaces. Let A be an arbitrary subset of a finite metric space M, and A be the metric complement of A — the set of all points of M at the maximal possible distance from A. If the metric complement of the set A coincides with A, then the set A is called a metrically regular set. The problem of investigating metrically regular sets was posed by N. Tokareva in 2012 when studying metric properties of bent functions, which have important applications in cryptography and coding theory and are also one of the earliest examples of a metrically regular set. In this paper, main known problems and results concerning the metric regularity are overviewed, such as the problem of finding the largest and the smallest metrically regular sets, both in the general case and in the case of fixed covering radius, and the problem of obtaining metric complements and establishing metric regularity of linear codes. Results concerning metric regularity of partition sets of functions and Reed — Muller codes are presented
Low-degree tests at large distances
We define tests of boolean functions which distinguish between linear (or
quadratic) polynomials, and functions which are very far, in an appropriate
sense, from these polynomials. The tests have optimal or nearly optimal
trade-offs between soundness and the number of queries.
In particular, we show that functions with small Gowers uniformity norms
behave ``randomly'' with respect to hypergraph linearity tests.
A central step in our analysis of quadraticity tests is the proof of an
inverse theorem for the third Gowers uniformity norm of boolean functions.
The last result has also a coding theory application. It is possible to
estimate efficiently the distance from the second-order Reed-Muller code on
inputs lying far beyond its list-decoding radius
- …