SearcharxivSearch

arXiv · 2206.08286

The Question of Arnold on classification of co-artin subalgebras in singularity theory

Abstract

In \cite[Section 5, p.32]{Arnold-1998}, Arnold writes: "Classification of singularities of curves can be interpreted in dual terms as a description of 'co-artin' subalgebras of finite co-dimension in the algebra of formal series in a single variable (up to isomorphism of the algebra of formal series)." In the paper, such a description is obtained but up to isomorphism of algebraic curves (i.e. this description is finer). Let $K$ be an algebraically closed field of arbitrary characteristic. The aim of the paper is to give a classification (up to isomorphism) of the set of subalgebras $\mathcal{A}$ of the polynomial algebra $K[x]$ that contains the ideal $x^mK[x]$ for some $m\geq 1$. It is proven that the set $\mathcal{A} = \coprod_{m, \Gamma }\mathcal{A} (m, \Gamma )$ is a disjoint union of affine algebraic varieties (where $\Gamma \coprod \{0, m, m+1, \ldots \}$ is the semigroup of the singularity and $m-1$ is the Frobenius number). It is proven that each set $\mathcal{A} (m, \Gamma )$ is an affine algebraic variety and explicit generators and defining relations are given for the algebra of regular functions on $\mathcal{A} (m ,\Gamma )$. An isomorphism criterion is given for the algebras in $\mathcal{A}$. For each algebra $A\in \mathcal{A} (m, \Gamma)$, explicit sets of generators and defining relations are given and the automorphism group ${\rm Aut}_K(A)$ is explicitly described. The automorphism group of the algebra $A$ is finite iff the algebra $A$ is not isomorphic to a monomial algebra, and in this case $|{\rm Aut}_K(A)|<{\rm dim}_K(A/\mathfrak{c}_A)$ where $\mathfrak{c}_A$ is the conductor of $A$. The set of orders of the automorphism groups of the algebras in $\mathcal{A} (m , \Gamma )$ is explicitly described.

Explore related subjects

Keep this discovery

BibTeXRIS

V. V. Bavula. 2022-06-16. The Question of Arnold on classification of co-artin subalgebras in singularity theory. https://arxiv.org/abs/2206.08286

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

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA