Proof of the tree module property for exceptional representations of the quiver 𝔼_6

12/31/2019
by   Szabolcs Lénárt, et al.
0

This document (together with the ancillary file e6_proof.pdf) is an appendix to the paper [12]. The ancillary file contains the computer generated part of the proof of the main result in [12], giving a complete and general list of tree representations corresponding to exceptional modules over the path algebra of the canonically oriented Euclidean quiver 𝔼_6. The proof (involving induction and symbolic computation with block matrices) was partially generated by a purposefully developed computer software, outputting in a detailed step-by-step fashion as if written "by hand". Tree representations are exhibited using matrices involving only the elements 0 and 1, and all representations enlisted in the ancillary document remain valid over any base field.

READ FULL TEXT
research
09/01/2023

A FAIR File Format for Mathematical Software

We describe a generic JSON based file format which is suitable for compu...
research
05/13/2021

Verification of the Incremental Merkle Tree Algorithm with Dafny

The Deposit Smart Contract (DSC) is an instrumental component of the Eth...
research
12/05/2020

On matrices potentially useful for tree codes

Motivated by a concept studied in [1], we consider a property of matrice...
research
03/24/2016

Semantic Regularities in Document Representations

Recent work exhibited that distributed word representations are good at ...
research
11/22/2021

A Complete Axiom System for 1-Free Kleene Star Expressions under Bisimilarity: An Elementary Proof

Grabmayer and Fokkink recently presented a finite and complete axiomatiz...
research
03/05/2019

The Lustre Storage Architecture

This lengthy document often referred to as the "Lustre Book", contains a...

Please sign up or login with your details

Forgot password? Click here to reset