bio | website | cs.ox.ac.uk/people/… |
---|---|---|
location | Oxford, United Kingdom | |
age | 51 | |
visits | member for | 4 years, 5 months |
seen | 5 hours ago | |
stats | profile views | 2,226 |
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 |
reviewed | Close indecomposable finite groups |
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 |
reviewed | Close Derive a closed formula for the generating function of this recurrence relation |
Apr 28 |
reviewed | Close Packing, Optimization |
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 | Leave Closed Specific examples or applications of homotopy coherent diagrams |
Apr 28 |
reviewed | Close Parallel transport along a geodesic and the related Jacobi field |
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 | Close $GL(2, \mathbb{Z})$ modular form |
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". |
Apr 27 |
comment |
Complexity :: Integer Programming :: Non-Poly Example
the notions of NP-completeness and polynomial-time solvability are about classes of problems, and not individual examples. |