17,584 reputation
25592
bio website
location
age
visits member for 4 years, 7 months
seen 1 hour ago

3h
comment Is the set AA+A always at least as large as A+A?
@VladimirDotsenko an explicit example that contains $-1$ would be $\{-1,1,2,3,6,10,11,12\}$ (which is just the set that GH mentions shifted). The paper I would have mentioned but GH's reference is more recent and quotes this one.
6h
reviewed Close Non-discrete modularity measure in graph analysis
8h
comment Is the set AA+A always at least as large as A+A?
@YaakovBaruch the idea is good but at least for $a=-1$ there are examples. In fact this question, that is the question of sets with less differences than sums, got study in recent years.
8h
comment Introductory texts to mathematics
@DavidRicherby I think it is not pronounced that way, though, but rather with the vowel like in "you."
9h
comment Introductory texts to mathematics
The following question seems pretty similar mathoverflow.net/questions/186244/… // I now note you gave an answer there. I think it could help if you explained more specifically what you are looking for and what woudl be the difference. Else, we will get just again about the same list (which is about the same as quite a few thers), as initial answers show.
9h
comment Introductory texts to mathematics
The first, Courant and Robbins, is mentioned in the question.
10h
comment Random Diophantine polynomials: Percent solvable?
@JosephO'Rourke the problem of estimating this is known as Dirichlet divisor problem and there are better estimates than what I gave. See mathworld.wolfram.com/DirichletDivisorProblem.html for an overview. I think the extual error term should be only slightly larger than a fourth root of $C$, what is known is order $C^a$ with $a=131/416$. I do not know right now what is known regarding the implied constants. For the weak error term I give $6$ would work IIRC.
10h
comment MatLab loop which stops after X iterations
Stack Overflow and Computational Science do in principle deal with such questions. I am not sure if this particular one will be on-topic there.
10h
comment MatLab loop which stops after X iterations
This site is for questions on research in mathematics, not about basic programming questions. You might find help on some other site in the SE network; but you might polish your question a bit before asking it elsewhere.
11h
comment Is the set AA+A always at least as large as A+A?
Given the comments above, could you please align the question in the title and in the body that seem slightly different.
11h
reviewed Close Green`s function
11h
comment Estimation VS detection
Welcome to the site. Your question was put on hold as it is, at least to me, not quite clear what is asked for exactly and how it relates to current research in mathematics. Possibly a revised version of this question, you can edit posts, could be reopened. Or, it might be better to ask it on another site such as Cross Validated the site for statistics in the SE network.
13h
comment Random Diophantine polynomials: Percent solvable?
I changed the notation in a different way to make clear that indeed this is the intent. Thanks for pointing out the confusing notation.
13h
revised Random Diophantine polynomials: Percent solvable?
changed notation on comment
21h
answered Random Diophantine polynomials: Percent solvable?
1d
comment Koopman representation, weakly compact action, Ozawa Popa
You can just add the dollar-symbols as usual in LaTex and alike and the math renders.
1d
revised Koopman representation, weakly compact action, Ozawa Popa
added dollars
1d
revised Trilateration problem
tag, minor cleanup
1d
revised Construction of an integral point set given the set of distances, its minimal description to get a measure of its complexity and its unique identifier
clen up; tag; edited tags
1d
comment Can Shor's Algorithm be modified to run efficiently on a classical computer?
It can be easier to typeset matrices using the command that exists to that end $\begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix}$ $\begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix}$