Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
178 views
+50

On a probabilistic integer factorization algorithm given bounds for one prime factor

We got a probabilistic integer factorization algorithm and experimental evidence with large integers given bounds for one factor. Let $D \ge 2$ be real number and let $p,q$ be primes and $N=pq$. ...
joro's user avatar
  • 25.4k
3 votes
0 answers
83 views
+50

Tight upper bound for $m[Q^k - Q^{k+1}]$ for completely positive linear maps

Let $m: \mathcal{L}(\mathbb{R}^{d \times d}) \to \mathbb{R}$ be the function $$ m[H] = \frac{\lambda_{\max}(H[\mathbf{I}])}{\lambda_{\max}(H)}, $$ where $\lambda_{\max}$ denotes the largest eigenvalue....
Ran's user avatar
  • 73
11 votes
0 answers
320 views
+50

Sobolev's PDE Scottish Book Problem (Problem 188)

In 1940 Sobolev recorded the following problem in the Scottish Book, and offered a bottle of wine for a solution. In 2015, when the second edition of the Scottish Book with updates and commentary on ...
Mark Lewko's user avatar