English
Related papers

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

200 papers

We characterize $p-$harmonic functions in the Heisenberg group in terms of an asymptotic mean value property, where $1<p<\infty$, following the scheme described in Manfredi et al. (2009) for the Euclidean case. The new tool that allows us…

Analysis of PDEs · Mathematics 2012-10-11 Fausto Ferrari , Qing Liu , Juan J. Manfredi

Given functions $f,g: [n] \rightarrow [n]$ do there exist $n$ points $A_1,A_2\ldots A_n$ in some metric space such that $A_{f(i)},A_{g(i)}$ are the points closest and farthest from point $A_i$? In this paper we characterize precisely which…

Metric Geometry · Mathematics 2025-07-08 Žarko Ranđelović

Consider a bivariate Geometric random variable where the first component has parameter $p_1$ and the second parameter $p_2$. It is not possible to make the correlation between the marginals equal to -1. Here the properties of this minimum…

Probability · Mathematics 2014-08-29 Mark Huber , Nevena Maric

The concept of p-orthogonality (1=< p =< n) between n-particle states is introduced. It generalizes common orthogonality, which is equivalent to n-orthogonality, and strong orthogonality between fermionic states, which is equivalent to…

Quantum Physics · Physics 2008-03-17 Patrick Cassam-Chenaï

Generating functions for the size of a $r$-sphere, with respect to the Manhattan distance in an $n$-dimensional grid, are used to provide explicit formulas for the minimum and maximum size of an $r$-ball centered at a point of the grid.…

Information Theory · Computer Science 2024-06-27 E. J. García-Claro , Ismael Gutiérrez

We give a new simple construction for known binary quadratic symmetric bent and almost bent functions. In particular, for even number of variables, they are self-dual and anti-self-dual quadratic bent functions, respectively, which are not…

Information Theory · Computer Science 2019-09-24 Josep Rifà , Victor Zinoviev

For k greater than 1 and r different from 0, let pi^k_{2r}(x) denote the number of prime pairs (p,p^k+2r) with p not exceeding (large) x. By the Bateman-Horn conjecture, the function pi^k_{2r}(x) should be asymptotic to…

Number Theory · Mathematics 2008-06-11 Fokko van de Bult , Jaap Korevaar

Let p > 2 be a prime, let n > m > 0. Let pi_n be the norm of zeta_{p^n} - 1 under C_{p-1}, so that Z_(p)[pi_n] | Z_(p) is a purely ramified extension of discrete valuation rings of degree p^{n-1}. The minimal polynomial of pi_n over Q(pi_m)…

Number Theory · Mathematics 2007-05-23 M. Kuenzer , E. Wirsing

We explore the relationship between two figures of merit for an adiabatic quantum computation process: the success probability $P$ and the minimum gap $\Delta_{min}$ between the ground and first excited states, investigating to what extent…

Quantum Physics · Physics 2015-05-28 M. Cullimore , M. J. Everitt , M. A. Ormerod , J. H. Samson , R. D. Wilson , A. M. Zagoskin

We introduce a persistence-like pseudo-distance on Tamarkin's category and prove that the distance between an object and its Hamiltonian deformation is at most the Hofer norm of the Hamiltonian function. Using the distance, we show a…

Symplectic Geometry · Mathematics 2020-08-06 Tomohiro Asano , Yuichi Ike

For each positive integer n, we determine the set of symmetric functions f for which the congruence f(p/1,p/2,...,p/(p-1)) \equiv 0 mod p^n holds for all sufficiently large primes p. Our determination is conditional on a conjecture…

Number Theory · Mathematics 2015-01-13 Julian Rosen

We prove an analogue of the celebrated Hall-Higman theorem, which gives a lower bound for the degree of the minimal polynomial of any semisimple element of prime power order $p^{a}$ of a finite classical group in any nontrivial irreducible…

Representation Theory · Mathematics 2008-10-07 Pham Huu Tiep , Alexander E. Zalesskii

We prove a local Brunn-Minkowski inequality for a functional corresponding to p-harmonic measures for 2 < p < n+1.

Analysis of PDEs · Mathematics 2026-03-24 Ariel A. Aguas-Barreno , Murat Akman , Shirsho Mukherjee

Let $p$ be an odd prime and $A \subseteq \mathbb{F}_p$ be a subset of the finite field with $p$ elements. We show that $A \times A \subseteq \mathbb{F}_p^2$ determines at least a constant multiple of $\min\{p, |A|^{3/2}\}$ distinct pinned…

Combinatorics · Mathematics 2018-11-08 Giorgis Petridis

In this paper, we provide upper and lower estimates for the minimal number of functions needed to represent a bounded variation function with an accuracy of epsilon with respect to ${\bf L}^1$-distance.

Functional Analysis · Mathematics 2018-05-28 Prerona Dutta , Khai T. Nguyen

It is shown that two vectors with coordinates in the finite $q$-element field of characteristic $p$ belong to the same orbit under the natural action of the symmetric group if each of the elementary symmetric polynomials of degree…

Commutative Algebra · Mathematics 2022-11-30 Mátyás Domokos , Botond Miklósi

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

Number Theory · Mathematics 2018-02-08 Yu-Chen Sun , Hao Pan

In this paper we explore a connection between certain Almost Perfect Nonlinear Functions (APN functions) and relative difference sets. In particular, we show that the image set of certain 2-to-1 APN functions is a relative difference set.…

Combinatorics · Mathematics 2026-03-12 Zeying Wang

We present a new general method for performing basic arithmetic in the finite field~$\mathbb{F}_p$ for any prime $p>2$ by using traditional binary operations over~$\mathbb{F}_2$. Our new approach is efficient and competitive with current…

Information Theory · Computer Science 2026-04-01 Fernando Hernando , Gregorio Quintana-Ortí

We consider binary abelian codes of length $p^m q^n$, where $p$ and $q$ are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or…

Information Theory · Computer Science 2012-05-28 Gladys Chalom , Raul Antônio Ferraz , Marinês Guerreiro , César Polcino Milies