Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
2
votes
Accepted
The pointwise Lipschitz-ness of a function on a dense set, implies its pointwise Lipschitz-n...
Converting comment to an answer:
Let $M = [0,1]$ with its usual metric (which is a length space), $X= \mathbb{R}$ and let $f : [0,1] \to \mathbb{R}$ be the Cantor function. …
4
votes
0
answers
339
views
Can knot non-equivalence be a proof-of-work for a cryptocurrency?
Regarding a question about proofs-of-work and following up on this answer and the comments therein, I believe we can, at least in theory, come close to having the hashing resources used in cryptocurrencies … If $G_1$ and $G_2$ can be easily converted to one another, however, then the space may be smaller, and it may become harder to hash on to a long string of $0$'s. …
5
votes
0
answers
280
views
Mixed structures on Hom spaces induced by mixed sheaves
My question: If $M,N$ are pure pointwise pure (see Geordie Williamson's comment below), then is the induced structure on $Hom(rat(M), rat(N))$ pure? … If the answer is no, under what additional conditions (other than requiring $X$ to be smooth and complete plus $M,N$ being the `constant' sheaf) can the answer be converted to yes? …
4
votes
1
answer
637
views
Do runtimes for P require EXP resources to upper-bound? ... are concrete examples known? (an...
Update #3:
To appreciate why it may take awhile for a concluding summary answer to appear, please see Luca Trevisan's comment (below) that begins "By the way, your question, and my answer, do not affect … Thank you all for your patience, and thanks go to Luca Trevisan, especially, for his comments. …
7
votes
Accepted
$\sum_{k=1}^n\frac{\sin kx}{k^\alpha} >0\quad\text{for all}\ n=1,2,3,\ldots\ \text{and}\ 0<x...
Comment by Cherng-tiao Perng converted to an answer: It appears that Theorem A of this paper solves your problem. …
1
vote
4
answers
1k
views
Kro-necker versus Kron-ecker: which hyphenation is preferred? [closed]
Synopsis and concrete practices
Everyone is thanked for their comments, and in view of the diversity of views expressed, I have converted this question to a community wiki. … Therefore, instantly "accepted" will be any MathOverflow answer that provides a standardized "\hyphenation{...}" file (including mathematician's names) from any respected mathematical journal or publishing …
2
votes
spaces of probability measures on a Polish space and the convergence
Converting Ofer Zeitouni's comment to an answer:
Billingsley, Patrick. Convergence of Probability Measures.
Ethier, Stewart and Kurtz, Thomas. Markov Processes: Characterization and Convergence. …
5
votes
Accepted
Is every finite lattice isomorphic to a union-closed family of sets containing $\emptyset$?
I am converting my comment into an answer at the request of the proposer. Given $x\in L$, let $S_x=\{y\in L\, :\, y\not\geq x\}$. …
13
votes
2
answers
693
views
in search of a transformation between determinants
I can show $\det A_n=\det B_n=2^{\binom{n+1}2}$; it is not a problem (see, for instance, my answer here).
Question.
(1) Is there a transformation converting $A_n$ into $B_n$ (or vice-versa)? … Then, $A_n$ and $B_n$ share the same Smith normal form (showing the diagonal vector) given by
$$[2^{\max(4k-2n+s(n-k)-s(k),0)}:\, 1\leq k\leq n].$$
This claim is based on data from Noam Elkies' comments …
12
votes
1
answer
858
views
Connected components $0-1$ matrices
Can every $0-1$ be converted to a matrix of one component by permutations of rows and columns?
What classes of matrices cannot have one component? … Christian's answer based on fedja's comment solves the problem. Infact the approach can be recursively used to get multiple component matrices for any constant number of components $k$. …
2
votes
Accepted
Slight strengthening of Iwasawa's criterion
(Converting Mark Wildon's comment and mine into an answer.)
Your strong version of Iwasawa's Criterion is Theorem 1.2 of the following book:
Donald E. …
5
votes
Accepted
Typo in Stanley, Enumerative combinatorics II, Cor. 7.23.9?
(In order that this question appears as answered I'm converting Richard's comment into an answer.)
The (somewhat nonstandard) convention in the text, stated just before the corollary, is that $[n]! …
4
votes
Accepted
Does the maximal compact subgroup always act transitively on a compact homogeneous space?
(Comment converted to answer per request:)
The “surprising result” about simply connected homogeneous spaces in your (currently) last paragraph is Montgomery's Theorem (1950): generally (in your notation …
2
votes
Does Bergman metric induce the standard topology?
Let me convert my comment into an answer with references. …
1
vote
1
answer
462
views
What does "can almost be proven in PA" mean regarding Theorem 2 of Timothy Chow's expository...
Note that this is an inductive procedure for constructing PA proofs of individual instances of Theorem 1′ and cannot be converted to a PA proof of Theorem 1′ itself; however, it illustrates that each instance … to IamMeeoh's mathoverflow question—my comment])? …