相关论文: A new algorithm to search for small nonzero |x^3 -…
We prove that any exact quantum algorithm searching an ordered list of N elements requires more than \frac{1}{\pi}(\ln(N)-1) queries to the list. This improves upon the previously best known lower bound of {1/12}\log_2(N) - O(1). Our proof…
In this paper we give a new semiprimality test and we construct a new formula for $\pi ^{(2)}(N)$, the function that counts the number of semiprimes not exceeding a given number $N$. We also present new formulas to identify the $n^{th}$…
A fast new algorithm is used compute the zeros of the quadratic character L-functions for all negative fundamental discriminants with absolute value 10^12<d<10^12+10^7. These are compared to the 1-level density, including various lower…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
The quantum search algorithm consists of an alternating sequence of selective inversions and diffusion type operations, as a result of which it can find a target state in an unsorted database of size N in only sqrt(N) queries. This paper…
A concise analytical formula is developed for the inverse of an invertible 3 x 3 matrix using a telescoping method, and is generalized to larger square matrices. The formula is confirmed using randomly generated matrices in Matlab
This paper presents a quantum algorithm for triangle finding over sparse graphs that improves over the previous best quantum algorithm for this task by Buhrman et al. [SIAM Journal on Computing, 2005]. Our algorithm is based on the recent…
For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…
In previous work, the authors introduced the notion of Q-Koszul algebras, as a tool to "model" module categories for semisimple algebraic groups over fields of large characteristics. Here we suggest the model extends to small…
Designing computational experiments involving $\ell_1$ minimization with linear constraints in a finite-dimensional, real-valued space for receiving a sparse solution with a precise number $k$ of nonzero entries is, in general, difficult.…
Using the following $_4F_3$ transformation formula $$ \sum_{k=0}^{n}{-x-1\choose k}^2{x\choose n-k}^2=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}^2{x+k\choose 2k}, $$ which can be proved by Zeilberger's algorithm, we confirm some special…
This paper presents a new O(nlog(n)) algorithm for computing the convex hull of a set of 3 dimensional points. The algorithm first sorts the point in (x,y,z) then incrementally adds sorted points to the convex hull using the constraint that…
We prove the existence of Hall polynomials for $x^2$-bounded invariant subspaces of nilpotent linear operators.
Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…
We introduce a notion of fractional (noninteger order) derivative on an arbitrary nonempty closed subset of the real numbers (on a time scale). Main properties of the new operator are proved and several illustrative examples given.
We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems…
The family of $(k,\ell)$-sparse graphs, introduced by Lorea, plays a central role in combinatorial optimization and has a wide range of applications, particularly in rigidity theory. A key algorithmic problem is to decide whether a given…
This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in arXiv:1304.0708 to global function fields of odd characteristics. First, we present algorithm for checking if a given…
This paper proposes an efficient algorithm (HOLRR) to handle regression tasks where the outputs have a tensor structure. We formulate the regression problem as the minimization of a least square criterion under a multilinear rank…
We introduce a new variational method for the study of stability in the isoperimetric inequality. The method is quite general as it relies on a penalization technique combined with the regularity theory for quasiminimizers of the perimeter.…