@UserX You could post in a comment there when reading it. I reply to comments. Except those that are about me downvoting on Math.SE; those comments are very short-lived.
@Rafflesiaarnoldii All I remember is that it was an article where you said 0 was in the middle of the real number line and I had an objection. Can't remember the content, I remember(maybe) the date;2006
@Rafflesiaarnoldii That's not my question. When a user is deleted, the community bot places his rep points as bounty to questions from what I understood. How are these questions chosen?
@UserX No, you misunderstood. The user posted those bounties on their own, prior to deleting the account. When the account was deleted, the ownership of bounties was transferred to the Community bot. If the user simply deleted account, no such bounties would appear.
Ohh lucky me. I am trying to find papers about $G(n,p)$ when $p=1/n$. Can anyone direct me to such? I can only finds one discussing the situation after the critical phase, before it, or near the ends of it..
I found some really nice papers (by Israeli and Korean researchers!) detailing very finely the case around the end of the critical phase, but never inside, certainly not exactly at $p=1/n$ :/
@AlexanderGruber - Thanks for the Halmos recommendation. Much appreciated. :) I currently have Epp... and will probably use it for now. I feel though, that Epp doesn't cover enough on algorithms. What would you recommend for books on combinatorics and graph theory?
"You, my friend, are about to witness the best card trick there is. Here, take this ordinary deck of cards, and draw a hand of five cards from it. Choose them deliberately or randomly, whichever you prefer--but do not show them to me! Show them instead to my lovely assistant, who will now give me four of them: the 7 of spades, then the Q of hearts, "
the 8 of clubs, the 3 of diamonds. There is one card left in your hand, known only to you and my assistant. And the hidden card, my friend, is the K of clubs"
@Clarinetist There are more serious graph theory books out there, but Chartrand's is a good bang for your buck, and should do you right for the purposes of the GRE at least
if you want to go beyond that and are willing to put in the time, diestel and diestel is the standard for advanced undergrad/beginning grad graphs
i took a combinatorics and graph theory combination course that used brualdi... i didn't like it and can't recommend it in good faith, but it is the only one I know of that fills the gap between chartrand and diestel.
For algorithms, they probably only mean the stuff you'd run into in a basic number theory course or a basic graph theory course, like minimal spanning trees and stuff. Cormen and Leiserson is a really great book about algorithms, though, really a good thing to pick up even if it does go beyond what you will need for GRE
@Clarinetist I don't intend to study discrete math for the GRE at all, lol. Penner's Discrete Mathematics covers logic, set theory, number theory, combinatorics and graph theory, five in one.
when the GRE guys say "number theory" what they really mean is modular arithmetic. They want you to know fermat's little theorem, $\mathbb{Z}/{mn}\mathbb{Z}\cong \mathbb{Z}/{m}\mathbb{Z}\oplus \mathbb{Z}/{n}\mathbb{Z}$ when $n$ and $m$ are coprime, what you can take inverses of modulo $n$, etc.
@AlexanderGruber Munkres point set topology is too long winded. His algebraic topology does not cover many theorems. His differential topology is too thin. I hate all his topology books.
@JasperLoy I thought his point set topology was really good but I wish I would have taken it two years earlier. By the time I got to it I was really sick of proving theorems about metric spaces
I used to work for an actuarial study materials company. I was really getting frustrated when they used "probability space" and "sample space" interchangeably for an ENTIRE probability study manual. [I'm not working there anymore :) ]
If we let $G$ be a group. A subset $H$ of $G$ is a subgroup if and only if it satisfies the following three conditions (a) $1 \in H$ (b) if $a,b \in H$ then $ab \in H$ (c) if $a \in H$ then $a^{-1} \in H$.
@AlexanderGruber - I think that's a safe assumption to make if they're just learning about subgroups... but I'm not an algebraist by any means, so I might be wrong. :P
but if you are using a different multiplication, then not necessarily. MOST books (and people) consider it necessary for the operation to the same, but some don't
The only way it could make sense to me is if in the bits involving $c_1\wedge w_2$ they were talking about taking the chern class mod 2, and that the integral was notation for Poincaré dual.
Being able to put some trivial bounds on a couple integrals that tell you the answer can be only one of the five is nice. Saves a lot of time over evaluating an ugly trig integral.
Only reason I'm considering taking it is because I come from a middle-of-nowhere university and feel like I have to compensate for that. I just asked for three letters of recommendation - hoping they all had good things to say about me.
Yeah, hate to say it, but I didn't choose the right courses for the Math GRE. I switched from actuarial science to statistics and really, the only courses I took that were good preparation outside of the calculus sequence were two semesters each of analysis and algebra.
I've tutored calculus for 4 years and have never used this stuff. I'm talking about stuff that you would use if you were to teach a high school geometry class.
I was really ticked. Right after the exam, I looked it up on Wikipedia and thought... well, that definition is very vague. I just checked - the term is in my Schaum's Outline for Geometry. Definitely will finish going through this when I'm done.
@MikeMiller there was one question on there where it had an additive cyclic group and it asked you which of several subsets was a subgroup, none of the choices contained 0
even running on 2% of my brain that would never get past the filter. It was not written by an expert. at most, a mathematician who works far away from algebra, and didn't remember it well
I am not looking forward to reading Baby Rudin for the first time. Hopefully what I've learned so far will help me get through it, but it's hard to not feel like my undergraduate background was insufficient compared to many others' backgrounds.
@TedShifrin - Surprises me to hear that. I heard Rudin was necessary for passing the exam, and that Royden is overkill. I've even heard of people using Royden to study for the Math GRE.
One last textbook question, I promise! What's a good for a numerical analysis text? Also, is there really just a ton of formulas to memorize for this section of the test (if there even are such questions)?
@robjohn Rudin has good problems, but he sucks the life out of analysis. (of course, this is coming from someone who hates analysis, so grains of salt must be taken)
See ets.org/gre/subject/about/content/mathematics : from the 25% section - Other topics: general topology, geometry, complex variables, probability and statistics, and numerical analysis .
@robjohn Chris posted some question of his without using [text](link) so I said "You'll never learn to [altext](link); will you?". He said "Kid, I'm not playing with your games. Talk like that with your mom, pap, and the professors you want to." I said "U MAD?" She responded something with "GFY", and got banned.
For those of you who have gone to graduate school (I assume the majority of you), what do you wish you had done while you were still in school? [Prospective grad student here.]
@Chris'ssis Please be nice. This is not the first incident of rudeness from you, further ones will lead to a much harsher suspension than the one I just placed on you.
@MikeMiller So it appears that he did put her on a suspension
@PedroTamaroff Simply connected Riemann surfaces are conformally equivalent to one of the disc, plane, or sphere.
Amusingly re: how much you ask of holomorphic functions; if you try to take it one division ring higher and ask about quaternionic differentiability (in the obvious sense), then the only functions you get are the linear and constant ones.
this is like the sixth sense where Bruce Willis finds out he's dead. of course you're going to deny it for a little while. but it's better to know the truth.
Baire's Theorem says that if $X$ is a complete metric space and $$X=\bigcup_{k=1}^{\infty}A_k,$$ then there exists an $n$ s.t. $\stackrel{\circ}{\overline{A_n}}\neq\emptyset$. However, is it possible to have $\stackrel{\circ}{A_k}=\emptyset$ for all $k$ ?