Math Forum / Mathematics / Research / July 2009

Hello, I found a new labeling vertex, which can make the deference
between the peaks of a graph, and thus resolve the automorphism and
isomorphism. Its complexity is estimated to O (n^3).
And here is the procedure:

Dear group,
In his "Topics in nonlinear functional analysis" L. Nirenberg states
the following problem.
Let f:H\to H be a continuous map in a Hilbert space, and

Hi group!
I need to have the following assertion.
Let f:R^n--> R^n be a continuous map such that |f(x)|--> \infty as |
x|-->\infty;

Dear Professors,
The note titled
On the order of magnitude of the partial sum of the Liouville function
is available to anyone via the arXiv; the ID is arXiv:0906.4155.

Hello, all!
Recall that a group is perfect if and only if its abelianization is
trivial. Equivalently, P is perfect if and only if its first homology
group, H_1(P) = 0. A groups S is superperfect if and only if H_1(S) =

I read a note (a technical paper or a tutorial, I don't remember) some
years ago about different ways to express specific constraints such as
OR, IF...THEN... in a linear programming problem. Unfortunately I
can't find it again.

Let 0<a<=1 and consider recursive equation x[n-1]*cosx[n]=x[n] with x
[0]=a.
I can prove that sequence (x[n]) is decreasing, belongs to interval
(0,1] and limx[n]

I was wondering what is known about hinged quadrilateral panel systems.
If you connect 4 quadrilateral panels, using hinges like this
    A|B
    - -

Suppose I have n sets of points in d (typically d=2) dimensions and I
would like to obtain a new set of points, each of which is close to
at
least one point from each of the n sets.

Please notice that my book "Associative Digital Network Theory"
was just released by Springer Verlag, see :
http://www.springer.com/computer/communications/book/978-1-4020-9828-4
It is about the use of function composition (semigroup theory) as