English
Related papers

Related papers: Average liar count for degree-2 Frobenius pseudopr…

200 papers

In the simple quantum hypothesis testing problem, upper bounds on the error probabilities are shown based on a key operator inequality between a density operator and its pinching. Concerning the error exponents, the upper bounds lead to a…

Quantum Physics · Physics 2007-05-23 Tomohiro Ogawa , Masahito Hayashi

Let K/Q be Galois, and let eta in K* whose conjugates are multiplicatively independent. For a prime p, unramified, prime to eta, let np be the residue degree of p and gp the number of P I p, then let o\_P(eta) and o\_p(eta) be the orders of…

Number Theory · Mathematics 2021-08-06 Georges Gras

We study the set $\mathcal{S}$ of odd positive integers $n$ with the property ${2n}/{\sigma(n)} - 1 = 1/x$, for positive integer $x$, i.e., the set that relates to odd perfect and odd "spoof perfect" numbers. As a consequence, we find that…

Number Theory · Mathematics 2021-11-29 László Tóth

This paper is devoted to studying difference indices of quasi-regular difference algebraic systems. We give the definition of difference indices through a family of pseudo-Jacobian matrices. Some properties of difference indices are proved.…

Commutative Algebra · Mathematics 2016-07-15 Jie Wang

Motivated by their research on automorphism groups of pseudo-real Riemann surfaces, Bujalance, Cirre and Conder have conjectured that there are infinitely many primes $p$ such that $p+2$ has all its prime factors $q\equiv -1$ mod~$(4)$. We…

Number Theory · Mathematics 2024-01-22 Gareth A. Jones , Alexander K. Zvonkin

We prove a conjecture of Guarnieri and Vendramin on the number of braces of a given order whose multiplicative group is a generalised quaternion group. At the same time, we give a similar result where the multiplicative group is dihedral.…

Rings and Algebras · Mathematics 2024-04-16 Nigel P. Byott , Fabio Ferri

We investigate the number ${\Cal F}(h)$ of imaginary quadratic fields with class number $h$. We establish an asymptotic formula for the average value of ${\Cal F}(h)$. We also establish a modest non-trivial upper bound for ${\Cal F}(h)$ and…

Number Theory · Mathematics 2007-08-14 K. Soundararajan

We analyze recent criticisms of the use of hyperreal probabilities as expressed by Pruss, Easwaran, Parker, and Williamson. We show that the alleged arbitrariness of hyperreal fields can be avoided by working in the Kanovei-Shelah model or…

History and Overview · Mathematics 2020-10-20 Emanuele Bottazzi , Mikhail G. Katz

In this paper, we give a notation on the Singleton bounds for linear codes over a finite commutative quasi-Frobenius ring in the work of Shiromoto [5]. We show that there exists a class of finite commutative quasi-Frobenius rings. The…

Information Theory · Computer Science 2016-11-29 Yongsheng Tang , Heqian Xu , Zhonghua Sun

We give a quintet of proofs resulting from questions posed by Erd\H{o}s. These questions concern ordinary lines in planar point sets, sequences with uniformly small exponential sums, $K_4$-free $4$-critical graphs with few chords in any…

Combinatorics · Mathematics 2026-04-09 Boris Alexeev , Moe Putterman , Mehtaab Sawhney , Mark Sellke , Gregory Valiant

We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an…

Computational Complexity · Computer Science 2015-07-13 Abuzer Yakaryilmaz , A. C. Cem Say , H. Gökalp Demirci

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

Number Theory · Mathematics 2019-08-21 Madhuparna Das , Goutam Paul

We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…

Number Theory · Mathematics 2026-05-28 Runbo Li

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

Number Theory · Mathematics 2020-12-08 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini

We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…

Number Theory · Mathematics 2017-09-27 Nicole Looper

In this note we show that unsatisfiable systems of linear equations with a constant number of variables per equation over prime finite fields have polynomial-size constant-degree semi-algebraic proofs of unsatisfiability. These are proofs…

Computational Complexity · Computer Science 2015-02-16 Albert Atserias

A Frobenius difference field is an algebraically closed field of characteristic $p>0$, enriched with a symbol for $x \mapsto x^{p^m}$. We study a sentence or formula in the language of fields with a distinguished automorphism, interpreted…

Logic · Mathematics 2022-03-08 Ehud Hrushovski

We prove a couple of related theorems including Legendre's and Andrica's conjecture. Key to the proofs is an algorithm that delivers the exact upper bound on the greatest gap that can occur in a combinatorial game with the set of P primes…

General Mathematics · Mathematics 2015-08-11 Jens Oehlschlägel

We obtain an upper bound for the distribution of primes in the form $n^4 + k$ up to $x$, averaged over $k$ with small square-full part. As a corollary, we show that for almost all $k$, there is an expected amount of primes in the form $n^4…

Number Theory · Mathematics 2019-08-27 Kam Hung Yau

Let $n$ be a positive integer greater than $2$. We define \textit{the Proth numerical semigroup}, $P_{k}(n)$, generated by $\{k 2^{n+i}+1 \,\mid\, i \in \mathbb{N}\}$, where $k$ is an odd positive number and $k < 2^{n}$. In this paper, we…

Combinatorics · Mathematics 2023-11-22 Pranjal Srivastava , Dhara Thakkar