English
Related papers

Related papers: On minimal distance between q-ary bent functions

200 papers

The Hamming graph $H(n,q)$ is the graph whose vertices are the words of length $n$ over the alphabet $\{0,1,\ldots,q-1\}$, where two vertices are adjacent if they differ in exactly one coordinate. The adjacency matrix of $H(n,q)$ has $n+1$…

Combinatorics · Mathematics 2020-03-04 Alexandr Valyuzhenich

The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound

Information Theory · Computer Science 2024-11-19 Vladimir N. Potapov

The $p$-ary function $f(x)$ mapping $\mathrm{GF}(p^{4k})$ to $\mathrm{GF}(p)$ and given by $f(x)={\rm Tr}_{4k}\big(ax^d+bx^2\big)$ with $a,b\in\mathrm{GF}(p^{4k})$ and $d=p^{3k}+p^{2k}-p^k+1$ is studied with the respect to its exponential…

Discrete Mathematics · Computer Science 2010-06-17 Tor Helleseth , Alexander Kholosha

We consider the distance function from an arbitrary point $p$ on a flat surface, and determine the set $F_{p}$ of all \emph{farthest points} (i.e., points at maximal distance) from $p$.

Metric Geometry · Mathematics 2018-09-19 Joël Rouyer , Costin Vîlcu

We consider two disjoint sets of points. If at least one of the sets can be embedded into an Euclidean space, then we provide sufficient conditions for the two sets to be jointly embedded in one Euclidean space. In this joint Euclidean…

General Mathematics · Mathematics 2023-09-06 N. Alexia Raharinirina , Konstantin Fackeldey , Marcus Weber

The main result of this paper are dimension-free $L^p$ inequalities, $1<p<\infty$, for low degree scalar-valued functions on the Hamming cube. More precisely, for any $p>2,$ $\varepsilon>0,$ and $\theta=\theta(\varepsilon,p)\in (0,1)$…

The sequence of the simple random walks on Hamming schemes $\{H(n, q)\}_{n=1}^{\infty}$ has a cutoff phenomenon for each integer $q$ greater than or equal to $3$. In this paper, for the sequence of simple random walks on Hamming schemes…

Probability · Mathematics 2016-02-10 Katsuhiko Kikuchi

Let $p$ be prime. We prove that, for $n$ odd, the $p$-torsion part of $\pi_q(S^{n})$ has cardinality at most $p^{2^{\frac{1}{p-1}(q-n+3-2p)}}$, and hence has rank at most $2^{\frac{1}{p-1}(q-n+3-2p)}$. For $p=2$ these results also hold for…

Algebraic Topology · Mathematics 2021-01-13 Guy Boyde

Let $p$ be a prime number. As a standard application of the irreducibility criterion of Eisenstein, it is well known that the $p$-th cyclotomic polynomial $\Phi_p(t)=1+t+\dots+t^{p-1}$ is the minimal polynomial of $e^{2\pi i/p}$ over…

History and Overview · Mathematics 2022-10-28 Tom Moshaiov

It is shown that the smallest possible distance between two disjoint lattice polytopes contained in the cube $[0,k]^3$ is exactly $$ \frac{1}{\sqrt{2(2k^2-4k+5)(2k^2-2k+1)}} $$ for every integer $k$ at least $4$. The proof relies on…

Metric Geometry · Mathematics 2025-02-28 Antoine Deza , Zhongyuan Liu , Lionel Pournin

Assume $n=2m\geq 2$ and let $F(x)=x^{d_1}+x^{d_2}$ be a binomial vectorial function over $\F_{2^n}$ possessing the maximal number (i.e. $2^n-2^m$) of bent components. Suppose the $2$-adic Hamming weights $\wt_2(d_1)$ and $\wt_2(d_2)$ are…

Information Theory · Computer Science 2026-04-10 Xianhong Xie , Yi Ouyang , Shenxing Zhang

Recent results of Bourgain and Shparlinski imply that for almost all primes $p$ there is a multiple $mp$ that can be written in binary as $mp= 1+2^{m_1}+ \cdots +2^{m_k}, \quad 1\leq m_1 < \cdots < m_k,$ with $k=66$ or $k=16$, respectively.…

Number Theory · Mathematics 2019-02-20 Christian Elsholtz

For a fixed, compactly supported probability measure $\mu$ on the $d$-dimensional space $\mathbb{R}^d$, we consider the problem of minimizing the $p^{\mathrm{th}}$-power average distance functional over all compact, connected $\Sigma…

Optimization and Control · Mathematics 2025-08-12 Lucas O'Brien , Forest Kobayashi , Young-Heon Kim

We generalize Pach and de Zeeuw's bound for distinct distances between points on two curves, from algebraic curves to Pfaffian curves. Pfaffian curves include those that can be defined by any combination of elementary functions, including…

Metric Geometry · Mathematics 2025-10-07 Abhiram Natarajan , Adam Sheffer

Let $p_n$ denote the $n^{th}$ prime. Goldston, Pintz, and Yildirim recently proved that $ \liminf_{n\to \infty} \frac{(p_{n+1}-p_n)}{\log p_n} =0.$ We give an alternative proof of this result. We also prove some corresponding results for…

Number Theory · Mathematics 2007-05-23 D. A. Goldston , S. W. Graham , J. Pintz , C. Y. Yilidirm

On any closed Riemannian manifold of dimension $n\geq 3$, we prove that if a function nearly minimizes the Yamabe energy, then the corresponding conformal metric is close, in a quantitative sense, to a minimizing Yamabe metric in the…

Analysis of PDEs · Mathematics 2022-02-16 Max Engelstein , Robin Neumayer , Luca Spolaor

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

Computational Geometry · Computer Science 2014-04-25 Quentin Mérigot

We investigate the following problem: what is the smallest possible distance between a cubic irrational $\xi$ and a rational number $p/q$ in terms of the height $H(\xi)$ and $q$? More precisely, we consider the set $D_{3,1}$ consisting of…

Number Theory · Mathematics 2026-01-06 Dmitry Badziahin

We show how to compute any symmetric Boolean function on $n$ variables over any field (as well as the integers) with a probabilistic polynomial of degree $O(\sqrt{n \log(1/\epsilon)})$ and error at most $\epsilon$. The degree dependence on…

Data Structures and Algorithms · Computer Science 2016-11-18 Josh Alman , Ryan Williams

The shortest distance between the first $n$ iterates of a typical point can be quantified with a log rule for some dynamical systems admitting Gibbs measures. We show this in two settings. For topologically mixing Markov shifts with at most…

Dynamical Systems · Mathematics 2024-03-05 Boyuan Zhao