5 votes

Complexity of establishing finite groups (non)-isomorphism ?

I agree w/ Holt's technical statements (not sure whether I agree about his guess on the final running time, though I agree about which groups are likely to be hardest). But I wanted to add that a lot ...
user avatar
2 votes
Accepted

3-partition of a special set

Here is one such partition of $S_5$, obtained via integer linear programming: \begin{align} A_0 &= \{aaaac,aaacb,aabca,aacba,ababc,abbac,abcab,abcba,acaaa,acbbb,baabc, babac,bacaa,bacbb,bbaca,...
user avatar
  • 3,820
1 vote

Sequence design to optimize a combinatorial objective

Suppose that there was a code $\mathcal{E}: \mathcal{N} \rightarrow \{0,1\}^{\omega(1)}$ that achieved this condition; in particular, we have two types of messages $p \in \mathcal{P} \subset \{0,1,......
user avatar
1 vote

Enumerating the elements of cartesian products in ascending order of $\|\cdot\|_1$ norm

Even the case $n=2$ is a well-known open problem, X + Y sorting. It is unknown whether one can list the elements faster than the time it would take to apply a general-purpose sorting algorithm. If you ...
user avatar

Only top scored, non community-wiki answers of a minimum length are eligible