相关论文: Quadratic Frobenius probable prime tests costing t…

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for…

A class of algorithms in discrete space and continuous time for Brownian first passage time estimation is considered. A simple algorithm is derived that yields exact mean first passage times (MFPT) for linear potentials in one dimension,…

We generalize the work of Erdos-Pomerance and Fiori-Shallue on counting Frobenius pseudoprimes from the cases of degree one and two respectively to arbitrary degree. More specifically we provide formulas for counting the number of false…

We study the Frobenius problem: given relatively prime positive integers $a_1,...,a_d$, find the largest value of t (the Frobenius number) such that $\sum_{k=1}^d m_k a_k = t$ has no solution in nonnegative integers $m_1,...,m_d$. Based on…

In this note, we present a probabilistic proof of the well-known finite geometric series. The proof follows by taking the moments of the sum and the difference of two independent exponentially distributed random variables.

In order to avoid unnecessary applications of Miller-Rabin algorithm to the number in question, we resort to trial division by a few initial prime numbers, since such a division take less time. How far we should go with such a division is…

Let $K$ be a number field and $r$ an integer. Given an elliptic curve $E$, defined over $K$, we consider the problem of counting the number of degree two prime ideals of $K$ with trace of Frobenius equal to $r$. Under certain restrictions…

I consider the problem of existence of intrinsic determinantal equations for plane projective curves and hypersurfaces in projective space and prove that in many cases of interest there exist intrinsic determinantal equations. In particular…

In ISSAC 2017, van der Hoeven and Larrieu showed that evaluating a polynomial P in GF(q)[x] of degree <n at all n-th roots of unity in GF($q^d$) can essentially be computed d-time faster than evaluating Q in GF($q^d$)[x] at all these roots,…

We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ram\'irez Alfons\'in…

Let $k\ge 1$ be an integer, and let $P= (f_1(x), \ldots, f_k(x) )$ be $k$ admissible linear polynomials over the integers, or \textit{the pattern}. We present two algorithms that find all integers $x$ where $\max{ \{f_i(x) \} } \le n$ and…

The Frobenius coin problem in three variables, for three positive relatively prime integers $a_1< a_2< a_3$ asks to find the largest number not representable as $a_1x_1+a_2x_2+a_3x_3$ with non-negative integer coefficients $x_1$, $x_2$ and…

We show that deciding simulation equivalence and simulation preorder have quadratic lower bounds assuming that the Strong Exponential Time Hypothesis holds. This is in line with the best know quadratic upper bounds of simulation…

The classical Frobenius problem is to find the largest integer that cannot be written as a linear combination of a given set of positive, coprime integers using nonnegative integer coefficients. Prior work has generalized the classical…

The results of the computer hunt for the primes of the form $q = m^2+1$ up to $10^{20}$ are reported. The number of sign changes of the difference $\pi_q(x) - \frac{C_q}{2}\int_2^x{du \over \sqrt{u}\log(u)}$ and the error term for this…

Let f\in Z[x], deg(f)=3. Assume that f does not have repeated roots. Assume as well that, for every prime q, the inequality f(x)\not\equiv 0 mod q^2 has at least one solution in (Z/q^2 Z)^*. Then, under these two necessary conditions, there…

Expanding on recent results of another an algorithm is presented that provides solution to the Frobenius Coin Problem in worst case O(n^2) in the magnitude of the largest denomination.

We show that the problem of determining the feasibility of quadratic systems over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$ requires exponential time. This separates P and NP over these fields/rings in the BCSS model of computation.

In this article we present a heuristic model that describes the asymptotic behaviour of the number of primes p such that the p-th coefficient of a given eigenform is a rational integer. We treat the case of a weight 2 eigenform with…