Related papers: The synchronisation hierarchy via coherent configu…
The quantization of particle trajectories gives rise to remarkable features such as the coherent superposition of quantum channels and the quantum switch, which offer significant advantages in the communication of both classical and quantum…
Quantum resource theories identify the features of quantum computers that provide their computational advantage over classical systems. We investigate the resources driving the complexity of classical simulation in the standard model of…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
Transitive consistency is an intrinsic property for collections of linear invertible transformations between Euclidean coordinate frames. In practice, when the transformations are estimated from data, this property is lacking. This work…
The implementation of physical symmetries into problem descriptions allows for the reduction of parameters and computational complexity. We show the integration of the permutation symmetry as the most restrictive discrete symmetry into…
Finite time coherent sets [8] have recently been defined by a measure based objective function describing the degree that sets hold together, along with a Frobenius-Perron transfer operator method to produce optimally coherent sets. Here we…
The genus spectrum of a finite group $G$ is the set of all $g\geq 2$ such that $G$ acts faithfully and orientation-preserving on a closed compact orientable surface of genus $g$. This article is an overview of some results relating the…
We give a general constructive proof for hierarchical coordinatizations (Lagrange Decompositions) of permutation groups. The generalization originates from the investigation of how the subgroup chains of finite permutation groups yield…
Let $G$ be a transitive permutation group on $\Omega$. The $G$-invariant partitions form a sublattice of the lattice of all partitions of $\Omega$, having the further property that all its elements are uniform (that is, have all parts of…
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
To any complex Hadamard matrix we associate a quantum permutation group. The correspondence is not one-to-one, but the quantum group encapsulates a number of subtle properties of the matrix. We investigate various aspects of the…
The commutativity degree of a finite group is the probability that two randomly chosen group elements commute. The main object of this paper is to obtain a characterization for all finite groups of odd order with commutativity degree…
The endomorphism algebras of the permutation modules for transitive permutation groups, known as Hecke algebras, are fundamental objects in representation theory. While group algebras are known to be symmetric over any field, it is natural…
We explicitly construct an Archimedean order unit space whose state space is affinely isomorphic to the set of quantum commuting correlations. Our construction only requires fundamental techniques from the theory of order unit spaces and…
We investigate the connection between the dynamics of synchronization and the modularity on complex networks. Simulating the Kuramoto's model in complex networks we determine patterns of meta-stability and calculate the modularity of the…
This is the first in a series of papers math.AG/0503029, math.AG/0410267, math.AG/0410268 on "configurations" in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration (\sigma,\iota,\pi) is a finite…
Let $\Omega=\{1,2,...,n\}$ where $n \ge 2$. The {\em shape} of an ordered set partition $P=(P_1,..., P_k)$ of $\Omega$ is the integer partition $\lambda=(\lambda_1,...,\lambda_k)$ defined by $\lambda_i = |P_i|$. Let G be a group of…
We consider the derived category of permutation modules for a finite group, in positive characteristic. We stratify this tensor triangulated category using Brauer quotients. We describe the spectrum of its compact objects, by reducing the…
Cycle prefix digraphs have been proposed as an efficient model of symmetric interconnection networks for parallel architecture. It has been discovered that the cycle prefix networks have many attractive communication properties. In this…
We consider a unitary circuit where the underlying gates are chosen to be R-matrices satisfying the Yang-Baxter equation and correlation functions can be expressed through a transfer matrix formalism. These transfer matrices are no longer…