Results 61 to 70 of about 173,309,485 (168)

Automorphism in gauge theories: Higher symmetries and transversal non-Clifford logical gates

SciPost Physics
Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories.
Po-Shen Hsin, Ryohei Kobayashi
doaj   +1 more source

On automorphism groups of binary cyclic codes

Designs, Codes and Cryptography
A lot of attention has been paid to the investigation of the algebraic properties of linear codes. In most cases, this investigation involves the determination of required code automorphisms, which are useful for decoders, such as the automorphism ensemble decoder. It is worth noting that the examination of the automorphism groups of discrete symmetric
Jicheng Ma, Guiying Yan
openaire   +2 more sources

The geometry of zonotopal algebras II: Orlik–Terao algebras and Schubert varieties

Proceedings of the London Mathematical Society, Volume 132, Issue 6, June 2026.
Abstract Zonotopal algebras, introduced by Postnikov–Shapiro–Shapiro, Ardila–Postnikov, and Holtz–Ron, show up in many different contexts, including approximation theory, representation theory, Donaldson–Thomas theory, and hypertoric geometry. In the first half of this paper, we construct a perfect pairing between the internal zonotopal algebra of a ...
Colin Crowley, Nicholas Proudfoot
wiley   +1 more source

On authomorphisms of extremal type II codes

Revista Integración, 2013
In this article we present some techniques to determine the types of automorphisms of extremal doubly even binary self-dual codes, also called extremal type II codes, with parameters [24, 12, 8], [48, 24, 12] and [120, 60, 24].
Ismael Gutiérrez García, Darwin Villar Salinas   +1 more
doaj  

On the automorphism groups of binary linear codes

CoRR, 2013
Let C be a binary linear code and suppose that its automorphism group contains a non trivial subgroup G. What can we say about C knowing G? In this paper we collect some answers to this question in the cases G=C_p, G=C_2p and G=D_2p (p an odd prime), with a particular regard to the case in which C is self-dual.
openaire   +2 more sources

Heights of Butterfly Trees

Random Structures &Algorithms, Volume 68, Issue 3, May 2026.
ABSTRACT Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding internal BSTs into the nodes of an external BST—a structure motivated by parallel data architectures—corresponding to composite permutations formed via Kronecker or ...
John Peca‐Medlin, Chenyang Zhong
wiley   +1 more source

No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits

PRX Quantum
Identifying stabilizer codes that admit fault tolerant implementations of the full logical Clifford group would significantly advance fault tolerant quantum computation, as such implementations prevent uncontrolled error propagation.
Aranya Chakraborty, Daniel Gottesman
doaj   +1 more source

On Quadratic Equations of the q-Regular Tree and Their Applications in Graph Theory and Cryptography

Mathematics
Graphs D(n,q) and their connected components CD(n,q) were defined 30 years ago. We briefly review their applications to Extremal Graph Theory, Spectral Graph Theory, Algebraic Graph Theory, Symmetric Cryptography, and Theory of Low Density Parity Check ...
Vasyl Ustimenko, Tymoteusz Chojecki
doaj   +1 more source

Which singular tangent bundles are isomorphic?

Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract Logarithmic and b$ b$‐tangent bundles provide a versatile framework for addressing singularities in geometry. Introduced by Deligne and Melrose, these modified bundles resolve singularities by reframing singular vector fields as well‐behaved sections of these singular bundles.
Eva Miranda, Pablo Nicolás
wiley   +1 more source

Automorphisms and Encoding of AG and Order Domain Codes

, 2007
We survey some encoding methods for AG codes, focusing primarily on one approach utilizing code automorphisms. If a linear code C over Fq has a finite abelian group H as a group of automorphisms, then C has the structure of a module over a polynomial ...
John B. Little
core