English
Related papers

Related papers: Tree modules and limits of the approximation theor…

200 papers

After stating several tools which can be used to construct indecomposable tree modules for quivers without oriented cycles, we use these methods to construct indecomposable tree modules for every imaginary Schur root. These methods also…

Representation Theory · Mathematics 2014-02-26 Thorsten Weist

The categories of almost modules and almost algebras are introduced as a convenient setting for the development of Faltings' method of almost etale extensions. After some preliminaries of general "almost homological algebra" we construct…

Algebraic Geometry · Mathematics 2007-05-23 Ofer Gabber , Lorenzo Ramero

We introduce tree dimension and its leveled variant in order to measure the complexity of leaf sets in binary trees. We then provide a tight upper bound on the size of such sets using leveled tree dimension. This, in turn, implies both the…

Combinatorics · Mathematics 2022-05-24 Roland Walker

\emph{Approximation Theory} uses nicely-behaved subcategories to understand entire categories, just as projective modules are used to approximate arbitrary modules in classical homological algebra. We use set-theoretic \emph{elementary…

Logic · Mathematics 2024-06-13 Sean Cox

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…

Combinatorics · Mathematics 2024-02-14 Rudolf Grübel

We study derivations and Fredholm modules on metric spaces with a local regular conservative Dirichlet form. In particular, on finitely ramified fractals, we show that there is a non-trivial Fredholm module if and only if the fractal is not…

Operator Algebras · Mathematics 2018-06-29 Marius Ionescu , Luke G. Rogers , Alexander Teplyaev

Modularity is a very widely used measure of the level of clustering or community structure in networks. Here we consider a recent generalisation of the definition of modularity to temporal graphs, whose edge-sets change over discrete…

Combinatorics · Mathematics 2025-07-24 Vilhelm Agdur , Jessica Enright , Laura Larios-Jones , Kitty Meeks , Fiona Skerman , Ella Yates

The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…

Dynamical Systems · Mathematics 2019-11-13 Bernat Espigule

In this paper, we study a relationship between tilting modules with finite projective dimension and dominant dimension with respect to injective modules as a generalization of results of Crawley-Boevey-Sauter, Nguyen-Reiten-Todorov-Zhu and…

Representation Theory · Mathematics 2021-03-18 Takahide Adachi , Mayu Tsukamoto

We investigate relations between loop and tree amplitudes in quantum field theory that involve putting on-shell some loop propagators. This generalizes the so-called Feynman tree theorem which is satisfied at 1-loop. Exploiting retarded…

High Energy Physics - Phenomenology · Physics 2011-05-23 Simon Caron-Huot

Assume that $R$ is a non-right perfect ring. Then there is a proper class of classes of (right $R$-) modules closed under transfinite extensions lying between the classes $\mathcal P _0$ of projective modules, and $\mathcal F _0$ of flat…

Representation Theory · Mathematics 2025-04-25 Jan Trlifaj

Scheduling with assignment restrictions is an important special case of scheduling unrelated machines which has attracted much attention in the recent past. While a lower bound on approximability of 3/2 is known for its most general…

Data Structures and Algorithms · Computer Science 2010-09-24 Ulrich M. Schwarz

Primarily this paper presents an expository report on alternatives to the traditional methods of classifying representations of finite dimensional algebras. Some new results illustrating such alternatives for algebras with only finitely…

Representation Theory · Mathematics 2014-07-10 Birge Huisgen-Zimmermann

A quasi-hereditary algebra is an algebra equipped with a certain partial order $\unlhd$ on its simple modules. Such a partial order -- called a quasi-hereditary structure -- gives rise to a characteristic tilting module $T_{\unlhd}$ by a…

Representation Theory · Mathematics 2025-07-23 Takahide Adachi , Aaron Chan , Yuta Kimura , Mayu Tsukamoto

Let $B$ be a finite dimensional algebra and $A=B[P_0]$ be the one-point extension algebra of $B$ with respect to the finitely generated projective $B$-module $P_0$. The categories of $B$-modules and $A$-modules are related by two adjoint…

Representation Theory · Mathematics 2022-08-29 J. Asadollahi , F. Padashnik , S. Sadeghi , H. Treffinger

We introduce a relative tilting theory in abelian categories and show that this work offers a unified framework of different previous notions of tilting, ranging from Auslander-Solberg relative tilting modules on Artin algebras to…

Representation Theory · Mathematics 2023-11-27 Alejandro Argudin Monroy , Octavio Mendoza Hernandez

In extended hearts of bounded $t$-structures on a triangulated category, we provide a Happel-Reiten-Smalo tilting theorem and a characterization for $s$-torsion pairs. Applying these to $m$-extended module categories, we characterize…

Representation Theory · Mathematics 2025-01-09 Yu Zhou

We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent…

Computational Complexity · Computer Science 2009-06-19 Matthew J. Patitz , Scott M. Summers

The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional…

Logic in Computer Science · Computer Science 2020-08-10 Fabian Zaiser , C. -H. Luke Ong

We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…

Dynamical Systems · Mathematics 2008-12-18 Antoine Julien