Skip to main content
Antoine Labelle's user avatar
Antoine Labelle's user avatar
Antoine Labelle's user avatar
Antoine Labelle
  • Member for 4 years, 5 months
  • Last seen this week
  • Montreal
revised
Rank of sumsets in matroids
added 371 characters in body
Loading…
comment
$2$-adic valuation of Schur $P$-functions in the power-sum basis
@darijgrinberg Thanks, your proof seems to work! You do use implicitly that $\lambda$ has distinct parts, since otherwise $Q_\lambda$ is zero, not $2^{\ell(\lambda)}P_\lambda$, so part 2 doesn't work anymlore (for example $P_{(1,1)}=\frac{1}{2}(p_1^2-p_2)$ so this hypothesis is really needed). Except for that, though, everything looks correct, so if you want to turn your comments into an answer I'll happily accept it.
comment
$2$-adic valuation of Schur $P$-functions in the power-sum basis
Thanks for your comment! That seems equivalent to my question actually, since unless I'm mistaken the $P_\lambda$ (for arbitrary $\lambda$) form a $\mathbb{Z}$-basis for $\Lambda$, and in particular those with $\lambda$ having distinct parts form a $\mathbb{Z}$-basis for $\Lambda \cap \mathbb{Q}[p_1,p_3,p_5,\cdots]$.
answered
Loading…
Loading…
comment
Using equational Jacobson condition to prove element lies in radical of ideal
Can you expand a bit more on what you want? How can a choice of $g$ show that $f \in \sqrt{I}$?
awarded
comment
comment
a Littlewood–Offord-type problem concerning the "cubical lattice"
Yeah you're right so that really only works for characteristic 2. I think that the main claim in my proof is actually false in other characteristics.
comment
a Littlewood–Offord-type problem concerning the "cubical lattice"
$y+z-x\in \{0,1\}^n$ does not assume that $A$ contains zero in characteristic 2, it follows from $\{0,1\}^n$ being an $\mathbb{F}_2$ subspace (if $A$ contains zero then my argument works in any characteristic actually but that's not needed for characteristic 2).
comment
Graph with two edge-disjoint Hamiltonian paths between the same vertex-pair
I guess you want to exclude the graph with a unique vertex. In this case the minimal number of vertices is 5 ($K_5$ has two edge-disjoint hamiltonian cycles). It's easy to check that 4 or less is impossible.
Loading…
comment
Imaginary eigenvalues
Another quite surprising property is that the characteristic polynomial is symmetric in the $\mu_i$, that is, the eigenvalues are independent of the order in which the multiplication is done. I wonder what explains that.
comment
Similarity of two matrices
The matrix for a fixed $\lambda$ is diagonalizable, but there is no base that simultaneously (block-)diagonalize all $A(\lambda)$
comment
Imaginary eigenvalues
I think you also need to exclude the case of four eigenvalues $\lambda, -\lambda, \frac{1}{\lambda},-\frac{1}{\lambda}$ all real.
comment
Imaginary eigenvalues
Hahaha ok that explains it. Using sage I got, for $n=3$, $k_1^2k_2^2k_3^2+\sum_{sym} (k_1^2k_2^2 +2k_1^2k_2k_3+4k_1^2+4k_1k_2) +18$ for the coefficient of $t^2$
comment
Imaginary eigenvalues
@მამუკაჯიბლაძე Are you sure? I computed it for $n=3$ and got something completely different (the coefficient of $t^2$ is a messy polynomial in $\mu_1, \mu_2, \mu_3$)
answered
Loading…
comment
1
8 9
10
11 12
16