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

Two classical rings of invariants are shown to be Frobenius split: for the special linear group acting on the direct sum of several copies of the defining representation and several copies of the dual of the defining representation; and for…

We obtain new results concerning the Sato-Tate conjecture on the distribution of Frobenius traces over single and double parametric families of elliptic curves. We consider these curves for values of parameters having prescribed arithmetic…

All known algorithms for the Fr\'echet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values.…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

The calculation of many and large Perrin pseudoprimes is a challenge. This is mainly due to their rarity. Perrin pseudoprimes are one of the rarest known pseudoprimes. In order to calculate many such large numbers, one needs not only a fast…

Using probabilistic methods, we establish a-priori estimates for two classes of quasilinear parabolic systems of partial differential equations (PDEs). We treat in particular the case of a nonlinearity which has quadratic growth in the…

We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…

We provide two complexity measures that can be used to measure the running time of algorithms to compute multiplications of long integers. The random access machine with unit or logarithmic cost is not adequate for measuring the complexity…

Assuming repeated independent sampling from a Bernoulli distribution with two possible outcomes S and F, there are formulas for computing the probability of one specific pattern of consecutive outcomes (such as SSFFSS) winning (i.e. being…

Let $p \geq 5$ be a prime and for $a, b \in \mathbb{F}_{p}$, let $E_{a,b}$ denote the elliptic curve over $\mathbb{F}_{p}$ with equation $y^2=x^3+a\,x + b$. As usual define the trace of Frobenius $a_{p,\,a,\,b}$ by \begin{equation*}…

Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…

Consider testing multiple hypotheses in the setting where the p-values of all hypotheses are unknown and thus have to be approximated using Monte Carlo simulations. One class of algorithms published in the literature for this scenario…

This paper presents in detail the originally developed Quadratic Point Estimate Method (QPEM), aimed at efficiently and accurately computing the first four output moments of probabilistic distributions, using 2n^2+1 sample (or sigma)…

Let $K$ be a fixed number field, assumed to be Galois over $\mathbb Q$. Let $r$ and $f$ be fixed integers with $f$ positive. Given an elliptic curve $E$, defined over $K$, we consider the problem of counting the number of degree $f$ prime…

We describe a new polynomial time quantum algorithm that uses the quantum fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics and…

Using the theory of spherical varieties and especially Frobenius splitting results for symmetric varieties, we give a type independent very short proof of Wahl's conjecture for cominuscule homogeneous spaces for all primes different from 2.

Distance metric learning is of fundamental interest in machine learning because the distance metric employed can significantly affect the performance of many learning methods. Quadratic Mahalanobis metric learning is a popular approach to…

We continue to study the squared Frobenius norm of a submatrix of a $n \times n$ random unitary matrix. When the choice of the submatrix is deterministic and its size is $[ns] \times [nt]$, we proved in a previous paper that, after…

We show the relationship between the Fourier coefficients and the barren plateau problem emerging in parameterized quantum circuits. In particular, the sum of squares of the Fourier coefficients is exponentially restricted concerning the…

We give an efficient quantum algorithm for the Moebius function $\mu(n)$ from the natural numbers to $\{-1,0,1\}$. The cost of the algorithm is asymptotically quadratic in $\log n$ and does not require the computation of the prime…