Search arXivSearch

arXiv · 2209.06763

p-adic Welch Bounds and p-adic Zauner Conjecture

Abstract

Let $p$ be a prime. For $d\in \mathbb{N}$, let $\mathbb{Q}_p^d$ be the standard $d$-dimensional p-adic Hilbert space. Let $m \in \mathbb{N}$ and $\text{Sym}^m(\mathbb{Q}_p^d)$ be the p-adic Hilbert space of symmetric m-tensors. We prove the following result. Let $\{τ_j\}_{j=1}^n$ be a collection in $\mathbb{Q}_p^d$ satisfying (i) $\langle τ_j, τ_j\rangle =1$ for all $1\leq j \leq n$ and (ii) there exists $b \in \mathbb{Q}_p$ satisfying $ \sum_{j=1}^{n}\langle x, τ_j\rangle τ_j =bx$ for all $ x \in \mathbb{Q}^d_p.$ Then \begin{align} (1) \quad \quad \quad \max_{1\leq j,k \leq n, j \neq k}\{|n|, |\langle τ_j, τ_k\rangle|^{2m} \}\geq \frac{|n|^2}{\left|{d+m-1 \choose m}\right| }. \end{align} We call Inequality (1) as the p-adic version of Welch bounds obtained by Welch [\textit{IEEE Transactions on Information Theory, 1974}]. Inequality (1) differs from the non-Archimedean Welch bound obtained recently by M. Krishna as one can not derive one from another. We formulate p-adic Zauner conjecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

K. Mahesh Krishna. 2022-08-31. p-adic Welch Bounds and p-adic Zauner Conjecture. https://doi.org/10.1134/s207004662403004x

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT