« first day (2589 days earlier)      last day (2446 days later) » 

9:01 PM
@orlp Hmmm.
 
@LeakyNun I don't understand
 
@orlp Neither do I.
 
Because groups of order $p^2$ are abelian. — Qiaochu Yuan 9 mins ago
group theory is so beautiful
@orlp I mean, we connected the extremities and then used the smallest-distance protocol
 
In the $n=3$ case, if Alice has an $1$ to send, why not send that if she gets $\{1,3\}$? She only needs to punt to $3$ if the next bit in her message is not one she has available. This lets her transmit $\frac23$ bits per round on average. — Henning Makholm 2 mins ago
D'oh.
 
@LeakyNun no, we're talking about something else now
@Wildcard see my comment
 
9:05 PM
That's even what I was alluding to earlier when I mentioned amount of noise.
 
it assumes information about the distribution of the information that we're transferring
what if I only want to transfer 1111111111111111111?
 
@orlp Still works.
The key is that 2/3 of the possible inputs contain your desired output, no matter what your desired output is.
 
oh right
it does still work
that solves $b(3)$ I'm fairly convinced
 
@orlp Yup.
 
and my intuition was correct that $1/3$ isn't optimal ;D
 
9:07 PM
So now let's try the next one, $b(52)$. ;D
 
but that doesn't solve $b(n)$..
 
Let's try $b(4)$ and see if a pattern emerges.
@orlp applause
Actually, I think a broader generalization is necessary.
Call what we've solved $b(3,2)$
We can try $b(4,2)$ or $b(4,3)$.
And if we want to scale it up to the original question,
We'll need to count the solved case as $b(3,2,1)$
And the final case of interest is $b(52,5,4)$
So define $b(j,k,l)$ as a scheme with $j$ possible numbers, where a random choice of $k$ of those numbers (distinct) are passed to person A, who selects $l$ of them to pass to B. With $k \le j$ and $l \lt j$.
And the question can be further complicated (in the original) by allowing person A to choose a permutation of the $l$ chosen elements.
Wow, that's a very nontrivial question.
@orlp In $b(4,3,1)$ you can use 1, 2, and 3 to relay your messages. And if the one you need isn't present in the set of 3 you are given, send the number 4 as a no-op.
So only 1/4th of the time would the needed number be missing. (I think...right?)
 
yes, $b(n, n-1, 1) \geq 1 - \frac{1}{n}$.
 
But for $b(4,2,1)$ it's trickier.
@orlp Right.
For $b(4,2,1)$, a starting point (not necessarily optimal) would be to use two data channels and two no-op channels.
That way every possible set you receive is guaranteed to either have the number you need, or a no-op number (or both).
Which gives 1/2.
 
@Wildcard you'll have to forgive me, I have a cold, coming with a headache
so I think for tonight I end here and I'll see what answers come in
 
9:18 PM
@orlp Mind if I edit in the more general case to the question?
With three parameters instead of one?
(I'll leave out the permutation part.)
 
kind of
I feel that's more of a followup question
once this case has been resolved
 
@orlp Fair enough.
 
if you broaden the scope of a question too much the answers will also broaden into uselessness generally
 
@orlp Right.
I think it's possible that adjusting a different parameter may be a better line of attack.
But that's okay. :)
 
so instead of an answer you'll get a link to a thesis from 1983 that in section 8.3 studies something similar, but not exactly the same, with notation that you've never seen before and is impossible to google :P
2
 
9:19 PM
@orlp :P
I think $b(4,3,2)$ (with or without permutations allowed) is an entirely different type of question from $b(4,2,1)$.
@orlp Get better (drink lots of water). Thanks for an interesting discussion. :)
 
Let $A=[0,1]$. Let $x \sim y$ denote $x-y \in \Bbb Q$. Form a set $S$ of representatives from $A/\sim$. Choose a random number uniformly from $A$. What is the probability that the chosen number is in $S$?
@orlp
 
@LeakyNun it's not clear to me what ~ is
 
Hi @Alessandro
 
@orlp an equivalence relation
 
9:26 PM
(and how do you typeset ~ in latex)?
 
@orlp \sim
 
\sim
 
nope, still don't understand the question
 
@orlp do you know what an equivalence relation is?
 
yes
 
9:28 PM
@orlp and the relation between equivalence relation and partition?
 
Hmm, that's an interesting question, @Leaky.
 
@TedShifrin it's a puzzle for orlp :P (anyone with any knowledge of measure theory would know the answer)
 
@LeakyNun no
it's also not clear with me what you mean with $x - y \in \mathbb{Q}$
 
I have knowledge of measure theory.
$\pi/4$ is equivalent to $\pi/4 + q$ for any rational number $q$, @orlp
 
is that saying that the relation $\sim$ holds for numbers $x$, $y$ if their difference is rational?
 
9:30 PM
@orlp yes
and then we group the related numbers into boxes
and choose one number from each box to form the set $S$
 
ah ok
 
Well explained, @Leaky.
 
@TedShifrin Is that actually a well defined question?
 
@AlessandroCodenotti shh.
 
I feel that in some cases the selection process matters though
 
9:31 PM
I have no issues with the axiom of choice, @Alessandro.
 
@TedShifrin thanks.
@TedShifrin it isn't choice that is problematic.
 
consider a relation $R$ that relates consecutive even/odd numbers
 
@orlp $A$ contains the numbers from $0$ to $1$
 
@TedShifrin That's not my problem here, but I don't think there's a reasonable probability space for which this set is an event
 
then $\mathbb{N} / R$ can have an arbitrary amount of even numbers
 
9:32 PM
Well, it certainly isn't counting measure :P
 
but I'll assume good faith and that it doesn't matter here
 
@orlp right, it doesn't matter here. The axiom of choice is not the problematic element here.
 
Your $R$ isn't an equivalence relation, @orlp, as you stated it.
If all evens are equivalent and all odds are equivalent, then $\Bbb N/R$ has two elements.
 
@TedShifrin no
 
@TedShifrin I think he probably meant the odd-even topology
 
9:33 PM
it relates 2 to 3 and vice versa, 4 to 5, etc
 
Oh, I see.
 
and each number to itself, of course
 
That wasn't exactly clear from your wording.
 
@LeakyNun this isn't a rigorous argument, but it's clear to me that the answer is either 0 or 1 because we're comparing cardinalities of infinities here
 
So, @Alessandro, you're back to threatening people on the streets? :D
 
9:35 PM
@orlp [0,0.5] is uncountable yet anyone would answer 0.5.
 
Equivalent w/r/t quotient by 2
 
@TedShifrin Nah, I'm studying analysis now, I have an exam on the 11th
 
@LeakyNun why does the domain of $A$ matter?
 
Ah, more important to kill analysis than to kill fellow humans :)
 
@orlp I'm talking about $S$
 
9:37 PM
unless analysis kills me first :P
 
If $S$ were [0,0.5] you wouldn't be comparing cardinalities and come up with "either 0 or 1" @orlp
 
but $S$ isn't $[0, 0.5]$
 
I'd make a riff on Killing vectors but uh
I've never actually learned what those mean
 
we'd send you to the Killing fields, Semiclassic.
 
@orlp I'm just saying you shouldn't be comparing cardinalities
 
9:38 PM
rolls Ted's eyes
 
LOL, @Danu. Isn't it past your bedtime yet?
 
11:30 naw
I am sad that there's no nice tennis on :(
 
I'd laugh at that, except that what immediately also comes to mind is Cambodia
 
Oh, yeah, still early.
We've been through that a month ago, Semiclassic.
 
I'm pursuing a new sleep strategy
 
9:40 PM
is that strategy simply "not sleeping"?
 
@LeakyNun say we pick some number $x \in [0, 1]$
 
Namely, leave my laptops ac adapter at the office so I can't stay up all night on it
 
^smart
I do this too sometimes
 
that's genius
 
then the equivalence class of $x$ is dense in $[0, 1]$
 
9:41 PM
Such genius doesn't work for desktops.
 
Except now I have two adapters, one of which is always at home.
Foiled again!
 
and the chance that we picked the right number in a dense set is $0$
@LeakyNun so my answer would be $0$
 
Well, so did i...until I accidentally lost one
Not proud of that
 
actually I'm kind of doing the same, my laptop is at 17% battery now and I think I'll just go to sleep rather than finding the charger when it dies
 
@orlp: Suppose I ask you to pick a random real number between $0$ and $1$. What's the probability that it's irrational?
 
9:42 PM
@TedShifrin 1
 
So it's not about picking a number in a dense set?
@Alessandro: Then it's dead for you tomorrow?
 
@TedShifrin that's different
 
LOL.
You'd better be able to explain how/why.
 
Doesn't prevent me from staying up on my phone, but it's a start
 
you're asking what the probability is that we pick a dense subset from another dense set
 
9:42 PM
Hi, LOL.
 
Hi, Jasper.
 
@TedShifrin I can use it while it charges, we have sockets under every desk in uni
 
You can kill your phone, too, @Semiclassic.
 
Yeah.
 
@TedShifrin he's arguing that the probably of picking $\pi$ from the irrational numbers is 0
 
9:43 PM
Or you could go to sleep and let it charge while you sleep, @Alessandro :P
 
@TedShifrin in my example with $x$ I was talking about the probability of specifically picking $x$ (one number) in a dense set
 
($S$ doesn't have to be dense in $A$, @Ted)
@orlp but $S$ is uncountable
 
I should probably charge my phone during the day
 
I'm aware of that, @Leaky :P
 
@LeakyNun but is my analysis incorrect?
under the assumption that we pick a particular $x$ first, the probability is $0$
although that could definitely still be wrong
 
9:44 PM
And resist using my rechargeable battery during the evening
 
@orlp let $x \in [0,1]$. The probability of picking $x$ from $[0,1]$ is $0$. Therefore, the probability of picking any number at all is $0$.
 
since over all $x$ zeroes can add up to something more :)
 
Well, adding uncountably many numbers isn't usually a well-defined thing, @orlp.
 
@TedShifrin That would be the most sensible choice
 
Yes, but I've come to realize you're not always sensible. :P
 
9:46 PM
Better to be wise than clever, but both are better than being foolish
 
gives Alessandro a lesson in sensibility
 
I'm out
 
Oh, Ted. My bureaucracy headaches evaporated last Friday
 
You're not going to give anyone (ok, maybe Balarka) a lesson on sleeping schedules @Dami :P
 
Night, @Danu.
Good, @Semiclassic.
 
9:47 PM
Ever since coming back to Texas I've consistently slept before 2:30
 
no, this argument is fruitless
 
Otherwise your parents would kill you?
 
A director in the student services department evidently intervened so that I could get tuition worked out before the weekend
Have to remember to write them a thank you note
 
That would be really a nice thing, @Semiclassic.
 
Yeah.
It was a huge relief
 
9:49 PM
@LeakyNun I don't think I have the tools to answer this question
 
That was headache number one gone
 
@TedShifrin what would be your answer?
18 mins ago, by Alessandro Codenotti
@TedShifrin That's not my problem here, but I don't think there's a reasonable probability space for which this set is an event
This would be my answer lol
 
Headache number two went away when I talked to the front office again about the TA issue. They'd already given some options, and when I went back to confer with them about it they realized they actually needed a TA with the right load in a certain slot
 
I guess I haven't convinced myself there's no nontrivial measure on $\Bbb R/\Bbb Q$.
 
interestingly I'm not sure if you can make a one to one mapping from $A$ to $S$
my intuition says yes
 
9:51 PM
Namely, for the class I'd been gunning for in the first place :)
 
but I can't think of a concrete one atm
 
@orlp it requires choice.
 
Oh, so you can totally stop your bitchin' now, Semiclassic, and get back to "work."
 
it is consistent with ZF that $S$ has more elements than $A$ @orlp
 
9:52 PM
in the sense that there is no surjective mapping from $A$ to $S$
 
$S$ has more??
 
@orlp yes.
 
No excuse now, gulp
 
What was $A$?
 
how can you partition a set into one that has more elements?
 
9:53 PM
@TedShifrin $A=[0,1]$, $S=A/\sim$, $x \sim y \iff x-y \in \Bbb Q$
 
that seems to violate the very definition of partitioning
 
I'm with orlp. How can you say the cardinality of $S$ exceeds the cardinality of $A$ when, using choice, you can make $S$ a subset of $A$?
 
Also, just to be pedantic: a set of representatives is not the same as the quotient set
 
oops!
right, it only works if you don't choose the representatives and just consider the number of cosets.
 
No, I still don't understand.
 
9:55 PM
$A/\sim$ as a quotient (set of cosets) can have more elements than $A$
 
There's a one-to-one correspondence between the set of representatives (once you've picked it) and the quotient.
 
You don't choose the representatives.
 
I said to choose them, using choice.
 
Then of course $S$ cannot have more elements if you assume choice.
 
I hate set theory with a passion, but how can the set of equivalence classes exceed the original set in cardinality?
 
9:56 PM
I can believe they could be noncomparable. More, I don't believe.
 
"Choose choice."
 
Well, of course I'm assuming choice.
 
@LeakyNun as a set of cosets isn't $|S| = |\mathbb{R} \times \mathbb{Q}|$?
 
I will not talk to anyone in this room who quibbles with me about choice.
 
@Semiclassical But can we choose choice infinitely many times?
 
9:58 PM
@orlp what?
 
@TedShifrin Is that really a choice you can make?
:P
 
well, that's certainly your choice
 
I've made it.
 
@LeakyNun what part is unclear?
 
I'm with Ted on this one, not assuming choice is the wrong life choice
 
9:58 PM
@orlp the $=$.
 
gives Demonark another month of detention
 
@LeakyNun I'm taking the cardinality of both sides
 
Maybe I can ask Demonark's parents to help me out.
 
{{1,2},{3,4}} has 2 elements, @orlp
 
[insert obligatory joke re choice/WOP/Zorn here]
 

« first day (2589 days earlier)      last day (2446 days later) »