Skip to main content
Connor's user avatar
Connor's user avatar
Connor's user avatar
Connor
  • Member for 10 years, 7 months
  • Last seen more than a week ago
comment
separator and vertex-connectivity
I think after removing any two vertices of the join, the remaining is still connected? So it is 2-connected?
asked
Loading…
revised
Loading…
revised
Loading…
comment
Combine two types of permutations in a Young diagram?
I see. Actually, there the sum is the same for every cell. I edited it and added a concrete goal.
revised
Loading…
awarded
comment
Combine two types of permutations in a Young diagram?
Yes. Any non-trivial upper bound would be interesting.
comment
Combine two types of permutations in a Young diagram?
Yes, what you said sounds more concrete: let $t$ be a vector such that $t_i$ is the maximum sum of the two coordinates of a cell in row $i$. And the target is to minimize the $\ell_1$-norm of the vector $t$.
Loading…
Loading…
comment
Number of points covered by $2n$ hyperplanes in $\mathbf{F}_p^n$
Those $s_i,t_i$ are non-zero, which makes the probability not $(1-p^{-1})^n$.
Loading…
awarded
revised
Loading…
Loading…
revised
Loading…
comment
Connectivity of a matroid is at least its rank?
When $X$ is a simplex, $\eta(X)$ is defined to be infinity. So the bound still holds.
revised
Loading…