Tagged Questions

I cannot find anything giving the algebra of a quiver with a single cycle on three or more vertices. In other words if your quiver consists of n vertices (n>2), and e_i is connected to e_{i+1} (taking ...

Let $W(t_1,\dotsc,t_n)$ a holomorphic function on some connected open set $U$ of $\mathbb C^n$.
Let $\mathbf t^{(0)}$ a point of $U$.
Assume that there exists a cycle $\gamma$ in $\mathbb C^m$ and a ...

I'm looking for an algorithm which just counts the number of simple and distinct 4-cycles in an undirected graph labelled with integer keys. I don't need it to be optimal because I only have to use it ...

I recently stumbled across this SPOJ question:
http://www.spoj.com/problems/PISANO/ The question is simple. Calculate the pisano period of a number. After I researched my way through the web, I found ...

Generally speaking finding a Hamiltonian cycle is NP-Hard and so tough. But if $G=L(H)$ is the line graph of $G$ then we can reduce the finding of a Hamiltonian cycle in $G$ to a Eurler your of $H$ ...

This might be a very naive question but here it goes. Let X be a smooth variety of dimension d over a p-adic field. We have the n part of the rerciprocity map:
$rec/n: SK_1(X)/n \to \pi^{ab}_1(X)/n$
...

Can anyone give me a hint for an algorithm to find a simple cycle of length 4 (4 edges and 4 vertices that is) in an undirected graph, given as an adjacency list? It needs to use $O(v^3)$ operations ...