Related papers: Hammocks for non-domestic string algebras
For the representation-theoretic study of domestic string algebras, Schr\"{o}er introduced a version of hammocks that are bounded discrete linear orders. He introduced a finite combinatorial gadget called the bridge quiver, which we…
Given a special biserial algebra $\Lambda$ over an algebraically closed field, let $\mathrm{rad}_\Lambda$ denote the radical of its module category. The authors showed with Sinha that the stable rank of a special biserial algebra $\Lambda$,…
We show that string algebras are `homologically tame' in the following sense: First, the syzygies of arbitrary representations of a finite dimensional string algebra $\Lambda$ are direct sums of cyclic representations, and the left…
We consider the closure space on the set of strings of a gentle algebra of finite representation type. Palu, Pilaud, and Plamondon proved that the collection of all biclosed sets of strings forms a lattice, and moreover, that this lattice…
We introduce the concept of a prime band in a string algebra $\Lambda$ and use it to associate to $\Lambda$ its finite bridge quiver. Then we introduce a new technique of `recursive systems' for showing that a graph map between finite…
We prove that among the finite dimensional algebras of finite representation type those that are string algebras are precisely the ones that have the property that the middle term of an arbitrary extension of indecomposable modules has at…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…
Many properties of a module can be expressed in terms of the dimension of the vector space obtained by applying a finitely presented functor to that module. For example, the dimension of the kernel, image or cokernel of the multiplication…
Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…
We introduce a class of left ideals (and subalgebras) of nest algebras determined by totally ordered families of partial isometries on a complex Hilbert space $H$. Let $\mathcal{E}$ be a family of partial isometries that is totally ordered…
In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…
String diagrams are a graphical language used to represent processes that can be composed sequentially or in parallel, which correspond graphically to horizontal or vertical juxtaposition. In this paper we demonstrate how to compute the…
In a Brown category of cofibrant objects, there is a model for the mapping spaces of the hammock localization in terms of zig-zags of length 2. In this paper we show how to assemble these spaces into a Segal category that models the…
In this paper we construct a Lie algebra representation of the algebraic string bracket on negative cyclic cohomology of an associative algebra with appropriate duality. This is a generalized algebraic version of the main theorem of [AZ]…
For any increasing function $f: {\Bbb N} \rightarrow {\Bbb N}_{\ge 2}$ which takes only finitely many distinct values, a connected finite dimensional algebra $\Lambda$ is constructed, with the property that $\text{fin.dim}_n\, \Lambda =…
We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes \cite{SM},…
We present a general algorithm which permits to construct solutions in string cosmology for heterotic and type-IIB superstrings in four dimensions. Using a chain of transformations applied in sequence: conformal, T-duality and SL(2,R)…
We present several results about position heaps, a relatively new alternative to suffix trees and suffix arrays. First, we show that, if we limit the maximum length of patterns to be sought, then we can also limit the height of the heap and…
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes,…
Suppose $\Lambda$ is a special biserial algebra over an algebraically closed field. Schr\"oer showed that if $\Lambda$ is domestic then the radical of the category of finitely generated (left) $\Lambda$-modules is nilpotent, and the least…