Skip to main content
dhy's user avatar
dhy's user avatar
dhy's user avatar
dhy
  • Member for 11 years, 11 months
  • Last seen this week
comment
How large can subspaces of $U \otimes V$ be that avoid any pure tensors?
The same intersection-theoretic argument seems to give the following bound: if $i\leq m-1$ and $j\leq n-1$ are such that $\binom{i+j}{i}$ is odd, then any subspace of codimension $i+j$ must have a pure tensor. The largest possible value of $i+j$ (for fixed values of $m$ and $n$) one can achieve this way is the bitwise OR of $m-1$ and $n-1$ (i.e., the number whose binary expansion has a $1$ in any given binary place iff either $m-1$ or $n-1$ (or both) do.)
comment
The number of distinct possible values of $\pm a_1 \pm a_2 \pm \cdots \pm a_n$ for sufficiently large $n$
The gcd condition is not nearly enough to make $m$ finite: let $m_n$ be the number of positive integers up to $a_1+\cdots+a_n$ which cannot be expressed as a sum of the $a_i$. (BTW, one has $A_n=a_1+\cdots+a_n+1-m_n.$) If $a_{n+1}=1+a_1+\cdots+a_n-i_n$ for some $i_n\geq 0$, then we must have $m_{n+1}\geq 2m_n-i.$ We can then choose a sequence with a large value of $a_2$ and $i_n$ equal to $0$ or $1$ for $n\geq 2$. If $i_n$ does not become eventually $0$ then this will satisfy the gcd condition but $m_n$ will blow up, which forces $m$ to be infinite.
comment
Naming categories beyond their objects
I think this is very common, here's just one example off the top of my head: en.wikipedia.org/wiki/Category_of_relations.
awarded
comment
How many translates of the singular‐matrix hypersurface are needed to cover $M_n(\mathbb{F}_2)$?
@Luftbahnfahrer Yep, you are of course correct on all counts. This argument is incomplete as is.
Loading…
Loading…
awarded
revised
Are eigenspaces continuous?
deleted 12 characters in body
Loading…
awarded
answered
Loading…
comment
Connected components of real cubic hypersurfaces
I believe Milnor's "On the Betti Numbers of Real Varieties" gives you an upper bound $N(n,d)\leq d(2d-1)^{n-1}.$ Probably significantly stronger bounds are known today, but I'm not well-versed in the relevant literature.
awarded
Loading…
awarded
comment
Existence of collision-free assignment of points
There are only two "non-repeating" geodesics on the sphere between two different non-diametrically opposed points, corresponding to the two sides of the unique great circle through them.
comment
Existence of collision-free assignment of points
Another example, using the same idea of taking a non-complete manifold where you delete points to force intersecting geodesics: take $M$ to be $S^2$ and take $4$ random points $A,B,C,D$ on it. For any bijection, there will be a pair of geodesics that intersect (since any two great circles intersect.) Delete points to ensure that those are the only geodesics left.
comment
Point-wise spectral actions in de Rham geometric Langlands
Yes, but by definition, your Q2 action is equivalent to the action of the skyscraper in $\operatorname{IndCoh_{nilp}}$ on the automorphic category (in particular it does not match up with Q1 at non-smooth points.) I.e, both questions concern endofunctors of $D(Bun_G)$ so it doesn't make sense to say they're interchanged by Langlands, they are just either identifiable or not identifiable.
comment
Point-wise spectral actions in de Rham geometric Langlands
Ah, so the difference between Q2 and Q1 is the difference between IndCoh and QCoh? Then I don't know a good answer (except when $\sigma$ is a smooth point and the question coincides with Q1), even in the case of $\sigma$ trivial (in which case I guess you could theoretically derive an answer from a description of the convolution kernel but I never understood the proposals for this kernel.)
comment
Point-wise spectral actions in de Rham geometric Langlands
I'm not sure what action you're referring to in Question 2 - do you mean tensoring with the Hecke eigensheaf? If so, I don't think this is a particularly well-behaved action. For Question 1, if I'm not mistaken, this can be described as a projection to the subcategory of $\sigma$-eigensheaves, but I don't know if that counts as nice for you (certainly it's not an easy description to directly compute with.)
1
2 3 4 5
25