« first day (1417 days earlier)      last day (3606 days later) » 

12:00 AM
Or go to sleep and do it tomorrow :)
 
Sleep before that. However I will do Z__I_5 thingsy
$\Bbb Z_5[i]^*$
 
12:19 AM
"We apologize for any inconvenience, but an unexpected error occurred while you were browsing our site. It’s not you, it’s us. This is our fault. Detailed information about this error has automatically been recorded and we have been notified."
 
$\Bbb Z_{29}[i]^*$ click to see better
 
Fuck Hypnotoad. All hail Hypnocayley.
 
No comment.
G'night, @Alizter
 
@TedShifrin Good night! I shall go too!
Good night every body!
 
dats a mesh
@PedroTamaroff what are you studying this week?
 
12:28 AM
Why are these damn sites always read only lately?\
 
@EnjoysMath Combinatorics.
 
@PedroTamaroff specifically?
 
At the moment graph stuff.
 
@ComTruise neet name, that's a band?
algebraic graph theory?
 
hehe yes
 
12:29 AM
Gave up on sleep. Can anyone explain the 3+3+3+6(v(G)-3) step in this paper: math.uwo.ca/~srankin/courses/2156/2012/ass10.pdf
 
@Studentmath I think I have the proof now.
I am writing it down.
 
don't write it down, write it up!
down sounds negative, bro
 
Let me know how it goes @Pedro
 
My first step was showing that $\# N(v)\leqslant n$ for any $v\in G$.
 
@Studentmath you are aware your paper is called ass10.pdf?
XD
 
12:32 AM
Assignment 10.
 
They abbreviated to a synonym for butt to be funny
 
@enjoys that's nice. It's less nice someone in the world gets this as the sole question in the assignment, but still.
 
@Studentmath what's a simple planar graph?
 
It's a graph without loops/multiple edges that can be drawn in a plane without two edges crossing each other
Graph theory wise, it's a simple graph that has no $K_5$ or $K_{3,3}$ subgraphs, not even inuced by elementary subdivision operation
 
I get everything except the last part after the comma
 
12:42 AM
@EnjoysMath A planar graph is one that can't be drawn in the plane without self-intersection
 
we should be back in read write mode!!
 
The subdivision operation is an operation where you take a uv edge and make it a u,w,v path, or vice versa.
 
add vertices ?
 
Now I am off to sleep. @Pedro ping me once you have it done, will check it tomorrow, interested in how you did it in the end!
@Enjoys add a vertex and two edges, yes.
Or 'eat up' a vertex
 
one might note that this characterization of planar graphs is not a definition, it's a nontrivial theorem
 
12:45 AM
Night ... AGAIN ... @Studentmath
@Mike ... Your statement is a negation off.
 
kuratowski's theorem is trivial?
 
@Studentmath I have it,.
It's a bit informal, I think, but I will ask my professor and see what he thinks.
@MikeMiller Prof said it has a topological proof, and that it should be understandable to undergrads.
 
ah, that makes it trivial
 
oops
 
12:58 AM
Uh huh. Apology accepted.
 
@TedShifrin What is he apologizing for?
 
For being snippy at me? ;)
 
I would never be snippy
 
Between snippy and Hippa's memes, I should skedaddle.
 
1:16 AM
@TedShifrin Aw, Ted.
Please!
 
Am I reading it wrong or is the quote from Ahlfors in the answer to this question still saying that the number of singularities must be finite?
 
I really dislike these nonsensical downvotes. At the request of a comment, I add some explanation to this answer, and immediately get a downvote.
 
@robjohn That's nuts.
 
@AntonioVargas I didn't understand the first downvote, but the second one is just beyond my comprehension.
 
maybe someone hit the wrong button
 
1:30 AM
@ComTruise There have been enough downvoting of good answers going on that I generally discount that idea
off to the park... BBL
 
@CHELL
 
user97303
Hey @ComTruise
 
user97303
(I don't know how to put tex)
 
I dont understand what is going on in that matrix
 
user97303
the natural numbers
 
user97303
1:43 AM
the first row is 1, 2, 3,... up to n
 
user97303
the second line is n+1, n+2, etc
 
oh ok
 
It goes up to n^2?
 
user97303
yes
 
user97303
maybe even more
 
user97303
1:43 AM
if m>n
 
up to n*m
 
user97303
yes
 
user97303
now, is it true that the rank of this matrix is min(m,n)?
 
user97303
intuitively I've been trying to figure this out from modular arithmetic
 
user97303
but my background isn't very strong in it
 
1:47 AM
maybe a good question for the site
it doesn't look obvious
 
user97303
I don't know, I don't like posting questions because they get flagged and marked for deletion
 
Post your question. If it is well written and you show your work, it won't be closed.
 
user97303
alright, @PedroTamaroff, I did
 
user97303
0
Q: The rank of a matrix with the natural numbers in ascending order.

chellSay you have a matrix, $\begin{bmatrix}1& 2& 3& \dots& n\\(n+1) &(n+2) &(n+3)& \dots &(2n)\\(2n+1) &(2n+2) &(2n+3)& \dots &(3n)\\ \dots &\dots &\dots &\dots &\dots \\(m(n-1)+1) &(m(n-1)+2) &(m(n-1)+3)& \dots &(mn) \end{bmatrix}$. Is it true that for any such matrix $A(m,n)$, $rank(A)= min(m,n)$?...

 
I'm confused @chell: it seems to me the rank is $2$ whenever $n\ge 2$.
 
user97303
1:56 AM
wait, nvm , I don't know what I was thinking
 
Did you mean something else?
 
user97303
I was thinking of something else, but I didn't write it down, so I guess I remembered it wrong
 
user97303
well, whatever
 
@chell subtract the 2nd from the 1st, then 1st from the 2nd columns. then the first two columns are (0 n 2n ...) and (1 1 ... 1) respectively, and everything else is a linear combination of them
 
I've been known to do that.
 
user97303
1:57 AM
yeah, I realised it after I typeset it
 
(that was the answer I was writing before you deleted)
 
Similar argument with rows ...
 
user97303
sorry, I'd delete these posts if I could
 
Hi @Ted
 
Boo
 
2:00 AM
ew
 
Heya @Karl
 
that's what I say when I see @Karl
 
@blue, are you the new incarnation of turtles?
 
it's turtles all the way down
 
Down to where?
 
@TedShifrin it is, yes
 
@FernandoMartin
 
Ah ... Ignorance be bliss.
 
@TedShifrin Somewhere below my location.
I'll give you more information as it comes in.
 
Hi @Fernando
Gee thanks @Karl
You're more anonymous than all of turtles ...
 
2:07 AM
@Ted Breaking news! It's at least ten feet below!
 
hey there @Pedro, @Ted
 
@TedShifrin What's this measure of anonymity?
 
LEL
16
Q: Why didn't Britain's nuclear weapons deter Argentina from invading the Falklands?

Colonel PanicThe United Kingdom has nuclear weapons. All the [major] political parties support this policy. A common justification heard is that they are a deterrent against foreign aggression. For example: UK nuclear deterrence policy consists of 5 main principles: preventing attack - the UK’s nu...

 
I guess I have deleted system32 more times than anon has
 
@KarlKronenfeld If someone worked hard enough they could probably figure out who anon is
 
2:08 AM
@MikeMiller I think Jayesh Badwaik has worked sufficiently hard. So you are correct.
 
I've talked enough to anon that I know more than I expected to.
But @Karl stays opaque.
 
Argentina invaded the Falklands?
 
@TedShifrin True, skull and I are probably twins.
No idea who the hell that guy is.
 
just a troll like you
 
Yeah, but @Karl knows math.
 
2:13 AM
Could someone help me count?
 
No. I cannot.
 
@PedroTamaroff I can get up to seven, tops
 
@PedroTamaroff My computer can.
 
"You haven't voted on questions in a while!"
piss off, I'll vote what I want
 
I need to count triangles in a graph. Prove there are at least $\frac E{3V}\, (4E-V^2)$ triangles in a simple graph.
 
2:15 AM
Now someone posts asking to translate a problem from German to English. What is this place?
 
@TedShifrin That's fine!
 
I will answer a specific question, but I'm not going to translate a page.
 
@TedShifrin Voted to close as not math.
 
Being multilingual is a curse :)
But one needs to know math to translate, @Mike ...
 
@FernandoMartin
 
2:18 AM
Ok, voted to close as not math as defined in the help center.
 
I have already proven that given an edge $\{vw\}$ there are at least $\deg v+\deg w-V$ triangles including that edge.
Now I need to sum some stuff and use $\sum_{v\in G}\deg v=2E$.
 
Planar or not, @Pedro?
 
It says "simple graph".
That's it.
 
@TedShifrin I have 25 bucks to spend on a book.
 
I'm working on it, anyways.
 
2:21 AM
Positivity in Algebraic Geometry II is $26... :D
 
Here's a dollar
 
I'm amazed there are any books for less than $60.
 
Is it published by dover @MikeMiller?
 
@TedShifrin Well, I'd probably need to know algebraic geometry and have read Positivity in Algebraic Geometry I.
@KarlKronenfeld You won't believe who it's published by
 
@MikeMiller Cambridge University Press?!
 
2:23 AM
Well, Springer, actually
CUP wouldn't put something for so reasonable a price.
 
Still surprising
 
trying to decide what I'd like to read about
I'm open to suggestions
 
Thanks guys. =/
 
welcome
 
@PedroTamaroff I have been thinking about it pal. :D
Just haven't made any real progress.
 
2:26 AM
@Pedro: For reasons I don't understand yet, for regular polyhedra we get equality.
 
@KarlKronenfeld Let me tell you what I've done.
The number of triangles containing edge $\{vw\}$ is $|N(w)\cap N(v)|$.
 
I think I had this exercise in my graph theory course
I vaguely remember it being gross
 
By the usual inclusion exlusion this is $\geqslant \deg v+\deg w-V$.
Since $|N(v)\cup N(w)|\leqslant V$.
 
So given an edge $e=\{vw\}$ there are at least that many triangles in $G$ that contain it.
Now we need to sum that thing appropriately.
 
2:28 AM
That's where I'm stuck
Not sure how to tell how much I am overcounting
 
We're counting each edge three times, as I see it.
 
I could get Kirby-Siebenmann for $25 even
hmm that's +shipping
 
@Mike: Did you win the lottery?
 
dover books?
 
2:31 AM
I graduated, @Ted
I wonder if this would be a well-accepted MSE question
 
@PedroTamaroff We're counting each edge three times for each triangle it belongs to.
 
@KarlKronenfeld Yes, that's what I am trying to say.
 
4E-V^2 looks like the discriminate of a quadratic, so I wouldn't be surprised if you end up doing some algebraic manipulation here, getting a quadratic polynomial.
 
Huh? @Karl
 
@TedShifrin I've seen that in graph theory, I have.
I once attended a course in Rosario.
 
2:34 AM
No, I meant counting each edge 3 times ...
 
@TedShifrin What do you mean?
 
If we have a closed surface, then each edge is in two faces, but that needn't be true.
 
Yeah, what did I mean there.
 
Each face has 3 edges ?
 
Face of what?
 
2:36 AM
Face = triangle
 
Well, yes that is what a triangle is...? =P
 
@TedShifrin Face is the wrong word here I think, we're not assuming planarity
"Lectures on symplectic manifolds" is $17
 
Nor am I ...
 
r9m
@G.T.R :D .. if I'm not making a silly mistake ... me thinks (as of now) the bound is $\displaystyle \forall x\in [0,1], |f(x)|^2 \leq 0.707107 \cdot \int_0^\pi {f'}^2$, when $\displaystyle \int_0^\pi f=0$ ... is the bound $\pi/3$ sharp ? (this is btw the WA estimate of $\min(\frac{t^2}{8}+1)\frac{\coth {\pi t}}{t}$ = 0.707107, it can be improved further I guess .. I've most likely complicating something easy(?) :P
 
Weinstein? @Mike
 
2:37 AM
Yup, @Ted, and it looks about 10x beyond my level
 
It's a good book.
 
The course after Riemannian at LA is symplectic anyway, so I can wait.
I think sometimes they use that as a course on contact geometry instead, though.
 
Complex manifolds somewhere too?
 
Unfortunately I don't think that has its own course.
 
Too bad.
I taught it as a topics in geometry at MIT ...
 
2:39 AM
@MikeMiller amazon.com/…
do it
 
no thanks @Com
There's a 60s book on 3-manifolds (by Fort and Silver) that's $16...
 
so price is a factor?
 
$25 tops, and that includes shipping and tax
@Ted I could get Chern's complex manifolds without potential theory for $27, but alas, that's too much
 
@TedShifrin It does indeed boil down to that. If you loop through the edges, counting the triangles that contain the given edge, you will have counted each triangle three times. (As I see it)
 
@Pedro Can you get $\sum_{v\in V}(\deg v)^2\ge 2E^2/V$?
 
2:42 AM
@MikeMiller you want differential geometry books?
 
@blue What do you mean by that?
 
Ah, I found it for $22... @Ted, have you read that book? Is it good? Will I get anything out of it?
 
If I can prove it?
 
yes
 
@com geometric or topological stuff is preferable, and I like manifolds of all flavors
 
2:44 AM
SIGH I think we did evaluate that sum in class, but I lost my binder, so I'm literally on my own at the moment. I should go to my university and ask for it, it should be there. FUUUUUUU
 
What book, @Mike?
 
@PedroTamaroff you probs want to sum $\deg(v)+\deg(w)-V$ over all edges $vw$, then divide by $3$
 
Chern's "Complex manifolds without potential theory", @Ted
 
@blue Yes, that I know. But I don't know what to do with that sum. I think I am getting the following.
 
Oh, I know it intimately. I helped with the revision for 2nd edition and have an autographed copy :)
 
2:46 AM
"with an appendix on the geometry of characteristic classes"... sounds like it's for older kids than me.
 
You know some of the stuff in there ...
 
If I sum over all edges without worrying about order, I get $3\Delta\geqslant 2\sum_{E}\deg v-2EV$ where the sum runs through all the edges of $G$ without repeating.
 
Certainly not well enough and not intimately, @Ted
 
That looks wrong.
 
Well, get it. Unless you expect me to give you that, too.
 
2:48 AM
LOL @Ted
I don't expect anything
 
@PedroTamaroff $$\sum_{vw}(\deg v+\deg w-V)=2(\sum_{vw}\deg v)-EV=2(\sum_v(\deg v)^2)-EV $$
 
I have to keep some books. Maybe I'll find an apartment with room for a big library.
 
The only thing you promised me was Gunning and Kodaira...
But I don't hold people to their promises if they decide they don't like me anymore
 
@blue Ah, OK.
 
Is that a threat or a promise?
 
2:51 AM
you should look through dover editions if you want under $25 new
I just got a magazine from them
 
@blue When you write $vw$ you mean sum through edges without repeating yes?
 
@PedroTamaroff yes
 
@Ted Neither, it's a joke.
 
Hard to find grad level Dover.
 
2:52 AM
One of my fave series for odd topics is Universitext.
they published the nevanlinna theory book I have
which is I suppose not an odd topic
but it's not a "standard curriculum" topic, rather
 
It's dated and not popular ...
 
@Pedro I might have an extra factor of 2
 
@blue Where?
Oh, yes.
 
@Ted luckily for me, I'm not looking to do research in it or use it :P
I even have enough money left for a coffee.
 
Chern's book has a little bit of value distribution theory in it ...
 
3:00 AM
@PedroTamaroff $V\sum_{v\in V}(\deg v)^2$ counts the tuples $(u,v,w,w')\in V^4$ such that $vw,vw'\in E$ and $v\ne w,w'$, while $4E^2$ counts the tuples $(a,b,c,d)$ such that $ab,cd\in E$ and $a\ne b$, $c\ne d$. Is this useful?
 
I mostly find it to be a good testament to the incredible rigidity of (mero/holo)morphic functions, @Ted
Though my impression was that Vojta's analogy between value distribution theory and diophantine approximation was fairly successful
 
@blue Yes.
Damn sun my counting is so bad.
@robjohn
How can I contact the "big fish" moderators here?
To report an issue that is rustling my jimmies.
You already know the issue.
 
"Rustling my jimmies"?
What kind of cowboy is @Pedro?
 
@TedShifrin That phrase is pop culture now
 
3:11 AM
 
I'm 80 years behind the times ... My students have never said any such phrase!
 
Not in front of you :P
 
Nor to the side of me, in hundreds of hours of office hours.
 
SIGH at serial downvoting.
 
Serial? In this case the OP wanted you specifically to address his question. That's legitimate.
 
3:18 AM
Anyway, @Ted, you can't be 80 years behind the times. You don't look a day over 75.
 
@MikeMiller Ted is 50 something?
 
@TedShifrin the OP has three downvotes in 2.5 years of MSEing, I doubt they used it on Pedro. It's possible OP's comments influenced someone's voting decision though.
 
@TedShifrin Nah, the point is lately I've been receiving daily downvotes in waves of 3.
Some were reversed.
 
and I do not find the downvote legitimate; failing to address a narrow question by answering the broader question in a different way that's good to know is useful information
 
But it is just bothersome some guy is taking its time downvote me everyday.
 
3:24 AM
@Pedro It's a joke.
 
Let's face it, @Pedro: Neither of us is universally beloved.
 
@MikeMiller What?
 
can you see who votes?
 
No, votes are anonymous.
 
Not like I am, at least, @Ted
 
3:43 AM
 
 
1 hour later…
4:47 AM
Hello
 
hi
who goes there
 
5:06 AM
I am unsure why the other conditions are necessary. Isn't (a) enough to prove the question :s ?
Unless it's because that "infinite" condition on (a) doesn't provide enough certainty.
 
I'm trying to think of a counterexample but I can't so far
 
@eXtremiity no, ${\Bbb C}_p$ is not spherically complete even though it is complete
 
there's got to be something better than that
 
it's the only one I had in my memory
 
5:31 AM
@Mike, @eXtremiity: let $S$ be the space of functions $f:(-\infty,\infty)\to\{0,1\}$ with discrete support. if $f,g\in S$, then define $d(f,g)$ to be $e^{-r}$, where $r$ is the first real in which $\{f(r),g(r)\}=\{0,1\}$. let $f_n$ be the indicator function of $\{-1/k:1\le k\le n\}$, and $A_n$ the ball of radius $e^{1/n}$ around $f_n$.
(that's my remake of the $p$-adic example)
 
I'll look at that when I get home
 
*discrete support bounded below
 
@extremiity Tip for your problem: pick $x_i \in A_i$. Show that this sequence converges. Show its limit is in the intersection.
 
Thanks @blue, at least there is a counter-example. Too hard for me to understand, but it exists >_>. @MikeMiller. Yep, I'm on that way :). Thanks.
 
simple counterexample
let $X=\Bbb R$, $A_k= (-\infty, -k] \cup [k,\infty)$
 
5:41 AM
I wanted to find the derivative of $\int^{x^2}_{x^3}(1+t^2)^{-3}$
(Without using the Leibniz rule)
 
@MikeMiller blargh
 
why not use the fundamental theorem of calculus
 
plus the chain rule
 
Can I rewrite it as $-(\int^{x^3}_{0}(1+t^2)^{-3}dt-\int^{x^2}_{0}(1+t^2)^{-3}dt)$?
 
sure
 
5:42 AM
And then use the First FTC?
 
yes
 
@blue I suspect if $X=\Bbb R^n$ the second condition can be relaxed to "some $A_k$ is compact"
 
@blue thanks
 
@Vibhav plus the chain rule
 
@MikeMiller yes, of course
thanks
off*
 
5:43 AM
plus the chain rule
 
divided by the chain rule
 
yeah
 
5:56 AM
@VibhavPant Hi
 
@Sawarnik: Did you post this: integralsandseries.prophpbb.com/…
?
 
@PranavArora Yes, good work :)
 
@PranavArora Are you in college now? IITs?
 
6:07 AM
No, I will be in a few days. :)
 
Oo, which one?
 
Not sure, maybe BITS Pilani or IIT Jodhpur.
 
Jodhpur ... when did that open! Ok.
 
@PranavArora Wat a min...there's a problem in the answer.
 
6:11 AM
What problem?
 
@PranavArora Really the integral seems to be smaller .. :O Can you check?
 
Yes, I am looking at that. It looks strange.
@Sawarnik: Oops. the lower limit is cos(1)(1-2/pi). :P So I guess the problem still needs some work. I will have to think about it.
 
@PranavArora Oh :P
Think, think!
@PranavArora But if the lower limit is cos(1)(1-2/pi), then the integral seems to be even larger :O
 
6:26 AM
well
I think I've had enough
rough day, bye all
 
bye
 
6:40 AM
Hi @Sawarnik
 
6:55 AM
Hey @Sawarnik
I think I see now
You can use the fact that cos(x)>1-x^2/2
So if you integrate (1-x^2/2)/x^3 from x=2/pi to 1, you get 0.50799>1/2
 

« first day (1417 days earlier)      last day (3606 days later) »