Related papers: Quadratic Frobenius probable prime tests costing t…
The values of the homogeneous weight are determined for finite Frobenius rings that are a direct product of local Frobenius rings. This is used to investigate the partition induced by this weight and its dual partition under…
It is generally believed that the preference ranking method PROMETHEE has a quadratic time complexity. In this paper, however, we present an exact algorithm that computes PROMETHEE's net flow scores in time O(qn log(n)), where q represents…
The proliferation of probable prime tests in recent years has produced a plethora of definitions with the word ``pseudoprime'' in them. Examples include pseudoprimes, Euler pseudoprimes, strong pseudoprimes, Lucas pseudoprimes, strong Lucas…
In this paper, we prove a theorem on the distribution of primes in cubic progressions on average.
In this paper, we establish a theorem on the distribution of primes in quadratic progressions on average.
We propose a criterion that allows one to distinguish prime numbers from compound ones. This criterion is based on the counting of small quadratic residues.
In [Huang-Raskind 2009], the authors proved that the discrete logarithm problem in a prime finite field is random polynomial time equivalent to computing the ramification signature of a real quadratic field. In this paper, we do this for a…
Given relatively prime integers $a_1, \dotsc, a_n$, the Frobenius number $g(a_1, \dotsc, a_n)$ is defined as the largest integer which cannot be expressed as $x_1 a_1 + \dotsb + x_n a_n$ with $x_i$ nonnegative integers. In this article, we…
This article describes the \emph{Macaulay2} package \emph{FrobeniusThresholds}, designed to estimate and calculate $F$-pure thresholds, more general $F$-thresholds, and related numerical invariants arising in the study of singularities in…
Let f be a cubic polynomial. Then there are infinitely many primes p such that f(p) is square-free.
In this paper we study the (classical) Frobenius problem, namely the problem of finding the largest integer that cannot be represented as a nonnegative integral combination of given relatively prime (strictly) positive integers (known as…
Let $f(x_1,\ldots,x_n)$ be a regular indefinite integral quadratic form with $n\ge 9$, and let $t$ be an integer. It is established that $f(x_1,\ldots,x_n)=t$ has solutions in prime variables if there are no local obstructions.
Recently, Huggins et. al. [Nature, 603, 416-420 (2022)] devised a general projective Quantum Monte Carlo method suitable for implementation on quantum computers. This hybrid approach, however, relies on a subroutine -the computation of the…
In this article, we derive a list of possible characteristic polynomials of the Frobenius of simple supersingular abelian varieties of dimension 1, 2, 3, 4, 5, 6, 7 over $\mathbb{F}_q$ where $q = p^n$, n odd.
Let $f(x_1, x_2, x_3)$ be an indefinite anisotropic integral quadratic form with determinant $d(f)$, and $t$ a non-zero integer such that $d(f)t$ is square-free. It is proved in this paper that, as long as there is one integral solution to…
Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is…
We show that an irreducible ordinary differential equation on the projective line has a Frobenius structure for a power of some prime p if it is rigid in the sense of Katz and satisfies some other reasonable (and necessary) conditions…
We compute the Frobenius number for sequences of triangular and tetrahedral numbers. In addition, we study some properties of the numerical semigroups associated to those sequences.
Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy) we know that the quantum algorithm…
We study the problem of writing Gaussian primes as the sum of two squares, both of which are interesting arithmetically, in particular, when one is the square of a prime and the other the square of an almost-prime.