Results 151 to 160 of about 167,102,035 (280)

Automorphism groups of some non-nilpotent Leibniz algebras

open access: yesResearches in Mathematics
Let $L$ be an algebra over a field $F$ with the binary operations $+$ and $[,]$. Then $L$ is called a left Leibniz algebra if it satisfies the left Leibniz identity: $[a,[b,c]]=[[a,b],c]+[b,[a,c]]$ for all $a,b,c\in L$. A linear transformation $f$ of $L$
L.A. Kurdachenko   +2 more
doaj   +1 more source

Fault-Tolerant Logical Clifford Gates from Code Automorphisms

open access: yesPRX Quantum
We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error-correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group, and impose ...
Hasan Sayginel   +4 more
doaj   +1 more source

Automorphisms of graph groups

open access: yesJournal of Algebra, 1989
Given a graph \(\Gamma=(V,E)\), the graph group \(F\langle\Gamma\rangle\) is the group with presentation \(\langle V\mid [E]\rangle\), where \([E]\) denotes the set of commutators \(\{[a,b]\mid\{a,b\}\in E\}\). The graph group \(F\langle\Gamma\rangle\) is modeled to be a group analog of the graph algebra K(\(\Gamma)\) generated as a free associative ...
openaire   +2 more sources

The group of inertial automorphisms of an abelian group (0)

open access: yes, 2014
We study the group $IAut(A)$ generated by inertial automorphisms of an abelian group $A$, that is automorphisms $\g$ with the property $|\la X,X\g\ra/X|
Silvana Rinauro, DARDANO, ULDERICO
core  

Computing efficiently in QLDPC codes. [PDF]

open access: yesNat Commun
Malcolm AJ   +12 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy