Related papers: Counting Frobenius Pseudoprimes
The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…
Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors…
The Frobenius method can be used to represent solutions of ordinary differential equations by (generalized) power series. It is useful to have prior knowledge of the coefficients of this series. In this contribution we demonstrate that the…
An (association) scheme is said to be Frobenius if it is the scheme of a Frobenius group. A scheme which has the same tensor of intersection numbers as some Frobenius scheme is said to be pseudofrobenius. We establish a necessary and…
Let f(m,n) denote the number of relatively prime subsets of {m+1,m+2,...,n}, and let Phi(m,n) denote the number of subsets A of {m+1,m+2,...,n} such that gcd(A) is relatively prime to n. Let f_k(m,n) and Phi_k(m,n) be the analogous counting…
We derive two probabilistic bounds for the relative forward error in the floating point summation of $n$ real numbers, by representing the roundoffs as independent, zero-mean, bounded random variables. The first probabilistic bound is based…
We give a more strong heuristic justification of our conjecture on the excess of the odious primes.
An analogue of the classical Frobenius-Schur indicator is introduced in order to distinguish between real and pseudo-real self-conjugate primary fields, and an explicit expression for this quantity is derived from the trace of the braiding…
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
We prove dual theorems to theorems proved by author in \cite {5}. Beginning with Section 10, we introduce and study so-called "twin numbers of the second kind" and a postulate for them. We give two proofs of the infinity of these numbers…
We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…
We classify Frobenius forms, a special class of homogeneous polynomials in characteristic $p>0$, in up to five variables over an algebraically closed field. We also point out some of the similarities with quadratic forms.
A new elementary proof of the prime number theorem presented recently in the framework of a scale invariant extension of the ordinary analysis is re-examined and clarified further. Both the formalism and proof are presented in a much more…
We prove a uniform estimate of the number of points for difference algebraic varieties in finite difference fields in the spirit of Lang-Weil. More precisely, we give uniform lower and upper bounds for the number of rational points of a…
We show how one can ascertain the values of a complete set of mutually complementary observables of a prime degree of freedom.
Let $[X,\lambda]$ be a principally polarized abelian variety over a finite field with commutative endomorphism ring; further suppose that either $X$ is ordinary or the field is prime. Motivated by an equidistribution heuristic, we introduce…
Multiple hypothesis testing is a fundamental problem in high dimensional inference, with wide applications in many scientific fields. In genome-wide association studies, tens of thousands of tests are performed simultaneously to find if any…
We show that the Fr\"oberg conjecture holds in the second non-trivial degree for an ideal generated by generic forms of degree $d>2$. We also show that the conjecture is true up to degree $2d-1$ provided that the number of variables is…
Monier and Rabin proved that an odd composite can pass the Strong Probable Prime Test for at most $\frac 14$ of the possible bases. In this paper, a probable prime test is developed using quadratic polynomials and the Frobenius…
Let $N \geq2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. Frobenius number of this $N$-tuple is defined to be the largest positive integer that cannot be expressed as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are…