English
Related papers

Related papers: On q-ary Bent and Plateaued Functions

200 papers

We study the arity gap of functions of several variables defined on an arbitrary set A and valued in another set B. The arity gap of such a function is the minimum decrease in the number of essential variables when variables are identified.…

Combinatorics · Mathematics 2016-11-22 Miguel Couceiro , Erkko Lehtonen , Tamás Waldhauser

The Fermat-Weber center of a planar body $Q$ is a point in the plane from which the average distance to the points in $Q$ is minimal. We first show that for any convex body $Q$ in the plane, the average distance from the Fermat-Weber center…

Metric Geometry · Mathematics 2010-02-03 Adrian Dumitrescu , Minghui Jiang , Csaba D. Tóth

Let X be a homogeneous tree of degree q+1 (for q between 2 and infinity) and let f be a complex function on X times X for which f(x,y) only depend on the distance between x and y in X. Our main result gives a necessary and sufficient…

Group Theory · Mathematics 2009-09-01 Uffe Haagerup , Troels Steenstrup , Ryszard Szwarc

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

Combinatorics · Mathematics 2024-10-29 V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov

We derive Berry-Esseen approximation bounds for general functionals of independent random variables, based on chaos expansions methods. Our results apply to $U$-statistics satisfying the weak assumption of decomposability in the Hoeffding…

Probability · Mathematics 2020-10-12 Nicolas Privault , Grzegorz Serafin

We leverage proof techniques Fourier analysis and an existing result in coding theory to derive new bounds for the problem of non-interactive simulation of binary random variables. Previous bounds in the literature were derived by applying…

Information Theory · Computer Science 2021-01-26 Lei Yu , Vincent Y. F. Tan

In this paper, we prove that a binary definite quadratic form over F_q[t], where q is odd, is completely determined up to equivalence by the polynomials it represents up to degree 3m-2, where m is the degree of its discriminant. We also…

Number Theory · Mathematics 2011-11-15 Jean Bureau , Jorge Morales

We obtain new nonexistence results for two classes of generalized bent functions from $\mathbb{Z}_{q}^{n}$ to $\mathbb{Z}_{q}$, called type $[n,q]$ generalized bent functions. The first class concerns the case $q=2 p_1^{e_1} p_2^{e_2}$,…

Combinatorics · Mathematics 2026-05-26 Shi Ying , Yingpu Deng

Let $\phi$ be a smooth function on a compact interval $I$. Let $$\gamma(t)=\left (t,t^2,\cdots,t^{n-1},\phi(t)\right).$$ In this paper, we show that $$\left(\int_I \big|\hat f(\gamma(t))\big|^q \big|\phi^{(n)}(t)\big|^{\frac{2}{n(n+1)}}…

Classical Analysis and ODEs · Mathematics 2017-01-03 Xianghong Chen , Dashan Fan , Lifeng Wang

We give a distribution-dependent concentration inequality for functions of independent variables. The result extends Bernstein's inequality from sums to more general functions, whose variation in any argument does not depend too much on the…

Probability · Mathematics 2017-05-12 Andreas Maurer

In this paper, we give explicit error bounds for the asymptotic expansion of the shifted distinct partition function $q(n +s)$ for any nonnegative integer $s$. Then based on this refined asymptotic formula, we give the exact thresholds of…

Combinatorics · Mathematics 2025-12-25 Gargi Mukherjee , Helen W. J. Zhang , Ying Zhong

Our basic result, an isoperimetric inequality for Hamming cube $Q_n$, can be written: \[ \int h_A^\beta d\mu \ge 2 \mu(A)(1-\mu(A)). \] Here $\mu$ is uniform measure on $V=\{0,1\}^n$ ($=V(Q_n)$); $\beta=\log_2(3/2)$; and, for $S\subseteq V$…

Combinatorics · Mathematics 2019-09-12 Jeff Kahn , Jinyoung Park

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

Information Theory · Computer Science 2020-12-02 P. G. Boyvalenkov , K. V. Delchev , D. V. Zinoviev , V. A. Zinoviev

In the literature, few $n$-variable rotation symmetric bent functions have been constructed. In this paper, we present two infinite classes of rotation symmetric bent functions on $\mathbb{F}_2^{n}$ of the two forms: {\rm (i)}…

Information Theory · Computer Science 2015-09-02 Chunming Tang , Yanfeng Qi , Zhengchun Zhou , Cuiling Fan

A common measure of a function's complexity is the count of its stationary points. For complicated functions, this count grows exponentially with the volume and dimension of their domain. In practice, the count is averaged over a class of…

Statistical Mechanics · Physics 2024-01-17 Jaron Kent-Dobias

Including the Haar measure we show that the effective potential of the regularized SU(2) Yang-Mills theory has a minimum at vanishing Wilson-line $W=0$ for strong coupling, whereas it develops two degenerate minima close to $W=\pm 1$ for…

High Energy Physics - Phenomenology · Physics 2016-09-01 K. Sailer , A. Schäfer , W. Greiner

In this paper we investigate the boundedness properties of bilinear multiplier operators associated with unimodular functions of the form $m(\xi,\eta)=e^{i \phi(\xi-\eta)}$. We prove that if $\phi$ is a $C^1(\mathbb R^n)$ real-valued…

Classical Analysis and ODEs · Mathematics 2020-07-20 K. Jotsaroop , Saurabh Shrivastava

There are several proofs of the classical commutant lifting and intertwining lifting theorems in the literature. In this article, we present analogous proofs to a few $Q$-commuting lifting and $Q$-intertwining lifting theorems. We provide…

Functional Analysis · Mathematics 2022-10-25 Sourav Pal , Prajakta Sahasrabuddhe

We study the maximum length of $q$-ary codes as a function of alphabet size, code size, and Singleton defect. For an $(n, M, d)_q$ code with dimension $\kappa = \log_q M \ge 2$ and Singleton defect $s = n - \lceil\kappa\rceil + 1 - d$, we…

Combinatorics · Mathematics 2026-04-07 Tim Alderson

We find a nontrivial upper bound on the average value of the function M(n) which associates to every positive integer n the minimal Hamming weight of a multiple of n. Some new results about the equation M(n)=M(n') are given.

Number Theory · Mathematics 2024-12-17 Eugen J. Ionascu , Florian Luca , Thomas Merino