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

For $q\in(0,1),$ let $B_q$ denote the limit $q$-Bernstein operator. In this paper, the distance between $B_q$ and $B_r$ for distinct $q$ and $r$ in the operator norm on $C[0,1]$ is estimated, and it is proved that $1\leqslant…

A polynomial of degree $\ge 2$ with coefficients in the ring of $p$-adic numbers $\mathbb{Z}_p$ is studied as a dynamical system on $\mathbb{Z}_p$. It is proved that the dynamical behavior of such a system is totally described by its…

We show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently known unconditionally. In particular, we derive…

We prove a conjecture by Van Dam and Sotirov on the smallest eigenvalue of (distance-$j$) Hamming graphs and a conjecture by Karloff on the smallest eigenvalue of (distance-$j$) Johnson graphs. More generally, we study the smallest…

Starting with a similarity function between objects, it is possible to define a distance metric on pairs of objects, and more generally on probability distributions over them. These distance metrics have a deep basis in functional analysis,…

In this paper we introduce the relative generalized minimum distance function (RGMDF for short) and it allows us to give an algebraic approach to the relative generalized Hamming weights of the projective Reed--Muller--type codes. Also we…

This paper addresses the problem of finding a B-term wavelet representation of a given discrete function $f \in \real^n$ whose distance from f is minimized. The problem is well understood when we seek to minimize the Euclidean distance…

In 1918, Hardy and Ramanujan published a seminal paper which included an asymptotic formula for the partition function. In their paper, they also claim without proof an asymptotic equivalence for $p^k(n)$, the number of partitions of a…

Let $Z_n(s; a_1,..., a_n)$ be the Epstein zeta function defined as the meromorphic continuation of the function \sum_{k\in\Z^n\setminus\{0\}}(\sum_{i=1}^n [a_i k_i]^2)^{-s}, \text{Re} s>\frac{n}{2} to the complex plane. We show that for…

We construct a binary minimal subshift whose words of length n form a connected subset of the Hamming graph for each n.

A general lower bound is developed for the minimax risk when estimating an arbitrary functional. The bound is based on testing two composite hypotheses and is shown to be effective in estimating the nonsmooth functional…

The $2 q$-th pseudomoment $\Psi_{2q,\alpha}(x)$ of the $\alpha$-th power of the Riemann zeta function is defined to be the $2 q$-th moment of the partial sum up to $x$ of $\zeta^\alpha$ on the critical line. Using probabilistic methods of…

The calculation of Euclidean distance between points is generalized to one-dimensional objects such as strings or polymers. Necessary and sufficient conditions for the minimal transformation between two polymer configurations are derived.…

Let $(P_N)_{N\ge0}$ one of the classical sequences of orthogonal polynomials, i.e., Hermite, Laguerre or Jacobi polynomials. For the roots $z_{1,N},\ldots, z_{N,N}$ of $P_N$ we derive lower estimates for $\min_{i\ne j}|z_{i,N}-z_{j,N}|$ and…

In this paper, we study how small a box contains at least two points from a modular cubic polynomial $y \equiv a x^3 + b x^2 + c x + d \pmod p$ with $(a, p) = 1$. We prove that some square of side length $p^{1/6 + \epsilon}$ contains two…

It is known that the flip distance between two triangulations of a convex polygon is related to the minimum number of tetrahedra in the triangulation of some polyhedron. It is interesting to know whether these two numbers are the same. In…

Pickands dependence functions characterize bivariate extreme value copulas. In this paper, we study the class of polynomial Pickands functions. We provide a solution for the characterization of such polynomials of degree at most $m+2$,…

In this paper we investigate a class of $2$-Hessian equations and establish a minimum principle for a $P$-function in the sense of L.E. Payne (see R. Sperb \cite{Sp81}). The analysis is based on a sharp matrix inequality providing an…

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

We derive sharp lower bounds for L^p-functions on the n-dimensional unit hypercube in terms of their p-th marginal moments. Such bounds are the unique solutions of a system of constrained nonlinear integral equations depending on the…