Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1711.07854

Golod-Shafarevich type theorems and potential algebras

Natalia Iyudu·Agata Smoktunowicz
View original source ↗Read source document ↗Export metadata ↓

Abstract

Potential algebras feature in the minimal model program and noncommutative resolution of singularities, and the important cases are when they are finite dimensional, or of linear growth. We develop techniques, involving Gröbner basis theory and generalized Golod-Shafarevich type theorems for potential algebras, to determine finiteness conditions in terms of the potential. We consider two-generated potential algebras. Using Gröbner bases techniques and arguing in terms of associated truncated algebra we prove that they cannot have dimension smaller than $8$. This answers a question of Wemyss \cite{Wemyss}, related to the geometric argument of Toda \cite{T}. We derive from the improved version of the Golod-Shafarevich theorem, that if the potential has only terms of degree 5 or higher, then the potential algebra is infinite dimensional. We prove, that potential algebra for any homogeneous potential of degree $n\geq 3$ is infinite dimensional. The proof includes a complete classification of all potentials of degree 3. Then we introduce a certain version of Koszul complex, and prove that in the class ${\cal P}_n$ of potential algebras with homogeneous potential of degree $n+1\geq 4$, the minimal Hilbert series is $H_n=\frac{1}{1-2t+2t^n-t^{n+1}}$, so they are all infinite dimensional. Moreover, growth could be polynomial (but non-linear) for the potential of degree 4, and is always exponential for potential of degree starting from 5. For one particular type of potential we prove a conjecture by Wemyss, which relates the difference of dimensions of potential algebra and its abelianization with Gopakumar-Vafa invariants.

Explore related subjects

math.RAmath-phmath.GRmath.MPmath.QAmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Natalia Iyudu, Agata Smoktunowicz. 2017-11-21. Golod-Shafarevich type theorems and potential algebras. https://doi.org/10.1093/imrn%2Frnx315

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗