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

Dec
18
revised Balanced binary code that “resists” local decoding?
fixed a typo
Dec
18
revised Balanced binary code that “resists” local decoding?
added missing index
Dec
18
comment Balanced binary code that “resists” local decoding?
there is a discrepancy in the definition of $k$ vs examples; e.g. your 1st example corresponds to $k=1$, according to your definition.
Dec
18
answered Balanced binary code that “resists” local decoding?
Dec
17
revised finding dominating cycles in $2K_2$-free graphs
clarified...
Dec
17
comment finding dominating cycles in $2K_2$-free graphs
sure, that is right.
Dec
17
comment automorphism of prime order for group of Lie type in
You can have a look at the "Atlas of finite groups" by J.Conway et al., which has a lot of info on $O_8^+(\mathbb{F}_3)$.
Dec
17
revised finding dominating cycles in $2K_2$-free graphs
missing word in the definition added
Dec
17
asked finding dominating cycles in $2K_2$-free graphs
Dec
14
comment when can I say that $UV^T$ is a permutation matrix?
"make an index"? what's that?
Dec
14
comment finding permutation matrix I which minimizes TRACE( I* C*( I^T)* D) matrix
you might like to check out arxiv.org/abs/1403.7721 for up to date references etc
Dec
14
comment finding permutation matrix I which minimizes TRACE( I* C*( I^T)* D) matrix
i.e. instead of n! permutations you might still need to check something like $2^n$ of them.
Dec
14
comment finding permutation matrix I which minimizes TRACE( I* C*( I^T)* D) matrix
well, there was a lot of research done on this problem. it would not be necessary to check a fraction of all permutations of n symbols, but still nobody knows how to check less than exponentially (in terms of n) many of them.
Dec
13
answered finding permutation matrix I which minimizes TRACE( I* C*( I^T)* D) matrix
Dec
12
comment Dihedral subgroups of $\mathrm{PSL}_2(\mathbb{F}_q)$
IMHO this is already in L.Dickson's book "Linear Groups", which was reprinted by Dover in 1958.
Dec
9
reviewed Approve Real-world applications of mathematics, by arxiv subject area?
Nov
26
awarded  Yearling
Nov
25
awarded  Revival
Nov
15
comment Can any bounded area defined by polynomial inequality in $\mathbb{R}^n$ be partitioned into simply connected finite area such that
it is well-known that any semialgebraic set can be triangulated. The question you ask seems like a particular case of this fact.
Nov
9
answered Polynomial-time algorithm for determining whether a polynomial is positive on $\mathbb{N}$