Search arXivSearch

arXiv · 2605.02719

Classification of isomorphism classes of lattices from Construction A and B

Abstract

In this paper, we completely classify the isomorphism classes of certain lattices $L_A(C)$ and $L_B(C)$ from a self-orthogonal code $C$ over the finite field $\mathbb{F}_p$, where $p$ is an odd prime. These lattices are obtained by \emph{Construction A} and \emph{B} for a code $C$ over $\mathbb{F}_p$ introduced by Lam and Shimakura, which arose from a study of orbifolds of lattice vertex operator algebras. For self-orthogonal codes $C$ and $D$ of the same length over $\mathbb{F}_p$, we show that $L_X(C) \cong L_X(C)$ as lattices if and only if $C \cong D$ as codes, where $X=A$ or $B$. This can be expected to be lattice analogues of classifications of the isomorphism classes of lattice vertex operator algebras and its orbifolds. To prove the result, we generalize the notion of a frame of a lattice and define some codes which are analogues of codes constructed from Kleinian codes studied by H{ö}hn.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Takara Kondo. 2026-05-04. Classification of isomorphism classes of lattices from Construction A and B. https://arxiv.org/abs/2605.02719

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO