1.1k citations
- École Polytechnique Fédérale de LausanneCH2 papers
- Universität GreifswaldDE2 papers
- University of WollongongAU2 papers
- Arizona State UniversityUS1 paper
- Australian Defence Force AcademyAU1 paper
- Australian National UniversityAU1 paper
- California State University, NorthridgeUS1 paper
- Cavendish HospitalGB1 paper
- Dartmouth CollegeUS1 paper
- Dartmouth HospitalGB1 paper
- Data61AU1 paper
- Institut de Mathématiques de BourgogneFR1 paper
15 papers
Covariant representations of Hecke algebras and imprimitivity for crossed products by homogeneous spaces
Astrid an Huef, S. Kaliszewski, Iain Raeburn
For discrete Hecke pairs , we introduce a notion of covariant representation which reduces in the case where is normal to the usual definition of covariance for the acti…
Superconductivity in Metal-mixed Ion-Implanted Polymer Films
A. P. Micolich, E. Tavenner, B. J. Powell +4
Ion-implantation of normally insulating polymers offers an alternative to depositing conjugated organics onto plastic films to make electronic circuits. We used a 50 keV nitrogen i…
Strength of convergence in the orbit space of a transformation group
Robert Archbold, Astrid an Huef
Let (G, X) be a second-countable transformation group with G acting freely on X. It is shown that measure-theoretic accumulation of the action and topological strength of convergen…
Spin Liquid Phase in Anisotropic Triangular Lattice Heisenberg Model: Exact diagonalization and density-matrix renormalization group calculations
M. Q. Weng, D. N. Sheng, Z. Y. Weng +1
Based on exact diagonalization and density matrix renormalization group (DMRG) method, we show that an anisotropic triangle lattice Heisenberg spin model has three distinct quantum…
Diamond representations of
Didier Arnal, Nadia Bel Baraka, Norman J. Wildberger
In \cite{W}, there is a graphic description of any irreducible, finite dimensional module. This construction, called diamond representation is very simple and ca…
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
Joost Engelfriet, Sebastian Maneth
It is decidable for deterministic MSO definable graph-to-string or graph-to-tree transducers whether they are equivalent on a context-free set of graphs.