Abstract:
this essay will talk about the creative process in the visual arts. from psychic automatism as a precedure and artistic manner infuenced by surrealism, it's study goes forward as a complex process that merges the intelectual, the sensible and the unqualifable. it's fundation has it's roots in psychoanalysis, semiotics and historical creative practices. from the artistic experience of the author, different methods are put in discussion, methods that can be considered as a systematization for inspiration. to conclude, the text brings a remark of the surrealist movement, specially in argentina from the formative legacy of battle planas.

Abstract:
The algorithm reduces the running time of an algorithm of Frieze from O(n^{1.5)) to O(n^(4/3 + o)). It also introduces the concept of admissible permutations that is used in algorithms for obtaining solutions to the AP and the TSP.

Abstract:
This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton circuit(cycle)or else the algorithm points to at least one vertex that cannot belong to any hamilton circuit(cycle) of G. We give criteria for determining which vertices should be examined.

Abstract:
This paper improves algorithms given in math.CO/0012036. Although the graph (digraph) becomes non-random as the algorithm proceeds, the probability for success stays the same. We also give examples.

Abstract:
We clarify the exposition of Phases 2 and 3a in "The Floyd-Warshall Algorithm, the AP and the TSP". We also improve and simplify theorem 3.6 . In line with clarifying the exposition, we change the matrices in examples 3.4 and 3.5 of "The Floyd-Warshall Algorithm, the AP and the TSP II".

Abstract:
We give polynomial-time algorithms for obtaining hamilton circuits in random graphs, G, and random directed graphs, D. If n is finite, we assume that G or D contains a hamilton circuit. If G is an arbitrary graph containing a hamilton circuit, we conjecture that Algorithm G always obtains a hamilton circuit in polynomial time.

Abstract:
We use admissible permutations and a variant of the Floyd-Warshall algorithm to obtain an optimal solution to the Assignment Problem. Using another variant of the F-W algorithm, we obtain an approximate solution to the Traveling Salesman Problem. We also give a sufficient condition for the approximate solution to be an optimal solution.

Abstract:
The original version of this paper did not take into account that there may be solutions (x_0, y_o)in Z X Z of f(x,y) = x^3 + p(y)x + q(y) = 0 even though w_0 = (-3D(y_0))^(1/2) is irrational.

Abstract:
We improve proofs in "The Floyd-Warshall Algorithm, the AP and the TSP (III). We also simplify the method for obtaining a good upper bound for an optimal solution.