DeepAI AI Chat
Log In Sign Up

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
05/13/2021

Verification of the Incremental Merkle Tree Algorithm with Dafny

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

On matrices potentially useful for tree codes

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

Semantic Regularities in Document Representations

Recent work exhibited that distributed word representations are good at ...
02/01/2023

Formalizing π_4(𝕊^3) ≅ℤ/2ℤ and Computing a Brunerie Number in Cubical Agda

Brunerie's 2016 PhD thesis contains the first synthetic proof in Homotop...
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...
03/05/2019

The Lustre Storage Architecture

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