Related papers: Some new infinite families of non-$p$-rational real quadratic fields

Some new infinite families of non-$p$-rational real quadratic fields

URL: http://arxiv.org/abs/2406.14632v1
Date: Thu, 20 Jun 2024 18:00:51 GMT
Title: Some new infinite families of non-$p$-rational real quadratic fields
Authors: Gary McConnell,
Abstract summary: We give a simple methodology for constructing an infinite family of simultaneously non-$p_j$-rational real fields, unramified above any of the $p_j$. One feature of these techniques is that they may be used to yield fields $K=mathbbQ(sqrtD)$ for which a $p$-power cyclic component of the torsion group of the Galois groups of the maximal abelian pro-$p$-extension of $K$ unramified outside primes above $p$, is of size $pa
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Fix a finite collection of primes $\{ p_j \}$, not containing $2$ or $3$. Using some observations which arose from attempts to solve the SIC-POVMs problem in quantum information, we give a simple methodology for constructing an infinite family of simultaneously non-$p_j$-rational real quadratic fields, unramified above any of the $p_j$. Alternatively these may be described as infinite sequences of instances of $\mathbb{Q}(\sqrt{D})$, for varying $D$, where every $p_j$ is a $k$-Wall-Sun-Sun prime, or equivalently a generalised Fibonacci-Wieferich prime. One feature of these techniques is that they may be used to yield fields $K=\mathbb{Q}(\sqrt{D})$ for which a $p$-power cyclic component of the torsion group of the Galois groups of the maximal abelian pro-$p$-extension of $K$ unramified outside primes above $p$, is of size $p^a$ for $a\geq1$ arbitrarily large.

Related papers

New estimates for character sums over sparse elements of finite fields [6.5990719141691825]
We provide new estimates for the character sums $sum_ginmathcalGchi(f(g))$, where $mathcalG$ is a given sparse subsets of $mathbbF_qr$ and $f(X)$ is a sum over $mathbbF_qr$ of certain type.
arXiv Detail & Related papers (2025-02-20T10:40:48Z)
The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
arXiv Detail & Related papers (2024-10-26T06:21:42Z)
Dimension-free discretizations of the uniform norm by small product sets [45.85600902330814]
A classical inequality of Bernstein compares the supremum norm of $f$ over the unit circle to its supremum norm over the sampling set of the $K$-th roots of unity. We show that dimension-free discretizations are possible with sampling sets whose cardinality is independent of $deg(f)$ and is instead governed by the maximum individual degree of $f$.
arXiv Detail & Related papers (2023-10-11T22:46:09Z)
Exceptional points for associated Legendre functions of the second kind [0.0]
We consider the complex $nu$ plane structure of the associated Legendre function $Q-1/2-K_nu(coshrho)$. We find that for any noninteger value for $K$ $Q-1/2-K_nu(coshrho)$ has an infinite number of poles in the complex $nu$ plane.
arXiv Detail & Related papers (2023-01-08T17:05:43Z)
Quantum and classical low-degree learning via a dimension-free Remez inequality [52.12931955662553]
We show a new way to relate functions on the hypergrid to their harmonic extensions over the polytorus. We show the supremum of a function $f$ over products of the cyclic group $exp(2pi i k/K)_k=1K$. We extend to new spaces a recent line of work citeEI22, CHP, VZ22 that gave similarly efficient methods for learning low-degrees on hypercubes and observables on qubits.
arXiv Detail & Related papers (2023-01-04T04:15:40Z)
The Approximate Degree of DNF and CNF Formulas [95.94432031144716]
For every $delta>0,$ we construct CNF and formulas of size with approximate degree $Omega(n1-delta),$ essentially matching the trivial upper bound of $n. We show that for every $delta>0$, these models require $Omega(n1-delta)$, $Omega(n/4kk2)1-delta$, and $Omega(n/4kk2)1-delta$, respectively.
arXiv Detail & Related papers (2022-09-04T10:01:39Z)
Monogamy of entanglement between cones [68.8204255655161]
We show that monogamy is not only a feature of quantum theory, but that it characterizes the minimal tensor product of general pairs of convex cones. Our proof makes use of a new characterization of products of simplices up to affine equivalence.
arXiv Detail & Related papers (2022-06-23T16:23:59Z)
Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
arXiv Detail & Related papers (2022-05-30T18:01:34Z)
First quantization of braided Majorana fermions [0.0]
A $mathbb Z$-graded qubit represents an even (bosonic) "vacuum state" Multiparticle sectors of $N$, braided, indistinguishable Majorana fermions are constructed via first quantization.
arXiv Detail & Related papers (2022-03-03T15:43:38Z)
Mutually unbiased bases: polynomial optimization and symmetry [1.024113475677323]
A set of $k$ orthonormal bases of $mathbb Cd$ is called mutually unbiased $|langle e,frangle |2 = 1/d$ whenever $e$ and $f$ are basis vectors in distinct bases. We exploit this symmetry (analytically) to reduce the size of the semidefinite programs making them tractable.
arXiv Detail & Related papers (2021-11-10T14:14:53Z)
An Optimal Separation of Randomized and Quantum Query Complexity [67.19751155411075]
We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $ellsqrtbinomdell (1+log n)ell-1,$ sum to at most $cellsqrtbinomdell (1+log n)ell-1,$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant.
arXiv Detail & Related papers (2020-08-24T06:50:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.