Mathematics

Associated with Math.SE; for both general discussion & math qu...
Oct 12, 2021 06:04
i don't understand why exactly it's that difficult
Oct 12, 2021 06:02
"For example, the expansion of P¯28 took 371 days of CPU time in total (with 182 jobs, on Machine B described in Subsection 4.1)" :$
Oct 12, 2021 06:00
still madness
Oct 12, 2021 05:59
ah, just found another one from 2018: jssac.net/Editor/CJssac/V03/V3_101.pdf
Oct 12, 2021 05:58
can't find any more recent papers/research/work on this specific topic
Oct 12, 2021 05:57
337,550,051 terms and a polynomial of degree 38 just for a heptagon, ???
Oct 12, 2021 05:57
i just can't believe that it's that hard to find a formula for this
Oct 12, 2021 05:56
(cyclic polygons and their circumradius)
Oct 12, 2021 05:56
hi! has anybody of you knowledge on this topic: ftp.jssac.org/Editor/Suushiki/V18/No1/V18N1_102.pdf ?
Aug 21, 2021 04:02
@PM2Ring this seems like something a computer in 10 years could just calculate in like 10 minutes...nice!
Aug 21, 2021 03:58
@PM2Ring thanks!
Aug 18, 2021 07:53
that was fine in my opinion, just another way to look at it
Aug 18, 2021 07:52
what? :D
Aug 18, 2021 07:50
íts just weird overall
Aug 18, 2021 07:50
in some configurations you might not and in some configs this could even reduce the number of colors
Aug 18, 2021 07:49
so the statement "This requires at least one more colour" is a bold one
Aug 18, 2021 07:48
yeah that's the fascinating thing about 4-color in 2d...lets say you remove and stretch, it's mostly not at all obvious how on earth the colors need to be redistributed, but it can be done
Aug 18, 2021 07:46
see what i mean?
Aug 18, 2021 07:46
Consider, for arguments sake, that the particular configuration is still squares.
We know that for the case of squares, it can be done with a finite number of colours. Call it X.
Then, consider a different configuration where just one of the offices is some finite number of multiples long compared to the rest, such that it intersects with another copy of itself.
This requires at least one more colour. We now need X plus 1 colours. (which is false in 2d, we don't need 1 more color)

But then we could stretch the same rectangle again, and need one more colour. Ad infinitum. (no, we will never
Aug 18, 2021 07:44
but you don't need to, whatever you change, you can always somehow change the distribution of colors so you only need 4
Aug 18, 2021 07:43
you can say roughly the same in 2 dimensions, and sure, you can always add one more color
Aug 18, 2021 07:43
does that explain intuitively why the number of colors is not bounded?
Aug 18, 2021 07:33
it's just weird how this is a whole can of worms in 2 dimensions, and in 3 dimensions it all falls apart right at the start
Aug 18, 2021 07:31
still fascinating that there's no bounded number
Aug 18, 2021 07:31
yeah xD
Aug 18, 2021 07:30
yeah sorry, the quote was a bit misleading i guess
Aug 18, 2021 07:28
or not?
Aug 18, 2021 07:27
or 2 cubes and 2 colors
Aug 18, 2021 07:27
you know
Aug 18, 2021 07:27
and 1 cube
Aug 18, 2021 07:27
well, the problem you are trying to solve can be "solved" using only 1 color
Aug 18, 2021 07:24
i agree, the quote i used, and the whole paper is a bit ambigous about that in my opinion
Aug 18, 2021 07:21
and the fascinating thing is, only 4
Aug 18, 2021 07:21
the original question of the 4-color theorem at least, is, in any given scenario, how many buckets of paints do i need to bring with me, to be totally sure
Aug 18, 2021 07:19
yeah but this is a specific configuration, isn't it?
Aug 18, 2021 07:10
well okay i need to visualize this somehow because i don't think i really get what you mean
Aug 18, 2021 07:09
do i still need just 54 colors?
Aug 18, 2021 07:09
yeah, but let's suppose i take one of those rooms out, and fill any of the free space with any of the other regions by stretching them
Aug 18, 2021 06:57
and the answer is no, apparently...in two dimensions the answer is yes, but no matter how big, how many regions and how they are configured, you'll always need 4 colors max
Aug 18, 2021 06:55
i think i got it: imagine a 3d chess pattern, just cubes of white and black...take one of those cubes, delete it, and stretch any adjecent cube to a rectangular solid to fill the space, does the number of colors still suffice?
Aug 18, 2021 06:51
i mean, it's saying "wall", "ceiling" and "floor", so i don't think edges touching matter
Aug 18, 2021 06:49
but if you understand more than i do about this, have fun: discuss.wmie.uz.zgora.pl/php/…
Aug 18, 2021 06:49
now i'm confused again
Aug 18, 2021 06:48
i guess the emphasis is on can we paint any configuration?
Aug 18, 2021 06:46
@user400188 oh wait
Aug 18, 2021 06:46
i was confused by this too but "bounded" in this context refers to the 4-color theorem, where you can say: it doesn't even **matter** how many regions, we only ever need 4 colors, period.

but it seems in three dimensions, they have proven that the number of colors is always at least equal to the number of regions - which kind of defeats the whole question, of course you can color every region with a different new color
Aug 18, 2021 06:41
seems like actually finding out what the maximum number of clues in a minimal sudoku is, is at least in the ballpark of super computers of the next decade...or maybe the current supercomputers are already capable of finding that out but they don't waste their time on stupid sudoku stuff :D
Aug 18, 2021 06:36
i mean, i guess the sudoku problems are something like that
Aug 18, 2021 06:16
oh, "bounded" just means "not as many regions there are", i get it
Aug 18, 2021 06:14
also, the rest of that paper is to complex for me, i can't follow sets and set related symbols