# Tagged Questions

The tag has no usage guidance.

100 views

### Heuristics for counting degrees of freedom

I have recently learned about the representation theorem for isotropic, linear operators, which says the following: Defintion: Let $M_n$ be the vector space of $n \times n$ real matrices. We say a ...
24 views

### A new Class of Matching-based Divide and Conquer Heuristics for TSP?

Under the assumption that $G=:G_0$ is a complete graph with $2^n$ vertices and arbitrary edge weights, the essential idea to construct the shortest Hamilton cycle is to proceed as follows: i := 0 ...
23 views

### Performance guarantee of RLF [closed]

I cannot manage to find the performance guarantee of the Recursive Largest First (RLF) algorithm for approximating the chromatic number of a graph. I know DSATUR has a $\mathcal{O}(n)$ guarantee, ...
213 views

### Heuristic probabilistic argument for the Navier-Stokes existence and smoothness conjecture

The Collatz Conjecture is a famous conjecture that has never been proven; nevertheless, there exists a simple heuristic probabilistic argument which supports its truth - in Wikipedia's words, "If one ...
2k views

### What are reasons to believe that e is not a period?

I hope this rather soft question is suitable for MO, otherwise please migrate it to MSE. In their paper defining periods [1], Kontsevich and Zagier without further comment state that $e$ is ...
437 views

### Categories with binary relations as objects

For the category of functions, pairs of functions making commutative diagrams are the canonical morphisms $\alpha:f\rightarrow g$. For binary relations there is an alternative, to consider the ...
270 views

### Cohen-Lenstra heuristics for totally complex fields

If a number field $K$ is a Galois extension of $\mathbb{Q}$, and $G = \operatorname{Gal}(K/\mathbb{Q})$, then the class group of $K$ is a $\mathbb{Z}[G]$-module, and since $N = \sum_{g \in G} g$ acts ...
131 views

### Reduce a Combinatorial problem

It is given n sets with k vectors. (k is element-wise positive or zero) Choose one vector of each set so that the biggest element of the sum of the chosen vectors is minimal. What i also know but is ...
60 views

### Heuristic for choosing n-vectors from n-sets

my given problem is: choose n-vectors from n-sets (one vector from each set) so that the biggest element in the sum of the chosen vectors is minimal. Unfortunately the problem is NP-hard. So I'm ...
3k views

### Non-rigorous reasoning in rigorous mathematics

I was wondering what role non-rigorous, heuristic type arguments play in rigorous math. Are there examples of rigorous, formal proofs in which a non-rigorous reasoning still plays a central part? ...
168 views

### unfolding as resolution

Has anyone described 'unfolding' as used in mathematical physics (e.g. on-shell AND off-shell) as analogous to a resolution in algebra - higher derivatives are unfolded in terms of new variables?
252 views

### Formula in common: How to search for same/similar equations in other knowledge domains?

Hi people In a recent presentation by Sedgewick, he recounts in 1977 Flajolet noticed that they had a formula in common, both in different domains (see slide 4 in http://www.cs.princeton.edu/~rs/...
469 views

1k views

### Groupoids vs Pseudogroups

(Warning: I'm not an expert in the topic) Let's work in a "geometric" category, for example the category $\mathfrak{Diff}$ of "manifolds" (without the requirements of connectedness and second ...
In category theory a morphism is constant IIF it is absorbing (for left composition). That is a morphism $k$ from $k:A\rightarrow B$ is constant if an only if for any two parrallel (same domain and ...