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 this week
revised
Loading…
answered
Loading…
awarded
revised
Proofs that inspire and teach
added 13 characters in body
Loading…
answered
Loading…
comment
Math for a cake
Someone should email quid's comment (the link) to Frank's wife and delete it before he finds it out so he gets a surprise on what he thought should be a cake with Stokes' theorem.
awarded
answered
Loading…
comment
A Problem about partitioning $S^2$
You can do the curly braces by \lbrace and \rbrace in math mode. I learned this by right-clicking math in others' posts. You can literally see how they typed their math this way.
comment
Is there an infinite number of combinatorial designs with $r=\lambda^{2}$
@Felix ...and the condition given in Edit3 can be met only when $v = k(k-1)+1$, which implies that the $S(2,k,v)$ is symmetric, be the way. So if $v > k(k-1)+1$ (i.e., the design becomes asymmetric due to $v$ being too large if you will), an $S(2,k,v)$ has a pair of parallel blocks. So, for instance, if you pick $k=3$, using a large set of $S(2,3,v)$s will give you a simple $2$-design with a pair of parallel blocks while satisfying $r = \lambda^2$. If you don't need your $2$-design to be simple, simply copying the same $S(2,k,v)$ $\frac{v-1}{k-1}$ times does the job.
revised
Is there an infinite number of combinatorial designs with $r=\lambda^{2}$
added 1027 characters in body; deleted 1 characters in body; added 31 characters in body
Loading…
comment
Is there an infinite number of combinatorial designs with $r=\lambda^{2}$
@Felix For large $v$, the construction works just fine. I'll write up the details as an edit to the answer.
revised
Loading…
revised
Loading…
revised
Is there an infinite number of combinatorial designs with $r=\lambda^{2}$
added 1164 characters in body; added 9 characters in body; edited body
Loading…
Loading…
awarded
comment
Is there an infinite number of combinatorial designs with $r=\lambda^{2}$
Ah, I didn't F5 before posting the above comment. I'm sorry.
comment
Is there an infinite number of combinatorial designs with $r=\lambda^{2}$
Didn't you forget some other restrictions on the kind of (block) design you want? If you're really ok with a $2$-design of any kind as long as $r = \lambda^2$, then infinitely many of them sure exist. For example, for any finite point set $V$, you take $B = V$ as its only block. Obviously $\lambda = 1$ because every pair of elements of $V$ appears exactly once in a block of the block set (which is a singleton consisting of a block of size $\vert V \vert$). You have $r = 1$ as well because every point appears exactly once for obvious reasons.
comment
Publishing a bad paper?
Ah, of course he was kidding. I guess I better stop browsing the internet when it's 4 in the morning.