Re: topological and algebraic structures over strings and graphs
- From: fernando revilla <frej0002@xxxxxxxxxxxxxxxxxx>
- Date: Thu, 26 Jul 2007 11:27:39 EDT
sid myers wrote:
On Jul 26, 3:27 pm, galathaea <galath...@xxxxxxxxxx>
wrote:
there have been a flurry of posts recently on graphproblems
and their relation to the question of whetherp=np
simplistic model of relative geometry
also
i have recently been looking back upon a
based loosely on distance geometry with somederived "flat" dynamics
to see if i could develop some generalisations orfurthur results
and the formulation has been in terms of certainstructures over graphs
that may be useful in some of the other graphpursuits
can elicit some references
so i thought i'd post some ramblings and see if i
open sets)
-+-+-
take a graph G with the chain topology (chains as
ie. vertex x is in a neighborhood of vertex yverticesOf(P)
iff thereExists a walk P with x, y e
components
this topology preserves the notion of graph
and thierry vallée
last year a paper by alain bretto, alain faisant,
"compatible topologies on graphs " in the greatjournal "theoretical computer science"
showed the graph isomorphism problem is polynomialtime equivalent to the topological homeomorphism
problem
by analysing a class of compatible topologiesvertex subsets )
( topologies that preserve connectedness of
correspondences
the chain topology is a compatible topology
-+++-
kontsevich has given an amazing set of homological
here
he has shown that
H (lie algebra) = H (graph complex) = H (group)
* * *
http://arxiv.org/pdf/math/0211464
there appears to be much computational information
but i'm not sure how one pulls it off...language of algorithms over graphs
i need to
- define explicitly how p=np is stated in the
and detail the interpretations of thosestructures in the topology of it's dynamics
- provide a means of specifying graph problemsinside the structure of the first step
- define the asymptotic measure to define timecomplexity of queries
isomorphism here?
probably most important to focus on the subgraph
or are there other natural problems to interpret?problems dependent here )
( i consider the clique and independent set
dynamics
now after reading some interesting associations
that allow interpretation in equations of
learn more about
http://arxiv.org/pdf/0704.3525
which fits into the models i have been trying to
that model finite collections of existentsover graph models of connection
each with distance states to other existents
generalising distance geometry to noneuclideaneven noncommutative geometries
i became interested in interpreting this in domaintheory and its fixed point theorems
or evenover my head
to keep complexity down because i was already
just a y-combinatorstrings rather than graphs
unrolling recursions
lambda expressions over graph data structures
@##$$..&%^^
but it seems it may be easier to get answers on
in strings
they are both computationally (turing) complete
and there are natural representations of graphs
( adjacency and incidence lists )strings?
and strings have a simple topology
how do i interpret the subgraph isomorphism in
problem here...
it seems there is a relabled incidence sublist
$%#&&^%&$&^&$&%^^&$%^&$&^$%^
anyway
as can be seen and as always
there are a lot of questions here and few answers
where to start?
good references?
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
galathaea: prankster, fablist, magician, liar
i've decided not to make you extinct. how would you
like to be an
honorary man?
This is your first post (Isn't it?) so, congratulations,
we really need scientific and well educated persons as
you are.
Fernando.
.
- Prev by Date: Re: Algebra with direct product...
- Next by Date: Re: applications of trig
- Previous by thread: M24, Golay Code, Griess Algebra, Monster
- Next by thread: algebraic curves in the projective plane and coordinate transformations
- Index(es):
Relevant Pages
|
