Timeline for Min–max reversing bijections $f:\mathbb{N}\to\mathbb{N}$

10 events

when toggle format	what		by	license	comment
Jun 16 at 20:36	comment	added	Dominic van der Zypen		That's all right @SaulRM - I was on a longer hike and didn't check the comments. Yes it would be nice to merge the questions, but I doubt it is possible.
Jun 14 at 16:35	comment	added	Saúl RM		By the way, perhaps it would have made more sense if you had asked it, @DominicvanderZypen, as the question is essentially yours. I thought you had read my comment and were not planning to ask it yourself, which is why I asked it (as, this question being already answered, I didn't think it would attract much more attention). Perhaps it would make sense to merge the questions? (I don't know how that works)
Jun 14 at 16:20	comment	added	Saúl RM		I did ask it in the end, as a separate question (see the comment to the question)
Jun 14 at 16:08	comment	added	Dominic van der Zypen		You want to ask it as a separate question?
Jun 13 at 13:49	comment	added	Saúl RM		Now the natural question is, what is the maximum possible $\mu_{[\N]^2}\big({\operatorname{rev}(f)}\big)$? Bof's example showed that it is at least $\frac{1}{2}$, and my proof gives an upper bound $<1$
Jun 13 at 6:09	comment	added	Dominic van der Zypen		Wonderful @SaulRM! First I was sure there was a positive answer, also in light of bof's comments
Jun 13 at 6:08	vote	accept	Dominic van der Zypen
Jun 12 at 23:25	history	edited	LSpice	CC BY-SA 4.0	Defined `\N`
Jun 12 at 22:56	history	edited	Saúl RM	CC BY-SA 4.0	added 18 characters in body
Jun 12 at 22:50	history	answered	Saúl RM	CC BY-SA 4.0