I'm trying to get a full n-quad entry in #Cayley with #python. But all the example queries (in the "Gremlin" API syntax) are restricted to getting a particular set of matching entries. Is there an equivalent of the SQL

```
SELECT * FROM graph WHERE subject = "Foo";
```

Help? :D

Using #Cayley as my knowledge graph with #python. (Entities and their relationships are in RDF N-quad format: "subject", "predicate", "object", "label".) But I can barely wrap my head around the Gizmo API syntax. Only simple queries make sense to my tiny brain! Like this returns all the predicates:

`query = graph.V("<predicates>").Out("<are>").All()`

And this returns all the things known about "Bob":

`query = graph.V("Bob").Out().All()`

But what about all predicates for Bob?

🤔

@[email protected]
Nice description and a not at all annoying speaker (which is always a help :-) )
#maths #algebras #Hamilton #Cayley

- By #Cayley's theorem, every group is #isomorphic to some #permutation group.

The way in which the elements of a permutation group permute the elements of the set is called its group action

the #Cayley graph of a group with polynomial growth a sequence of rescalings converges in the pointed Gromov–Hausdorff sense.
the #Cayley graph of a group with polynomial growth a sequence of rescalings converges in the pointed Gromov–Hausdorff sense.
It can be shown that the dimension is exactly two if no four of the points are collinear and no seven points lie on a conic. The #Cayley–Bacharach theorem can be deduced from this fact (#Hartshorne)
associativity of the group of elliptic curves.
It can be shown that the dimension is exactly two if no four of the points are collinear and no seven points lie on a conic. The #Cayley–Bacharach theorem can be deduced from this fact (#Hartshorne)
associativity of the group of elliptic curves.