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
comment
Publishing a bad paper?
That solution Roland suggested is kinda crossing the line to me for many reasons... Anyway, I feel like the professor might get upset when he sees the published date on arXiv. He might think someone beat him to it because the lazy grad student was slacking off, not writing up the result quickly?
awarded
revised
Block design question
added 42 characters in body
Loading…
revised
Block design question
added 308 characters in body; added 2 characters in body; added 1 characters in body
Loading…
revised
Block design question
added 107 characters in body; added 8 characters in body
Loading…
revised
Block design question
added 264 characters in body
Loading…
revised
Block design question
added 138 characters in body; added 17 characters in body
Loading…
answered
Loading…
comment
How many matrices are possible for the given arrangement?
This is kind of irrelevant now that we know OP meant avoiding constant submatrices of adjacent rows and columns, but you can get a $3 \times 5$ matrix A avoiding constant $2 \times 2$ (general) submatrices by choosing $(1,0,0,0,1)$ as the third row; this choice is ok because your argument doesn't require the third row to have three $1$'s.
comment
Generalization of traces
Totally unrelated to your question, but you've got one too many http's in your linked url. It should read: math.stackexchange.com/questions/233602/generalized-traces
Loading…
awarded
awarded
awarded
revised
Ways of choosing k items out of n with exactly one symbol in common
Fixed the definition.; added 1 characters in body
Loading…
revised
Loading…
Loading…
1
22 23 24 25
26