# Tagged Questions

The tag has no usage guidance.

210 views

### Curves embedding in plane

Given two closed simple(no self-intersection point) curves $C_1,C_2$ in the plane $\mathbb R^2$, is there a good way to judge whether one curve can be embedded inside the other one, here embedding ...
722 views

### Complexity of Turing Machine behavior

If one looks at the code for a Turing Machine (TM) with $q$ states and, let's say, $2$ symbols, they all look pretty much the same: A list of $5$-tuples:  < state, symbol{-}read, symbol{-}to{-}...
375 views

### Checking Mertens and the like in less than linear time or less than $\sqrt{x}$ space

Say you want to check that $|\sum_{n\leq x} \mu(n)|\leq \sqrt{x}$ for all $x\leq X$. (I am actually interested in checking that $\sum_{n\leq x} \mu(n)/n|\leq c/\sqrt{x}$, where $c$ is a constant, and ...
68 views

### Efficiently computing all equivariant maps between two $GL_n$-representations

This is sort of a strange question; if it's not appropriate for MathOverflow I apologize in advance. I'm in a situation where I'd like to be able to give a computer two $GL_n$ representations $V$ and ...
171 views

### Polygonal Mersenne numbers [closed]

I posted the same question on Math SE since this one got put on hold. Link to Math SE question:Polygonal Mersenne numbers Polygonal numbers are of the form $\cfrac {n^2(s-2)-n(s-4)}{2}$, where $s$ ...
63 views

### How to generate computational data in graph theory?

For a given number of nodes how many non-isomorphic graphs are available? Might be this is an open problem. For less number of vertices some computational statistics available. I want to get all non-...
65 views

304 views

### procedure-based (as opposed to definition-based) concepts

Euler's work on divergent series was guided by computational procedures, rather than any definition of the "value" of such a series. E.g., he was happy to have half a dozen procedures that indicated ...
397 views

### System of quadratic equations with 18 unknown

So I want to solve for a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r which satisfy the following system of equations: ( I only need positive integer (or 0) solution) a g + c h + b i + g j + i ...
3k views

### Important open problems that have already been reduced to a finite but infeasible amount of computation

Most open problems, when formalized, naturally involve quantification over infinite sets, thereby obviating the possibility, even in principle, of "just putting it on a computer." Some questions (e.g....