51,204 research outputs found
Preliminary results of the determination of the orientation of Interkosmos-17 AUOS
An algorithm for determining the orientation of the Interkosmos-17 automatic multipurpose orbital station is discussed. The graphs provided show variations of the satellite's orientation, relative to a given orientation in an orbital system of coordinates
A comment on the bianchi groups
In this paper, we aim to discuss several the basic arithmetic structure of Bianchi groups. In particularly, we study fundamental domain and directed orbital graphs for the group PSL(2;O_1)
Nonlocal Games and Quantum Permutation Groups
We present a strong connection between quantum information and quantum
permutation groups. Specifically, we define a notion of quantum isomorphisms of
graphs based on quantum automorphisms from the theory of quantum groups, and
then show that this is equivalent to the previously defined notion of quantum
isomorphism corresponding to perfect quantum strategies to the isomorphism
game. Moreover, we show that two connected graphs and are quantum
isomorphic if and only if there exists and that are
in the same orbit of the quantum automorphism group of the disjoint union of
and . This connection links quantum groups to the more concrete notion
of nonlocal games and physically observable quantum behaviours. We exploit this
link by using ideas and results from quantum information in order to prove new
results about quantum automorphism groups, and about quantum permutation groups
more generally. In particular, we show that asymptotically almost surely all
graphs have trivial quantum automorphism group. Furthermore, we use examples of
quantum isomorphic graphs from previous work to construct an infinite family of
graphs which are quantum vertex transitive but fail to be vertex transitive,
answering a question from the quantum group literature.
Our main tool for proving these results is the introduction of orbits and
orbitals (orbits on ordered pairs) of quantum permutation groups. We show that
the orbitals of a quantum permutation group form a coherent
configuration/algebra, a notion from the field of algebraic graph theory. We
then prove that the elements of this quantum orbital algebra are exactly the
matrices that commute with the magic unitary defining the quantum group. We
furthermore show that quantum isomorphic graphs admit an isomorphism of their
quantum orbital algebras which maps the adjacency matrix of one graph to that
of the other.Comment: 39 page
Schreier graphs of the Basilica group
With any self-similar action of a finitely generated group of
automorphisms of a regular rooted tree can be naturally associated an
infinite sequence of finite graphs , where
is the Schreier graph of the action of on the -th level of .
Moreover, the action of on gives rise to orbital Schreier
graphs , . Denoting by the prefix of
length of the infinite ray , the rooted graph is
then the limit of the sequence of finite rooted graphs
in the sense of pointed Gromov-Hausdorff
convergence. In this paper, we give a complete classification (up to
isomorphism) of the limit graphs associated with the
Basilica group acting on the binary tree, in terms of the infinite binary
sequence .Comment: 32 page
- …