Skip to main content
Yuichiro Fujiwara's user avatar
Yuichiro Fujiwara's user avatar
Yuichiro Fujiwara's user avatar
Yuichiro Fujiwara
  • Member for 12 years, 1 month
  • Last seen more than a week ago
awarded
revised
Upper bound for the size of a $k$-uniform $s$-wise $t$-intersecting set system
Fixed typo in author's name, added tags, and formatted title in latex
Loading…
awarded
answered
Loading…
Loading…
revised
Loading…
awarded
comment
chromatic number of a simple graph whose length of the longest odd cycle is 2k+1
@user40096 I edited the answer so it covers the even cycle case too.
revised
Loading…
Loading…
comment
The probability for a streak when tossing a coin
For the case of a fair coin, technically you can compute the probability through Fibonacci n-step number: mathworld.wolfram.com/Fibonaccin-StepNumber.html Here's a fairly recent paper I found on arxiv (arxiv.org/pdf/0905.0304.pdf) about a nice formula for this number. I haven't read it myself yet, but it seems it contains some references as well. If you want code, here's a list on rossetacode.org for a bunch of computer languages: rosettacode.org/wiki/Fibonacci_n-step_number_sequences
comment
Constructing Steiner Triple Systems Algorithmically
@Peter Thank you for your kind comment!
revised
Constructing Steiner Triple Systems Algorithmically
Added a brief explanation of the doubling construction.
Loading…
Loading…
awarded
comment
Does $(\mathbb{Z}/n\mathbb{Z})^2$ ever admit a difference set when $n$ is odd?
Here's an online database of difference sets including non-cyclic, abelian cases: ccrwest.org/diffsets.html I checked the case $\vert D \vert < 150$, only to find one (possible) example over (\mathbb{Z}/n\mathbb{Z})^2. It says $PG(4,3)$ gives a $(121,40,13)$ difference set over (\mathbb{Z}/11\mathbb{Z})^2, but I thought it should be a "cyclic" one (i.e., over the cyclic group of order $121$). So, unless I'm missing something, it's an error, and if that's the case, there seems to be no known small example. In any case, such difference sets seem to be very rare if there's one at all.
1
17 18
19
20 21
26