Timeline for Has anyone seen this version of ring toss (combinatorial object) before?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Apr 15, 2011 at 5:50 | comment | added | Gerry Myerson | Please do. You should be able to find my email address by way of the Macquarie Math Dept website, maths.mq.edu.au | |
| Apr 15, 2011 at 5:44 | comment | added | Gerhard Paseman | By the way, I've stopped (for now) tweaking my writeup on a new upper bound for Jacobsthal's function. It's wordy, has a couple of minor errors, and needs polish, but the core result seems to hold (exponent like loglogn instead of like logn) and Will and Aaron haven't told me different yet. If you are interested, let me know and I will email you a PDF. Gerhard "Ask And You Shall Receive" Paseman, 2011.04.14 | |
| Apr 15, 2011 at 5:37 | comment | added | Gerhard Paseman | Thank you for the reference, Gerry. It turns out I am dealing with restricted incongruent covering systems for [1...n] in the problems above. For bounding j(m) from above I look at the endpoints and see what clashes occur. I decided to map n to -1, n-1 to -2, etc, to form the game. You have a nice collection of 0-sets as a result. Now I have something more to play with. I hope to find out more about d-sets as well for my application. Gerhard "Ask Me About System Design" Paseman, 2011.04.14 | |
| Apr 15, 2011 at 2:26 | comment | added | Gerry Myerson | It's not a million miles away from the topic of my paper with Poon and Simpson, Incongruent restricted disjoint covering systems, Disc Math 309 (2009) 4428-4434. Given $n$, we want a bunch of congruences with distinct moduli such that each number from $1$ to $n$ satisfies exactly one congruence, and each congruence is satisfied by at least two numbers. We prove it's impossible for each congruence to be satisfied by exactly two numbers. Shift our interval left to be symmetric wrt zero, insist zero satisfy no congruence, and I think we have an approximation to what you're asking. | |
| Apr 14, 2011 at 22:21 | comment | added | Gerhard Paseman | So far, the closest hit seems to be generalized multi-Skolem sequences. (For example, see this paper . ) However, that darned peg gets in the way of an exact match, and overlaps do not seem to be considered. I'll keep looking. Gerhard "Ask Me About System Design" Paseman, 2011.04.14 | |
| Apr 14, 2011 at 20:36 | history | asked | Gerhard Paseman | CC BY-SA 3.0 |