Search arXivSearch

arXiv · 1310.1910

On the Mahler measure of the Coxeter polynomials of algebras

Abstract

Let $A$ be a finite dimensional algebra over an algebraically closed field $k$. Assume $A$ is a basic connected and triangular algebra with $n$ pairwise non-isomorphic simple modules. We consider the {\em Coxeter transformation} $ϕ_A(T)$ as the automorphism of the Grothendieck group $K_0(A)$ induced by the Auslander-Reiten translation $τ$ in the derived category $\Der^b(\mod_A)$ of the module category $\mod_A$ of finite dimensional left $A$-modules. We say that $A$ is of {\em cyclotomic type} if the characteristic polynomial $χ_A$ of $ϕ_A$ is a product of cyclotomic polynomials, equivalently, if the {\em Mahler measure} $M(χ_A)=1$. In \cite{Pe} we have considered the many examples of algebras of cyclotomic type in the representation theory literature. In this paper we study the Mahler measure of the Coxeter polynomial of {\em accessible algebras}. In 1933, D. H. Lehmer found that the polynomial $T^{10} + T^9 - T^7 - T^6 - T^5 - T^4 - T^3 + T + 1$ has Mahler measure $μ_0 = 1.176280 . . .$, and he asked if there exist any smaller values exceeding 1. In this paper we prove that for any accessible algebra $A$ either $M(χ_A)=1$ or $M(χ_B) \ge μ_0$ for some convex subcategory $B$ of $A$. We introduce {\em interlaced tower of algebras} $A_m,\ldots,A_n$ with $m \le n-2$ satisfying $$χ_{A_{s+1}} =(T+1) χ_{A_s} - T χ_{A_{s-1}}$$ for $m+1 \le s \le n-1$. We prove that, if ${\rm Spec \,}ϕ_{A_n} \subset \s^1 \cup \R^+$ and $A_n$ is not of cyclotomic type then $M(χ_{A_m}) <M(χ_{A_n})$.

Explore related subjects

Keep this discovery

BibTeXRIS

José-Antonio de la Peña. 2013-10-06. On the Mahler measure of the Coxeter polynomials of algebras. https://arxiv.org/abs/1310.1910

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