Results 41 to 50 of about 173,309,485 (168)

A zero–one law for the spectral gap property of pairs in SU(2)$\mathrm{SU}(2)$

Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.
Abstract For n⩾2$n \geqslant 2$, Gamburd, Jakobson, and Sarnak [J. Eur. Math. Soc. 1 (1999), 51–85] conjectured that almost every n$n$‐tuple in SU(2)$\mathrm{SU}(2)$ has a spectral gap. Toward this conjecture, Fisher [Int. Math. Res. Not. (2006), Art. ID 26028] established a zero–one law for n⩾3$n \geqslant 3$, but obtained only a partial result for n ...
Oleg Pikhurko, Kohki Sakamoto
wiley   +1 more source

Competing automorphisms and disordered Floquet codes [PDF]

Topological order is a promising basis for quantum error correction, a key milestone towards large-scale quantum computing. Floquet codes provide a dynamical scheme for this while also exhibiting Floquet-enriched topological order where anyons ...

core   +2 more sources

Multisections of higher‐dimensional manifolds

Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.
Abstract Generalizing Heegaard splittings of 3‐manifolds and Gay–Kirby trisections of 4‐manifolds, we consider multisections of higher‐dimensional smooth (or PL) closed orientable manifolds, namely decompositions into 1‐handlebodies whose subcollections intersect along 1‐handlebodies, with global intersection a closed surface.
Fathi Ben Aribi, Sylvain Courte, Marco Golla, Delphine Moussard   +3 more
wiley   +1 more source

Isometry and automorphisms of constant dimension codes

Advances in Mathematics of Communications, 2013
We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
openaire   +3 more sources

Error-correcting codes for fermionic quantum simulation

SciPost Physics
Utilizing the framework of $\mathbb{Z}_2$ lattice gauge theories in the context of Pauli stabilizer codes, we present methodologies for simulating fermions via qubit systems on a two-dimensional square lattice. We investigate the symplectic automorphisms
Yu-An Chen, Alexey V. Gorshkov, Yijia Xu
doaj   +1 more source

Systems of imprimitivity for rank two quaternionic reflection groups

Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.
Abstract We revise the enumeration of the imprimitive rank two quaternionic reflection groups, adding missing groups and establishing isomorphisms between groups in the published tables. The isomorphisms are obtained as a consequence of the determination of the reflection groups with more than one system of imprimitivity.
D. E. Taylor
wiley   +1 more source

On the detection of knots by their traces in high dimensions

Proceedings of the London Mathematical Society, Volume 133, Issue 4, October 2026.
Abstract For every n⩾4$n\geqslant 4$, we demonstrate the existence of non‐isotopic, smooth (n−2)$(n-2)$‐knots in Sn$S^n$ with diffeomorphic traces. We give two proofs: the first by generalising the RBG link construction to all dimensions, and the second as an application of work of Plotnick.
Valentina Bais, Alessio Di Prisa, Daniel Hartman, Chun‐Sheng Hsueh, Marc Kegel, Alice Merz, Mark Pencovitch, Arunima Ray, Diego Santoro, Paula Truöl, Laura Wakelin   +10 more
wiley   +1 more source

Automorphism groups of cyclic codes [PDF]

Journal of Algebraic Combinatorics, 2009
In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated wreath products of several symmetric groups.
Bienert, Rolf, Klopsch, Benjamin
openaire   +2 more sources

Fine multidegrees, universal Gröbner bases, and matrix Schubert varieties

Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.
Abstract We give a criterion for a collection of polynomials to be a universal Gröbner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in (P1)N$(\mathbb {P}^1)^N$. This criterion can be used to give simple proofs of several existing results on universal Gröbner bases.
Daoji Huang, Matt Larson
wiley   +1 more source

THEORY OF NORMAL syndrome and PLUS-decoding

Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019
The results of the study are not primitive BCH codes with decoding the guide, the potential is much greater than the design possibilities. The efficiency of automorphisms of codes, norms theory syndromes in the correction of all admissible-Mykh minimum ...
V. A. Lipnitski, A. O. Aliaksiuk
doaj