SearcharxivSearch

arXiv · 2401.00842

Generating subspace lattices, their direct products, and their direct powers

Abstract

In 2008, L\'aszl\'o Z\'adori proved that the lattice Sub$(V)$ of all subspaces of a vector space $V$ of finite dimension at least 3 over a finite field $F$ has a 5-element generating set; in other words, Sub$(V)$ is 5-generated. We prove that the same holds over every 1- or 2-generated field; in particular, over every field that is a finite degree extension of its prime field. Furthermore, let $F$, $t$, $V$, $d\geq 3$, $[d/2]$, and $m$ denote an arbitrary field, the minimum cardinality of a generating set of $F$, a finite dimensional vector space over $F$, the dimension (assumed to be at least $3$) of $V$, the integer part of $d/2$, and the least cardinal such that $m[d^2/4]$ is at least $t$, respectively. We prove that Sub$(V)$ is $(4+m)$-generated but none of its generating sets is of size less than $m$. Moreover, the $k$-th direct power of Sub$(V)$ is $(5+m)$-generated for many positive integers $k$; for all positive integers $k$ if $F$ is infinite. Finally, let $n$ be a positive integer. For $i=1,\dots, n$, let $p_i$ be a prime number or 0, and let $V_i$ be the 3-dimensional vector space over the prime field of characteristic $p_i$. We prove that the direct product of the lattices Sub$(V_1)$, ..., Sub$(V_n)$ is 4-generated if and only if each of the numbers $p_1$, ..., $p_n$ occurs at most four times in the sequence $p_1$, ..., $p_n$. Neither this direct product nor any of the subspace lattices Sub$(V)$ above is 3-generated.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gábor Czédli. 2024-01-01. Generating subspace lattices, their direct products, and their direct powers. https://arxiv.org/abs/2401.00842

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