5,389 reputation
930
bio website cs.ox.ac.uk/people/…
location Oxford, United Kingdom
age 51
visits member for 4 years, 9 months
seen Aug 29 at 1:34

Apr
30
comment the complex representations of $B(2, \overline{\mathbb{F}_p})$
please see the Help on how to properly typeset maths here. Thanks.
Apr
30
comment the complex representations of $B(2, \overline{\mathbb{F}_p})$
what is Fp? Is it $\mathbb{F}_p$? Or something else?
Apr
29
reviewed Leave Open Is there something like “Noncommutative geometry internal to a category”?
Apr
29
reviewed Leave Open Rees rings and a formula
Apr
29
reviewed Leave Open Area of a plane surface that gives a lot of theoretical problems
Apr
29
reviewed Leave Open Suggestions on the best introductory Model Theory texts
Apr
28
reviewed Leave Closed Mathematics of Computer science and AI
Apr
28
reviewed Close Plane measurable sets and measurable rectangle
Apr
28
reviewed Leave Open Obstructions for a group to be the multiplicative group of a field
Apr
28
comment Generalization of Schur polynomials
@PerAlexandersson: hmm, sorry, I thought I saw there something like the Cauchy identity. But perhaps I was dreaming :-)
Apr
28
comment lower bound on A(k,4,floor(k/2))
Did you compare this with known upper bounds (e.g. Delsarte bound)?
Apr
28
revised lower bound on A(k,4,floor(k/2))
added 18 characters in body
Apr
28
reviewed Leave Open Atiyah's vector bundles over an elliptic curve
Apr
28
comment Generalization of Schur polynomials
how about multisymmetric ones, such as e.g. in arxiv.org/abs/math/0405490 ?
Apr
28
reviewed Close Algebraic Groups of Type H_3 and H_4
Apr
28
reviewed Close Backward Uniqueness for the wave equation
Apr
28
reviewed Close What defines a “short proof”?
Apr
28
reviewed Leave Open Good ways to organize old personal mathematical resources
Apr
28
reviewed Approve Is the set $ AA+A $ always at least as large as $ A+A $?
Apr
27
comment Complexity :: Integer Programming :: Non-Poly Example
an example in this area is something that depends on a parameter; say, an array of length $n$ of integer numbers, and the task is to sort them; or a graph on $n$ vertices, and the task is to find a maximum clique. See, it's crucial that there is $n$ involved, because the question computational complexity answers is "provide a function of $n$ that tells the number of operations needed to solve the task".