Related papers: Cyclotomy Primality Proofs and their Certificates

We propose some primality tests for 2^kn-1, where k, n in Z, k>= 2 and n odd. There are several tests depending on how big n is. These tests are proved using properties of elliptic curves. Essentially, the new primality tests are the…

Originally suggested for the blood testing problem by Dorfman in 1943, an idea of Group Testing (GT) has found many applications in other fields as well. Among many (binomial) GT procedures introduced since then, in 1990, Yao and Hwang…

We study the number of primes with a given primitive root and in an arithmetic progression under the assumption of a suitable form of the generalized Riemann Hypothesis. Previous work of Lenstra, Moree and Stevenhagen has given asymptotics…

The determinantal point process (DPP) is an elegant probabilistic model of repulsion with applications in various machine learning tasks including summarization and search. However, the maximum a posteriori (MAP) inference for DPP which…

The material presented in this paper contributes to establishing a basis deemed essential for substantial progress in Automated Deduction. It identifies and studies global features in selected problems and their proofs which offer the…

The closest pair of points problem or closest pair problem (CPP) is an important problem in computational geometry where we have to find a pair of points from a set of points in metric space with the smallest distance between them. This…

In a recent letter [Chatterjee R, Mohanty P K, and Basu A, 2011 {\em J. Stat. Mech.} L05001], it was claimed that a four-state predator-prey (4SPP) model exhibits critical behavior distinct from that of directed percolation (DP). In this…

Statistical models and methods for determinantal point processes (DPPs) seem largely unexplored. We demonstrate that DPPs provide useful models for the description of spatial point pattern datasets where nearby points repel each other. Such…

Primary decomposition is a very important tool of commutative algebra and geometry. In this paper we generalized some of the existing algorithms of primary decomposition developed by Eisenbud et al. (cf. [EHV]) for free modules and also…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

In 1990 Subramanian defined the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem (CCV). He and Mayr showed that NL \subseteq CC \subseteq P, and proved that in addition to CCV several…

Let p be an odd prime. Let K = Q(zeta) be the p-cyclotomic field. Let v be any primitive root mod p. Let sigma be a Q-isomorphism of K. Let P(sigma) = sigma^{p-2}v^{-(p-2)}+ ... + sigma v^{-1} +1 \in Z[G] where 1 \leq v^n \leq p-1 is a…

In this note further clue decisive observations on cobweb admissible sequences are shared with the audience. In particular an announced proof of the Theorem 1 (by Dziemia\'nczuk) from [1] announced in India -Kolkata- December 2007 is…

In this paper, we present the fast computational algorithms for the Jacobi sums of orders $l^2$ and $2l^{2}$ with odd prime $l$ by formulating them in terms of the minimum number of cyclotomic numbers of the corresponding orders. We also…

We consider a probabilistic quantum implementation of a variable of the Pocklington-Lehmer $N-1$ primality test using Shor's algorithm. O($\log^3 N \log\log N \log\log\log N$) elementary q-bit operations are required to determine the…

We study preconditioned proximal point methods for a class of saddle point problems, where the preconditioner decouples the overall proximal point method into an alternating primal--dual method. This is akin to the Chambolle--Pock method or…

Determinantal Point Processes (DPPs) are a family of probabilistic models that have a repulsive behavior, and lend themselves naturally to many tasks in machine learning where returning a diverse set of objects is important. While there are…

This work aims to introduce the framework of polynomial optimization theory to solve fractional polynomial problems (FPPs). Unlike other widely used optimization frameworks, the proposed one applies to a larger class of FPPs, not…

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…

Recently there has been quite a bit of study carried out related to arithmetic properties of overpartitions into non-multiples of two co-prime integers. The paper [19] by Nadji et al. looked into congruences modulo $3$ and powers of $2$ for…