English
Related papers

Related papers: Tree modules

200 papers

We have developed a web-based pedagogical proof assistant, the Proof Tree Builder, that lets you apply rules upwards from the initial goal in sequent calculus and Hoare logic for a simple imperative language. We equipped our tool with a…

Logic in Computer Science · Computer Science 2023-03-13 Joomy Korkut

Let $A$ be a finite-dimensional algebra over an algebraically closed field $\Bbbk$. For any finite-dimensional $A$-module $M$ we give a general formula that computes the indecomposable decomposition of $M$ without decomposing it, for which…

Representation Theory · Mathematics 2017-03-24 Hideto Asashiba , Ken Nakashima , Michio Yoshiwaki

We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…

Logic · Mathematics 2024-05-17 Mark Kamsma

We provide criteria for the cyclotomic quiver Hecke algebras of type C to be semisimple. In the semisimple case, we construct the irreducible modules.

Representation Theory · Mathematics 2018-02-20 Liron Speyer

This paper provides the generating series for the embedding of tree-like graphs of arbitrary number of vertices, accourding to their genus. It applies and extends the techniques of Chan, where it was used to give an alternate proof of the…

Combinatorics · Mathematics 2017-02-10 Aaron Chun Shing Chan

We construct level-0 modules of the quantum affine algebra $\Uq$, as the $q$-deformed version of the Lie algebra loop module construction. We give necessary and sufficient conditions for the modules to be irreducible. We construct the…

High Energy Physics - Theory · Physics 2015-06-26 D. Altschuler , B. Davies

A practical method for constructing a nontrivial homomorphsim between Verma modules is described.

Representation Theory · Mathematics 2007-05-23 W. A. de Graaf

We study twisted modules for (weak) quantum vertex algebras and we give a conceptual construction of (weak) quantum vertex algebras and their twisted modules. As an application we construct and classify irreducible twisted modules for a…

Quantum Algebra · Mathematics 2008-12-18 Haisheng Li , Shaobin Tan , Qing Wang

We use Block's results to classify irreducible modules over the differential operator algebra $\mathbb{C}[t,t^{-1}, \frac d{dt}]$. From this classification and using "the twisting technique" we construct a lot of new irreducible modules…

Representation Theory · Mathematics 2019-08-09 Rencai Lu , Kaiming Zhao

Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data-structures. Categorically, they arise as final coalgebras for polynomial…

Category Theory · Mathematics 2007-05-23 Benno van den Berg , Federico de Marchi

Let $\Bbbk$ be an algebraically closed field and $\Lambda$ a generalized Brauer tree algebra over $\Bbbk$. We compute the universal deformation rings of the periodic string modules over $\Lambda$. Moreover, for a specific class of…

Representation Theory · Mathematics 2025-04-15 Jhony F. Caranguay-Mainguez , Pedro Rizzo , José A. Vélez-Marulanda

We consider Hilbert series associated to modules over various categories of trees. Using the technology of Sam and Snowden, we show that these Hilbert series must be algebraic. We then apply these technical theorems to prove facts about…

Combinatorics · Mathematics 2020-07-14 Eric Ramos

In this paper, we first construct the twisted full toroidal Lie algebra by an extension of a centreless Lie torus $LT$ which is a multiloop algebra twisted by several automorphisms of finite order and equipped with a particular grading. We…

Representation Theory · Mathematics 2021-03-22 Souvik Pal , S. Eswara Rao

We define new combinatorial objects, called shrubs, such that forests of rooted trees are shrubs. We then introduce a structure of operad on shrubs. We show that this operad is contained in the Zinbiel operad, by using the inclusion of…

Quantum Algebra · Mathematics 2009-02-13 Frédéric Chapoton

In a recent paper we introduced a new framework for the study of call by need computations to normal form and root-stable form in term rewriting. Using elementary tree automata techniques and ground tree transducers we obtained simple…

Logic in Computer Science · Computer Science 2011-11-29 Irène Durand , Aart Middeldorp

We present a new method to count unrooted maps on the sphere up to orientation-preserving homeomorphisms. The principle, called tree-decomposition, is to deform a map into an arborescent structure whose nodes are occupied by constrained…

Combinatorics · Mathematics 2007-05-23 Eric Fusy

In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degree and nontrivial class group. Using the algorithm over…

Number Theory · Mathematics 2007-11-27 Lassina Dembele , Steve Donnelly

We start by constructing a new root system for rational triple singularities and determine the number of roots for each rational triple singularity. Then we show that, for each root, we obtain a linear free divisor. So we obtain a new…

Algebraic Geometry · Mathematics 2017-12-12 K. Nakamoto , A. Sharland , M. Tosun

This paper, dating from May 1991, contains preliminary (and unpublishable) notes on investigations about iteration trees. They will be of interest only to the specialist. In the first two sections I define notions of support and embeddings…

Logic · Mathematics 2016-09-06 William Mitchell

We construct all finite irreducible modules over Lie conformal superalgebras of type K

Mathematical Physics · Physics 2014-11-20 Carina Boyallian , Victor G. Kac , Jose I. Liberati
‹ Prev 1 3 4 5 6 7 10 Next ›