Related papers: Obstructions to universality in globally controlle…
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there are several ways for forbidding a graph, we observe that it is reasonable to focus on the minor relation since other well-known relations lead…
We study one-loop quantum corrections to gauge couplings in heterotic vacua with spontaneous supersymmetry breaking. Although in non-supersymmetric constructions these corrections are not protected and are typically model dependent, we show…
We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…
We study how the problem of observables is fully resolved for background independent theories defined on finite graphs. We argue the correct analogue of coordinate independence is the invariance under changes of graph labels, a kind of…
It is not currently known if quantum Turing machines can efficiently simulate probabilistic computations in the space-bounded case. In this paper we show that space-bounded quantum Turing machines can efficiently simulate a limited class of…
We discuss generalizations of the notion of i) the group of unitary elements of a (real or complex) finite dimensional C*-algebra, ii) gauge transformations and iii) (real) automorphisms, in the framework of compact quantum group theory and…
In a topological space, a family of continuous mappings is called universal if its action, in at least one element of the space, is dense. If the mappings are unitary or trace-preserving completely positive, the notion of universality is…
We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using…
A mixed graph $G$ is a graph obtained from a simple undirected graph by orientating a subset of edges. $G$ is self-converse if it is isomorphic to the graph obtained from $G$ by reversing each directed edge. For two mixed graphs $G$ and $H$…
Leighton's graph covering theorem states that two finite graphs with common universal cover have a common finite cover. We generalize this to a large family of non-positively curved special cube complexes that form a natural generalization…
In this work, the assembly map in L-theory for the family of finite subgroups is proven to be a split injection for a class of groups. Groups in this class, including virtually polycyclic groups, have universal spaces that satisfy certain…
We investigate the automorphism group of the quantised enveloping algebra U of the positive nilpotent part of certain simple complex Lie algebras g in the case where the deformation parameter q \in \mathbb{C}^* is not a root of unity.…
Let $G$ be a graph on $n$ vertices with adjacency matrix $A$, and let $\mathbf{1}$ be the all-ones vector. We call $G$ controllable if the set of vectors $\mathbf{1}, A\mathbf{1}, \dots, A^{n-1}\mathbf{1}$ spans the whole space…
The ability to control a complex network towards a desired behavior relies on our understanding of the complex nature of these social and technological networks. The existence of numerous control schemes in a network promotes us to wonder:…
We study quantum systems with even numbers N of levels that are completely state-controlled by unitary transformations generated by Lie algebras isomorphic to sp(N) of dimension N(N+1)/2. These Lie algebras are smaller than the respective…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
Automorphisms of the quantum Schubert cell algebras ${\mathcal U}_q^\pm[w]$ of De Concini, Kac, Procesi and Lusztig and their restrictions to some key invariant subalgebras are studied. We develop some general rigidity results and apply…
The class of quasi-chain graphs is an extension of the well-studied class of chain graphs. This latter class enjoys many nice and important properties, such as bounded clique-width, implicit representation, well-quasi-ordering by induced…
Let $A_n$ be an $n$-dimensional algebra with zero multiplication over a field $K$ of characteristic $0$. Then its universal (multiplicative) enveloping algebra $U_n$ in the variety of left-symmetric algebras is a homogeneous quadratic…
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used…