« first day (1279 days earlier)      last day (4037 days later) » 

10:00
Did you try some concrete finite groups $G$, such as $G=C_n$ or $G=S_3$, etc?
@anon things go fine if you're considering, say, a six-dimensional vector space over $\Bbb F_3$
@PedroTamaroff Then stop chatting useless and do some real math. (At least thats what I do)
(for other related counting problems)
@BalarkaSen Chatting useless? If you say so.
@anon Composition series are going to get me.
@Mike the structure of the group of units should be sensitive to the family of irreps, which is in turn sensitive to |G|'s invertibility
10:01
alright, granted
also,
21 mins ago, by anon
I figure $K[G]^\times$ will be $K[G]$ minus a set number of left/right ideals (principally generated by left/right nonunits), so in particular $K[G]$ minus a bunch of proper $K$-subspaces, which can be partitioned according to dimension. as long as tensoring up from ${\Bbb F}_p$ to ${\Bbb F}_{p^n}$ doesn't get too wild it shouldn't destabilize this family of subspaces, which would mean the size is in fact polynomial in $q=p^n$.
so for convenience, we pick $|G| = 1$ :)
(:
what would you expect $\lim_{q\rightarrow 1}$ is
:O
10:03
@Mike Damn it, Mike.
@Pedro Does that limit bother you?
@BalarkaSen I have real math problem for you.
@Mike You're always pushing things.
Eh, now that you have mentioned limits.
@PedroTamaroff Fire away, I'll do after I have done with my eating.
I wonder whether we can take limits on physical objects.
10:04
@Mike I couldn't click the link.
Again!
gb2/b/
you have to wait a minute before removing to allow us non-moderators a chance
@Karl my link was busted
For example, could we take limits to a volume distribution of charge?
10:05
@Mike ah
truly a great loss for all of mankind
To obtain surface charge, or point charge.
Or taking limits to get dipoles, etc.
don't ruin this for me
See, @Mike, that's how long you have to wait before removing a message
: - (
10:07
Or something like $\lim_{\epsilon\to0^+}\delta_\epsilon(x)=\delta(x)$, etc.
@BalarkaSen Suppose that $t_1,t_2,\ldots$ is a sequence for which there exists another sequence of positive numbers $\varepsilon_1,\varepsilon_2,\ldots$ converging to $0$ for which $t_{n+1}>t_n-\varepsilon_n$. Then $\{t_1,t_2,\ldots\}$ is dense in $[a,b]$ where $a=\liminf\limits_{n\to\infty} t_n,b=\limsup\limits_{n\to\infty} t_n$.
btw the response to : - (
should always be "why the long face"
It's the Dirac delta function.
That's not what I call real math, @Pedro.
@Mike I was waiting for a second long face before asking.
10:09
@BalarkaSen Now you're just being a fool.
@PedroTamaroff Am I?
So I will desist from talking to you.
I have much more works than talking here in chat. I will just go then.
10:13
Joining.
anyone else is free to as well
Is it me or the icosahedral polynomials pops up in the modular equation for j too?
@Pedro Not gonna join the DJ waitlist?
Done.
Thought I had done so.
@Mike Would you like to think about a proof of my problem above? It is from Polya and Szego.
A profesor in my university gave me a really cute proof.
It's a proof by contradiction, still nice proof.
I'd like to see a direct proof, though. =)
@Pedro I can't promise I'll look hard (doing reading for a test) but I'll look.
10:28
The point is that if an elt $\ell$ is not a limit point, there must be a $\varepsilon_0>0$ such that there are finitely many $t_n$ inside $(\ell-\varepsilon_0,\ell+\varepsilon_0)$, hence for a smaller $\varepsilon_0'$, we have an nbhd of $\ell$ which has no elt of $t_n$ inside.
ugh@elt
Since we're inside the limsup and liminf, we have infinitely many points to the left and right of this interval.
Coulda easily skipped the 'finitely many' step, but go on
In particular, we can find $N$ large enough so that $\varepsilon_N<2\varepsilon_0'$, and such that $t_N$ is to the left of the interval and $t_{N+1}$ to the right, so $2\varepsilon_0'<t_N-t_{N+1}<\varepsilon_N$ which is impossible.
Cute, I like it
10:33
Yeah, it is very nice.
A direct proof would probably be very messy, but still doable.
Though in this case the indirect proof is quite likeable.
@Mike This one is a crazy problem.
I haven't solved it yet.
Consider a cube $[-n,n]^3$.
Where $n$ is a positive integer.
I'll try.
Consider another integer $s$.
One more consideration and my brain will go bust.
Then the number of lattice points inside the cube, for which $|x+y+z|\leqslant s$ is...
Three.
@Pedro That was my last cocaine song.
10:37
$$=\frac{1}{2\pi}\int_{-\pi}^{\pi} \left(\dfrac{\sin\frac{2n+1}2 t}{\sin \frac t2}\right)^3\dfrac{\sin\frac{2s+1}2 t}{\sin \frac t2}dt$$
I shit you not, Mike.
Didn't know Chris's Sis was here ;)
That's the number of lattice points.
Seems awfyk.
awful
@Mike Well, let's try to prove the integral is a positive integers first. =D
No.
10:39
@anon You?
me
how do you feel about music @anon
most feels
we're out of cocaine songs, tho
@PedroTamaroff Difficult decision: (1) Do a typical messy differential geometry calculation or (2) Figure out whether that thing is an integer
10:43
@KarlKronenfeld I am reading the solution by Pólya himself.
Wanna see it?
clearly one should prove that it's an integer
err
should prove it's the number of lattice points
and thus, it is an integer
@PedroTamaroff If it's not a burden to type, sure.
nope
10:45
what is that the #30 of?
It's in the book "Problems and Theorems in Analysis Vol. 1".
It is the 30th problem in the first part of the book.
ERMAGHERD. I'm in love with that singer @Mike.
Hey @KarlKronenfeld wazzup ... Did you watch any of the game?
Previously, or just now?
10:48
The woman, right now.
She's good
my singercrushes are sarah blasko and kate earl
@skullpatrol hey, no I didn't
@Mike What about Norah Jones?
@Karl You didn't miss much
oh, true dat^
10:50
@Pedro not so much
@Mike corinne bailey rae?
bro keep your playlist fresh
I'll play a Sarah Blasko song for you
11:00
@Pedro bro, throw some new songs on
May I join your community?
feel free
starred link on the right
i did, what is the name?
11:01
you'll need a twitter or somesuch, but you can change your username before entering if you're worried about privacy
oh, if you've registered, just click the link again maybe? that links to a specific room
@Mike Electricity went off.
But I had thrown in two songs.
@Pedro Damn.
DUnno what happened.
Hot Chip - Night & Day current dj: mike_m
that's the one
you can play songs of your own with stuff in the bottom left
11:03
\o/
the botom left button lets you pick a playlist, and once you've got a few songs on there, add the DJ waitlist
thanks :D
np
11:24
@robjohn @Chris'sis $$\sum_{n=0}^{\infty} \binom{2n}{n} H_{n} \ x^{n} = \frac{2}{\sqrt{1-4x}} \log \left( \frac{1+ \sqrt{1-4x}}{2 \sqrt{1-4x}} \right)$$
Integrating w.r.t. $x$ and subbing $x = 4^{-1}$ does the trick.
11:41
@KarlKronenfeld Interesting. The only thing that bothers with me with that is the fact that every subset of Q in the way of [a,b) Intersection Q is also dense, and therefore won't be equal to the ordinal of w, unless you figure out a way to get it to be so. Note that [0,infinity) Intersection with Q is obviously not alike to N in that sense.. But I guess I am missing something you did manage to prove?
@Studentmath I am not sure if I understand what you are saying. All I was able to prove is that we can find a set in $\mathbb Q$ (actually in $[0,\infty)\cap\mathbb Q$) of the same order-type as any ordinal smaller than $\omega^\omega$. I did not get any results determining the order-type of the whole $\mathbb Q$ or $[0,\infty)\cap\mathbb Q$.
How did you get to that proof?
(Not that I doubt you did, I am just interested)
@Studentmath For $a,b\in\mathbb Q$, let $\phi:[0,\infty)\cap\mathbb Q\to[a,b)\cap\mathbb Q$ be an order-isomorphism (e.g. the inverse of $x\mapsto\frac{x-a}{b-x}$). Then, you can use $\phi$ to copy sets of order-type $\alpha$ into the sets $[n,n+1)\cap\mathbb Q$. The union of these sets will have order-type $\alpha\cdot\omega$.
@KarlKronenfeld I'll try to prove Jordan Hölder now.
Oh, I get it now
Question is how (and if) we can get it from there to being certain we can get to w^w too
11:55
That's a good question. I haven't resolved it.
It would require a different idea than what I have here.
If, at all, it is possible..
@Mike You there?
Right. I still don't think we could use an idea like this to reverse engineer a given set of order-type $\omega^\omega$ for a contradiction.
Or perhaps @anon?
12:00
Has there been any research work on whether or not quintics can be solved in $\Bbb E$?
The best I could get is a 'no' by Schanuel.
I am certain it's not possible actually and the upper limit is obviously w^2, but. Yes.
It's problematic, or well, beyond my abilities. Speaking of which, heading back to my pre-test studies (test on the 10th)
@anon Why should one think of a composition series as a "factorization" of a given group?
think of the composition series of C(n)
(namely, the multiset of subquotients)
Another question - do you guys ever sleep?
@BalarkaSen dunno
12:02
@Studentmath (It's 5:30 PM)
@Studentmath Hehe, today was a particular day. I usually sleep.
@Studentmath I'll gladly hear any specific objections (I agree this is counter-intuitive, and I will see if I can construct any meaningful examples above $\omega^2$).
I skipped sleep today.
@anon You are familiar with $\Bbb E$, right?
@BalarkaSen euclidean or constructibles or something like that?
12:03
@anon That would be an ascending chain of divisors of $n$?
@PedroTamaroff yes, and the multiset of subquotients?
@anon What do you call subquotients?
@anon It's the smallest subfield of $\Bbb C$ closed under $\exp$ and $\log$ (with appropriate branches, of course)
@BalarkaSen didn't know that
@PedroTamaroff the composition factors, whatever
@anon Oh, that was my guess. Well, still cyclic subgroups but must be of prime order yes?
Since simple.
12:05
the composition factors will be cyclic of prime order yes
Well, I guess C(n) is an easy one.
=)
@Mike?
the multiset of composition factors will be C(p) for every prime divisor of n, with multiplicity equal to the exponent of p in n's prime factorization. so is it clear now why the composition factors are like a factorization of a group?
Hi, can someone help me with notation? Is $2^{\mathbb{N}}$ the same as $\{0,1\}^{\mathbb{N}}?
@anon Oh...! So if $n=p^2q^2$ say, the composition series would be $1\lhd C(q)\lhd C(qp)\lhd C(qp^2)\lhd C(p^2q^2)$?
12:07
a composition series
@Dunno unless you're doing category theory, that'd be my guess.
@anon Right.
@anon Well, I guess you convinced me a little. =)
@KarlKronenfeld No, it's just elementary set theory stuff. Thanks
@BalarkaSen ?
@Karl what would that denote in category theory?
8 mins ago, by Balarka Sen
Has there been any research work on whether or not quintics can be solved in $\Bbb E$?
12:09
@Dunno yes 2^X is another name for the power set of X. notice |P(X)|=2^|X| is true in terms of cardinal numbers. furthermore Y^X is the set of functions X->Y, and satisfies |Y^X|=|Y|^|X|. (specifying a subset is the same as specifying a function X->{in,out}, or X->2)
@BalarkaSen Integrating with respect to $x$ puts an $n+1$ into the denominator, not an $n$.
Schanuel gives something.
no clue
@Mike Category of functors from discrete category $\mathbb N$ into the category with a single nonidentity arrow, namely $a\to b$.
@Karl Gotcha
12:10
@robjohn Well, how about cancelling out a $x$ or somewhat? To give $n-1$ as the exponent?
I am sure a tweak would do.
@robjohn Have you seen my recent TNT/Galois theory Q?
2 mins ago, by Balarka Sen
8 mins ago, by Balarka Sen
Has there been any research work on whether or not quintics can be solved in $\Bbb E$?
@BalarkaSen Something is wrong with your formula. At $x=0$, the left side is $1$ and the right side is $0$
$1 \neq 0$
@robjohn Assuming $0^0 = 1$?
@skullpatrol Oh! Damn, I had used $1=0$ in my proof of RH. I guess I should retract my paper eh.
4
@Karl No need, just fill the gap and prove $1=0$
12:16
divide by 0
$\frac 10 = \infty = \frac 00$
we're saved
@Mike Yay Mike!
Yay thanks, @Mike
Now, my proof works.
Mike > Jesus
I'm gonna stay miles away from that one
12:18
@Mike Staying in topic, how did that Religion course go?
@Pedro It's gotten better but it's still awful.
A crank in a forum said "I gve 30000$ of teh prize money t anyone hlps me to publishh my rh proof."
@DanielFischer Ahoy.
@BalarkaSen Take the limit. In any case, we almost always use $0^0=1$.
@robjohn Limit of what?
12:21
@PedroTamaroff Ahoy too.
@BalarkaSen The left side. That is where I was assuming your comment about $0^0=1$ came from
I posed this problem today
2 hours ago, by Pedro Tamaroff
@BalarkaSen Suppose that $t_1,t_2,\ldots$ is a sequence for which there exists another sequence of positive numbers $\varepsilon_1,\varepsilon_2,\ldots$ converging to $0$ for which $t_{n+1}>t_n-\varepsilon_n$. Then $\{t_1,t_2,\ldots\}$ is dense in $[a,b]$ where $a=\liminf\limits_{n\to\infty} t_n,b=\limsup\limits_{n\to\infty} t_n$.
Shortly afterwards I provided a proof, if anyone is curious.
@robjohn Okay. Ignore that discontinuous ungrateful little beast.
Do things for $x \neq 0$
Wait.
Isn't $H_0 = 0$?
@BalarkaSen It is not discontinuous.
Let's assume that $H_0 = 0$, dual to the paper.
Both sides are now equal at the point.
12:25
@BalarkaSen Ah. I missed the $H_n$. okay it's fine
@BalarkaSen Did you look at Corollary $7$ of that paper?
@robjohn Not really. I got that paper from S&Co., referring the methods to that.
Nice result.
@Pedro You're missing out on "Bearforce One" right now
@BalarkaSen Corollary 7 and the data presented in the proof give the sum as $\frac{\pi^2}{3}$
since $x=\frac14\implies y=0$
Hmmphm.
@BalarkaSen Since the $n=0$ term is $0$, sum from $n=1$ :-)
Then it is easier to see that you can divide by $x$ before integrating
12:52
Greetings
Greetings @Chris'ssis
@robjohn are you around? I think I've found an amazing relation.
@Chris'ssis yes
@robjohn OK
@robjohn sent it
13:13
@robjohn may I delete those? I have to go for 1 h or 2.
13:26
@Chris'ssis I'll delete after I read them. Sorry, I was away.
@robjohn OK
I have to go now.
Later.
@Chris'ssis Cya
13:51
@robjohn thanks for the chebychev help :) I think I got it right now.
14:18
I answered another LHF. (total of 2 now)
14:29
I am reviewing a non-mathematical paper and the authors claim that $f(x)$ is "more linear" than $g(x)$. This is rubbing me the wrong way and I think it should be "less non-linear". Can a function be "more linear"?
14:40
Here is a question regarding the training data scaling in a machine learning algorithm. Apologies if it's not interesting in this room!
14:56
@StrongBad what's the difference?
@anon I think of linearity as being a binary feature (it either is linear or not), but that there are degrees of non-linearity.
seems like you're playing rhetorical games to me
@anon seems like it to me also, that is why I am asking.
so you are fine with something being more linear?
sure. we say both colder and hotter, even though cold isn't the opposite of hot, it's the relative absence of it
in this metaphor you might want to think of linearity as the absence of nonlinearity, as opposed to vice-versa (nonlinearity as the deviation from linearity, measured by something like $\|f''\|$ or somesuch, which is how I'd think of it)
16:02
@robjohn Back. (It's so cold here)
@Dave glad to be of some help!
@Chris'ssis It is cold here, but only relatively cold. It is 6° C here now.
@robjohn -10° C here
@Chris'ssis That's why I said "relatively". It rarely gets below 0° C at this time of day.
@robjohn That place has to be a blessed place. :-)
@Chris'ssis except for the times when it is 43° C or more.
16:10
@robjohn Oh, that's a bit too much. I barely support such temperatures.
16:21
@KarlKronenfeld Just got to a question slightly connected to what we were discussing, showing a certain subset of Q has the ordinal of w^2, however it's not an ordered subset of <Q,<>
16:37
It comforts me to know that I would know how to do the sweet integration questions soon.
Hi @chris
@Charlie GREAT CAT!!!!!!!!!!!!!!1
@Charlie Hello! How are you doing? :D
:D
I'm fine @chris and you?
I'm a bit worried
@Charlie A bit sad these days but I hope I can handle it.
@Charlie Why are you worried?
@chris with a friend. Why are you sad?
16:43
@Charlie I wait for an important answer to me that delays.
@chris Ooh :/
17:04
@Charlie You know, "Don't worry, be happy!"
:-)))))
@Charlie This is nice youtube.com/watch?v=pS1DFy7UmsM
Hey, is there any twin prime known to violate Bertrand's postulate? That is, given the prime pairs of the form $(p,p+2)$ do we know a prime twin $p\gt 5$ with no twin primes $p\lt q \lt 2p$?
@IanMateus Wait till I on my chatjax.
Done.
@IanMateus Good question, I'd guess no. Let me check.
most twin primes probably violate that
@Mike I don't think so. (I haven't checked so take my word as a grain of salt)
@Mike check out this table. I'd say this is very unlikely, this would be an insanely large gap
17:17
I redact 'most', I was thinking of a summation heuristic that isn't valid
but twin primes are p rare
I wold be surprised if it was ways true
@Mike What do you mean by p rare?
@Mike I would bet $50 that it is true.
@BalarkaSen given that we don't even know whether there are infinitely many twin primes, I'd say your bet is most probably safe :D
There are almost surely infinitely many twin primes.
I hope that was actually aimed at Balarka and not me...
I bet 200$ that TPC is true.
17:20
Most probably safe = unlikely to be verified in the near future
I'm not sure you've realized this but I am not Balarka
goddann it
I think Bertrand's postulate for twin primes is safe up to $10^{15}$
my phones screwing up
@Mike sorry, what do you mean?
For whatever reason I couldn't see Balarka's messages on my phone
So I was really confused and thought you were having an incredibly bizarre conversation with me.
@Balarka You're on
17:23
@Mike Hahahaha ok
On the $50 bet, not TPC
Like hell am I betting against TPC
@Mike =D
I have bet that Collatz is undecidable.
These bets are roughly meaningless, because there are good odds one party or the other will be dead by resolution, or have completely forgotten about the other
If not both!
OK, time to go
See you later, along with your $50
Yeah, sure, I hope you don't forget it.
@Mike Why do you think that?
Wonder why didn't I got any upvotes here
0
A: $a^2=b^3+23$ , solve the equation in positive integer

Balarka SenThis, again, is a special case of Mordell's equation. Some questions never die, do they? $$y^2 = x^3 + 23$$ If $y$ is odd, then $x$ is $2 \pmod 4$, which is impossible as there is no such cube element in $\Bbb Z/4 \Bbb Z$, hence $y$ is even, and $x$ is odd. Precisely, $x$ is $1 \pmod 4$. The g...

I though LHFs were profitable?
@IanMateus Got anything more in NT?
17:55
@robjohn I'm so glad, I just created another marvellous question! :D (it's related to the problem in the link I gave you today, but there I used instead arccoth over $n$ from $2$ to $\infty$).
Such a pleasure! :D
@Chris'ssis :-)

« first day (1279 days earlier)      last day (4037 days later) »