« first day (1601 days earlier)      last day (3426 days later) » 

8:00 PM
now pull pieces of the circles up at intersection points appropriately onto the half plane z > 0 to make it the hopf link
 
half-space; and you need to pull one up and the other down
else you get something unlinked
 
you can pull one up and the other up too.
 
Oh, sure. Misread what you said.
 
@Chris'ssis I have not tried it yet.
 
8:02 PM
like this
 
Yes, I understand you now.
 
now imagine you have deleted this guy out from R^3. in the positive upper half of R^3, i.e., z > 0, this looks like two handles deleted out.
 
Yes.
 
now take a point x_0 in the halfplane R+^3. the noncontractible loops wind around these handles
that's as far as i have right now
still thinking about it
 
You're on your way to my two-part van Kampen proof. Make sure to be very careful about basepoints.
 
8:07 PM
i think i'll sleep on it
byes.
 
@BalarkaSen bbye
 
8:25 PM
Yay! I got my joga bonito hat!
Hi @Pedro
@Studentmath okay, so say we have 5 slots. We have two 1's we want to put into these empty slots. Then we can choose 5*4 ways to put them in, or 20 ways. But three items, we get 5*4*3, so it's not the same
 
@robjohn OK
 
@MikeMiller You have a new proof?
 
Nah. We have (5*4)/(2*1) ways to put them in, or 10 ways. For three it's (5*4*3)/(3*2*1)
10 ways as well
 
ohhhh
I see what I did wrong.
 
Because you don't care which 1 comes first - the 1's are undistinguishable
 
8:35 PM
No, @JasperLoy, I meant I could prove his statement using van Kampen twice.
 
@user153330 Good luck for the bounty ^^
 
Aha! So if we had to arrange "1,2" into 5 slots, it would be 5*4; "1,2,3" would be 5*4*3 @Studentmath
Eureka! My combinatorics level is now $2$.
 
Yep!
 
The order of the objects does not matter.
 
If they are precisely the same, yep. You can't differ between 101 and 101 (I switched the 1's)
 
8:45 PM
It's the same for three, because the slots (empty slots) are also indistinguishable
so rearrange three empty slots in 5 spaces
same as arranging two same items in 5 spaces
 
Well yeah, you only have two items - filled slot (mark with 1) and empty slot (marked with 0), so the location of the filled slots defines the location of the empty slots.
 
$$\int _0^{\pi/2}\int _0^{\pi/2}\cos (x) \cos (y) \csc (x-y) \log \left(\frac{\sin (x)+\cos (x)}{\cos (x) \sec (y) (\sin (y)+\cos (y))}\right) \ dx \ dy$$
$$=\frac{\pi ^3}{16}+\frac{3}{8}\zeta(2)-G-\frac{1}{4} \pi \log (2)$$
 
Which gives rise to $\binom{n}{k}=\binom{n}{n-k}$
 
@Chris'ssis The answer makes one think it is doable...
 
@robjohn Yeah, it only seems like that. Actually, it depends on the tools one uses. My luck is that I created a tool that allows me to compute it quickly.
 
8:53 PM
@Chris'ssis Quickly, not fastly.
 
@JasperLoy Is it wrong to say "fastly"?
 
@Chris'ssis fastly is not a word
 
@Chris'ssis Yes. But you could simply say fast there too, though that would be more informal.
 
@robjohn Ooooooooo, OK. I'll never use it again.
 
@robjohn If you have a little time, the first three comments here are now obsolete.
 
8:55 PM
@DanielFischer let me look
 
@JasperLoy OK, thanks! :-)
 
I have been feeling very terrible the past few days, but now I feel better again. I hope it stays this way, at least until after I have started studying next Thu.
 
terrible about what?
 
Well, just my usual mental problems, which are too long to describe in this chat.
 
mental problems suck. brains can be so stupid sometimes.
 
9:04 PM
What's the logic behind the step in this substitution when trying to solve an integral?
$$ \sinh(u) = x \implies \cosh(u)\text{ d}u = \text{d}x $$
 
@Khallil: Depends on the integral
 
$$ \int \dfrac{\text{arsinh}(x) x}{\sqrt{x^2 + 1}} \text{ d}x $$
Does it really matter, @DonLarynx?
I just wanted to understand how they went from the LHS of the implication to the RHS when using the LHS as a substitution, @DonLarynx.
 
@Khallil: Consider the integral $\int_0^1 x dx$.
 
I'm lost.
It's just one half.
 
Well cosh is the derivative of sinh
 
9:08 PM
@KhallilBenyattou Plain old substitution. If we substitute $x = g(u)$, then we have $dx = g'(u)\,du$.
 
I'm more used to seeing $x = g(u) \implies \frac{\text{d}x}{\text{d}u} = g'(u)$, @DanielFischer.
Are the two forms equivalent? I'm really uneasy with 'multiplying' (if that's even what I'm doing) by $\text{d}u$.
 
Huy
@DonLarynx: You could have asked before posting.
 
I did, @Huy.
You ignored it, hence I posted.
 
Huy
@DonLarynx: I never received a question from you in this chat.
 
@KhallilBenyattou If you think in differential forms, the two are really equivalent. Before that, they're only functionally equivalent. But remember the substitution rule $$\int_{g(a)}^{g(b)} f(x)\,dx = \int_a^b f(g(u))\cdot g'(u)\,du$$ for bijective differentiable $g$ to see that they are indeed functionally equivalent. "Replace $x$ with $g(u)$ and $dx$ with $g'(u)\,du$".
 
9:21 PM
Hello @DanielFischer!!! I want to write an algorithm that deletes any element of a heap $H$ in time $O(\log m)$. Could you give me a hint how we could do this?
 
Huy
@DonLarynx: That's not even the differential equation I wrote down, afaik.
 
@Evinda is it max or min heap, or something else?
 
Huy
@DonLarynx: I only saw a message containing "@Huy" and thus had no idea what you wanted.
 
Does this question make sense?? sosmath.com/CBB/viewtopic.php?t=24832
Oh, sorry, @Huy.
 
Huy
9:25 PM
And the ODE you wrote in your post is a different from the one I posted in the chat a few days ago.
 
@Studentmath I assume that a min heap is meant...
 
@Huy is the same ODE as the one here math.stackexchange.com/questions/1076156/…
 
Huy
@DonLarynx: The ODE I posted a few days ago is a different one than you posted on MSE.
 
@Huy: Click the arrow.
 
Huy
?
 
9:27 PM
The arrow, next to "@Huy"
 
Huy
And?
 
Compare that ODE to the one on MSE
 
Huy
The ODE I posted a few days ago was a different one.
 
@Huy: I have a typo.
OK!
 
Nice hat, @MikeMiller :D
 
9:29 PM
The typo has been dealt with and the ODEs are the same now
Suppose we have three empty slots. We can put two $1$'s in these slots. How many ways are there? Clearly, $3*2 = 6$. However, the $1$'s are identical! So really, there's only (dividing by the number of identical $1$'s = $2$) $3$ ways to arrange these $1$'s into these three empty slots.

Are the $1$'s necessarily next to each other?
No, they're not.
i.e. 110, 101, 011
 
9:47 PM
Sorry for the late reply, @DanielFischer. I haven't actually seen that rule before.
Do you know of any books in which I can read more about it and prove the substitution rule?
(I feel like proving it would help my understanding a bit more.)
 
@KhallilBenyattou This is called u-substitution
 
@DonLarynx What if I use another letter? What if I don't like u?
 
I don't like him either, @Jasper.
 
@MikeMiller Of course, you are referring to the letter and not to Don, lol.
 
@KhallilBenyattou Any introductory book on analysis or calculus, whichever applies to where you are, dealing with integration should have and prove the substitution rule. At least for piecewise continuous $f$. Then it's a matter of applying the fundamental theorem of calculus with the chain rule.
 
9:52 PM
@DanielFischer Now you make it sound so simple.
 
What does it mean that the points are $\mathbb{Z}-$linearly dependent?
 
@JasperLoy For piecewise continuous $f$, it is simple. It only becomes non-simple if you go and prove it for all integrable $f$.
 
@evinda one of the points is a multiple of the other
in terms of integers
i.e. (2,4) Z-L.D. of (1,2) or (-1, -2)
but not (-1, 2)
 
@DonLarynx So is it for example $P_1(x,y)=\lambda \cdot P_2(x,y), \lambda \in \mathbb{Z}$ where $P_1, P_2$ are points?
 
Ah, gotcha. I've only done the introductory study of sequences, series and completeness for Analysis, so I'll get to it eventually.
Thanks for your reply, @DanielFischer! ^_^
 
9:58 PM
@Evinda yes
and $x, y \in \Bbb{R}$
 
@DonLarynx Nice.. :)
@DonLarynx Thanks :)
@DonLarynx Could you maybe take a look at an exercise in algebraic geometry?
 
I am unable to help right now
 
@DonLarynx Ok, no problem :)
 
I am working on a combination with repetitons problem
 
Huy
@DonLarynx: I posted a solution.
 
10:00 PM
Aha...
 
@DanielFischer Indeed the two integrals are related, as a couple answers to the question show. But the OP specifically asked if an evaluation using contour integration was possible. And the answer I posted doesn't involve the other integral.
 
Yay! I will take a look at it later.
 
Huy
@DonLarynx: It doesn't answer your question though, I think. But it's a solution to the ODE.
@Venus: How was your date?
 
@RandomVariable Yes. I just wanted to indicate that it wasn't totally absurd to close as duplicate, since different integral limits alone don't guarantee it's not a duplicate.
I should maybe have also mentioned the request for contour integration, but you didn't mention that either, @RandomVariable, so that makes two of us who forgot.
 
@Huy I have a date every day. My date is now 23 Dec.
 
10:12 PM
@DanielFischer Should I edit my post on meta even though the question has already been reopened?
 
@RandomVariable I don't think that's necessary. If it gets re-closed as duplicate, mention it in the new post.
 
this just happened to me.
 
@RandomVariable And by the way, nice job.
 
@DanielFischer Thanks.
 
10:34 PM
@Behaviour Ahh, somebody finally got me. What's the next best 0-downvote post?
 
@AlexanderGruber The one about $\sum 1/n^2$. Here's the full list. Change type to 2 to get answers instead of questions.
 
Hi @Studentmath, are you here?
 
@Behaviour Nice. The answers are doing better. Good to see Arturo still on top.
 
@AlexanderGruber Is Arturo ever coming back?
 
@JasperLoy Doubt it. I met him at a conference once, though. His research is going good.
 
10:42 PM
@Don yep
 
Both answers provided are correct, how can I be of use though?
 
You were too late :p
 
10:58 PM
Could you take a look at this: math.stackexchange.com/questions/1078104/… ?
 
Is $[f(x) - f(y)] /(x - y)$ anything special?
It almost looks like the mean value theorem?
 
@N3buchadnezzar, it is. You can find at least one point between $x$ and $y$ with that value as the derivative.
With the appropriate hypothesis, of course.
 
11:14 PM
@KajHansen Ok.I thought it was a plus and not minus
 
Nope, that's how it appears in the MVT.
 
I am trying to find the solutions to
$$
\frac{f(x) - f(y)}{x - y} = \frac{f(x+y)}{x+y}
$$
 
Do you mean to have $f(x) + f(y)$ in the numerator on the RHS?
Or correct as is?
 
@KajHansen It is correct. Otherwise the function would be a constant right?
 
Probably, yeah.
 
11:17 PM
Mm, I'm tied in hats again. Unless one of the top 3 forgets a timed hat, I'll be remaining this way until I get Treasure Hunter.
 
@MikeMiller Hats of for you
 
@MikeMiller That's a good strategy: keep a hat up your sleeve, so they think they're safe.
 
Perhaps I should stop pursuing my academia Treasure Hunter and only get it on MSE (where I'll get it the day before the event ends).
 
Is that Electorate that you are shooting for?
 
On Academia, yes. On MSE, I've yet to get Steward, and I've done 759 close reviews.
Of course, if I wanted to annoy everyone, I could just make 400-odd edits for Copy Editor.
 
11:24 PM
That'd be risky: things can go wrong with Steward.
 
@Ted's here just in time to see us talk about hats.
 
One can speed up Electorate by downvoting some closed posts between 0 UTC and 3 UTC, so that they become eligible for roomba. Roomba runs daily at 3 UTC, and you get the votes back.
 
Ha ha ... @Jasper: I don't know of the full strength theorem of Nash appearing in any text. Some weaker versions may appear in texts (perhaps Bryant/Chern/Griffiths/Goldschmidt Exterior Differential Systems has a local version).
@Pedro: One of my old friends/students went to grad school with one of your professors at UBA: Have you had Fernando Cukierman (algebraic geometer)?
 
@Behaviour I take it you mean there could be a slow day for close votes? That's why I was going for Electorate on Academia in the first place. I do have a wiggle day, as by the end of 1/2 UTC I should have 999 close reviews.
Do you have a script to pull up posts on an SE site that are almost Roomba-eligible?
 
@MikeMiller This query returns all closed questions which have score <=1 and no answers with score >1. That is, they are either already eligible, or could be with downvotes. There are not many at Academia.
Also, the question must be closed for 9 days for auto-deletion.
 
11:31 PM
I think applying for things is my least favorite part of having a math career
 
Sadly, @Alex, it's a necessary evil: jobs, grants, talks at conferences ...
 
@TedShifrin Yeah undoubtedly
 
So is unappreciative students who make little effort to learn/pass and then blame it all on the teacher.
:D
 
@TedShifrin I haven't accepted that that's necessary yet
 
LOL ... I just read my evaluations ... so I'm frustrated :)
 
11:33 PM
@AlexanderGruber Since you're here, USAMTS question and closer than comfortable one‌​.
 
Someday I will start my own school for X-Men math students
 
What sort of school would that be?
hi @DanielF
 
Hi @Ted.
 
@DanielFischer Huh, what the heck. somebody unlocked the first one?
 
Salut René
LOL, @Mike. I may have just got a hat you don't have :P
 
11:35 PM
@AlexanderGruber Community, apparently.
 
We clearly need spies in all ongoing contests. Sigh.
 
@DanielFischer Dang it that guy is the worst freakin' mod
 
Nope, @Ted. There's only one hat available to you I don't have.
 
@TedShifrin It would probably be worth it for us to try to compile a big list of contests to watch out for.
 
You got the business/party hat?
 
11:37 PM
@AlexanderGruber Could be that Michael pushed the wrong button and only locked it for one hour, maybe.
 
Yeah, @Alex, along with all dates :(
I won't ask Alex who the worst freaking mod is ...
 
@DanielFischer Right now locking only comes in four denominations: 1 day 1 week 1 month and forever. So we generally have to lock things forever and then flag them ourselves with a reopen date, and let the flag sit till then. Really clogs the queue up I wish they'd change it
 
Wow @Behaviour
 
11:39 PM
@Behaviour You see? My moderator will is so powerful it literally changes the past.
 
The answer there reminded me of a notable meta-user... zyx was away since mid-June, but apparently is back now.
 
@Behaviour Oh, I didn't realize he was back.
 
oh, that's a shame.
 
LOL ... you say that every time I come back, @Mike
 
11:40 PM
He left right when MK was banned if I remember
 
Hey @TedShifrin!!! Could you maybe take a look at this?

http://math.stackexchange.com/questions/1078104/the-sum-of-three-collinear-points-is-zero?noredirect=1#comment2193744_1078104
 
well, MK's timeout has yet to end, so he's no good excuse to come back.
 
@TedShifrin Have you run into Rene again?
 
no, we have a new young René here
@evinda: You need to review how addition on the elliptic curve is defined.
 
@AlexanderGruber I just remembered MK. Wonder if he still has an account...
 
11:44 PM
@Ted When we say young, do we mean 14? (There's another new user on main I think you could be referring to, but I've yet to see an actual problem in his answers.)
 
@Jasper: I wouldn't worry about Nash embedding if I were you :P
 
hi
 
@TedShifrin Well, I was just trying to talk about something with you.
 
I believe his profile says 15 ...
hi @beginner
 
@JasperLoy i think he still posts on MO
 
11:45 PM
i got grounded lol
 
@Behaviour Those questions do gain me a day on my Academia Treasure Hunter, though I don't really need it.
 
LOL, ok :) @Jasper ... I've never read the complete proof, but I've seen most of the theorem in a graduate course I took many moons ago.
 
But I am back now
 
which is probably the best place for his questions, anyway (the ones that were in line with the format at least)
 
Oh oh, @beginner. What did you do?!
 
11:45 PM
@TedShifrin I know that Taylor's PDE III proves the compact case.
 
@beginner Are you an airplane?
 
ah, that makes sense ... I don't know that book, @Jasper
smacks @Alex
 
Do any math in the meantime @beginner ?
 
heya @Kaj !
 
@AlexanderGruber haha real funny :P
 
11:46 PM
For what it's worth, grades are all turned in now, @Kaj.
Were you doing too much math, @beginner?
 
Hey there @TedShifrin. So I've seen, though Cameron still hasn't gotten his.
Unless you're referring to your grades, haha
 
I wonder how that can be, @Kaj ...
 
I had my grades in days ago.
 
@kaj yeah I learned how to do integration stuff for fun, but I don't know derivations yet
 
11:47 PM
Who here knows what the best programming language/software/whatever is for solving super high degree polynomial equations?
 
That's interesting @beginner. Usually one learns derivatives first, but I suppose it's possible to learn integration first. At least up until the fundamental theorem.
 
hand, @AlexanderGruber
 
Just the superbasics of integration
 
Mathematica's great but slow and I need power.
 
There is algebra-oriented software, @Alex, on which I'm no expert. Magma, maybe?
 
11:47 PM
@TedShifrin, Athena says the deadline is Dec 23. It's only the 22nd.
 
Magma is nearly unusable, @Ted
 
@KajHansen Well, Apostol's calculus text teaches integration first.
 
Oh, I have serious algebra colleagues who use it all the time, @Mike.
 
Magma is awesome but I can't use it because my advisor won't let me :(
 
@Kaj: Grades were due at 5 PM today.
 
11:48 PM
It's usable because they're serious algebra colleagues, @Ted. You really have to work to penetrate it at all.
 
Oh, I talked to him around 4
 
ROFL @Alex ... Adviser won't "let" you?
 
Like into 6x^2 = 2x^3 and into cos = sin
 
@AlexanderGruber You mean it's only on his machine?
 
@TedShifrin Evidently he got really pissed off at the guys who made it like a decade ago
 
11:49 PM
Oh, I see, @Alex. How funny. Who's your adviser?
 
and now he refuses to sign the department up for a discount
 
It may be because I'd previously learned Python, but Sage is my go-to CAS.
 
@ted I got grounded for yelling at my mum for turning off the computer when I was doing a math thing on it yes lol, I shouldn't do that next time
 
Yeah, @beginner, yelling at your mum is never a good idea.
I think she also wants you to be more well-rounded, even though you love math so much.
 
@beginner Well, if you are grounded just for yelling, that's too strict.
 
11:50 PM
Yeah yelling at my dad is fine but at my mum enrages my dad lol
 
@TedShifrin I'm pretty cross - all of the grades are in, but the instructor hasn't finalized grades, so I still can't read my evals.
I hope she does it tomorrow.
 
@TedShifrin Actually I'm speaking hyperbolically/prematurely when I say advisor. It's Dr. Peter Sin, who is one of four options I'm considering to be my advisor. He will definitely be on my committee.
 
Ah, I don't know him, @Alex.
Not surprising.
 
@AlexanderGruber Wow, it's his Sin for not letting you use Magma.
 
Macaulay was developed for a lot of commutative algebra/algebraic geometry years ago. Some people still use it.
smacks @Jasper
 
11:51 PM
He is... extremely sharp. I am consistently impressed with him.
 
I've not heard anyone say poor things about Macaulay.
 
@kaj why are dual graphs so hard to make
 
@Behaviour When does the vote-catching script run daily? I've got a bunch of upvotes from yesterday that are surely going to be reversed.
 
You're doing graph theory @beginner ?
 
would never upvote @Mike ... never
 
11:51 PM
@kaj I have only made one so far, and it took gages
 
@MikeMiller Should be around 3:00 UTC, which is in two hours.
 
@Kaj, Mark and one of his students were here for the afternoon visiting me.
 
Just for fun
 
I'll see how that goes when the time comes.
 
He is the one who helped me with that $G\times G\rightarrow H\times H$ question, and it only took him about an hour to find the key idea
 
11:52 PM
Three hours by my watch, @Behaviour.
 
@TedShifrin, I saw that on Facebook! Did you guys have a good time?
 
Yes, that's right.
 
I gave them lots of problems to think about ... and gave away about 4 books.
 
You devil.
 
LOL ... I could have given away Gunnings, @Mike.
 
11:53 PM
@beginner, were you looking at a graph with lots of faces?
 
I made a few theorems of my own @kaj, all isomorphisms of a planar graph have the same number of faces, I had a proof but I cant type up here
 
I've moved on from Gunning, @Ted, since our library does indeed have it and I don't have that much desire to personally own it. Now if you could just give me everything you own about 3- and 4-dimensional topology and geometry...
 
I don't have much of that, @Mike ... not my thing.
 
Tragic!
 
Except Donaldson/Kronheimer.
 
11:54 PM
@kaj my working one had 6 vertices and I can't see how many faces, but it is like a circular dual graph
 
@MikeMiller So are you getting into knot theory?
 
I lent my Lawson CBMS lectures to someone ... so I don't even have that :(
 
!!!
 
@TedShifrin Lending books is like giving them away. They never come back.
 
Is my theorem true "all isomorphisms of a planar graph have the same number of faces"?
 
11:55 PM
I used to keep careful track, @Jasper, but now I'm trying to empty out my office. I have many hundreds of books that I don't have room to keep as I move on.
 
@beginner what's a face of an isomorphism?
 
A professor at Santa Clara writes in all of his books "Stolen from Bob Bekes"
 
LOL @Mike
 
@alex I meant the isomorphic graphs
@alex number of faces is not changed
 
isomorphic graphs must certainly have all the same numerical invariants, @beginner
 
11:56 PM
is number of faces a numerical invariant, then? or does it depend on the embedding?
 
@ted I don't think that is true with faces if it isn't planar though right?
 
If it's not planar 'face' is not something that makes sense for a graph, no
 
what is an isomorphism of graphs? ... just defined on edges and vertices?
 
It astonishes me how much studiosus knows about, like, everything.
 
Oh okay awesome!
 
11:57 PM
Consider that, if $f:G \rightarrow G'$ is a graph isomorphism, then vertices $u, v$ of $G$ are adjacent if and only if $f(u), f(v)$ are adjacent in $G'$.
 
you define a face by which edges/vertices it has
 
(I have no idea. Planar graphs is infinitist sorcery disguised as nice well-adjusted combinatorics.)
 
yeah, @Mike, I'm very curiousus about who studiosus is ... we've interacted obliquely quite a bit.
 
There's lots of isomorphism properties @Ted
 
Yeah I though it was same vertices and edges frok what I read
 
11:58 PM
@TedShifrin Whenever he takes an interest in one of my questions, he provides a better answer than I'd imagined, usually with explicit references to the original literature.
 
@Don: I immediately confess that I know only epsilon about graph theory.
 
But form gets to do whatever it wants, but faces only being defined on planar graphs makes heaps of sense
 
That's ok @Ted
 
Yeah, @Mike, I would agree he's a gem. I haven't found much in geometry that he's screwed up, if anything.
 
@beginner I thought you were studying algebra? You switched to graphs?
 
11:59 PM
@TedShifrin Faces are a numerical invariant; I can only prove this using algebraic topology.
 
@jasper I go where my curiosity goes hehe
 
Well, to me a graph should include among its data what vertices form a face :P
 

« first day (1601 days earlier)      last day (3426 days later) »