Related papers: Hammocks for non-domestic string algebras

In this master thesis we analyze the complexity of sorting a set of strings. It was shown that the complexity of sorting strings can be naturally expressed in terms of the prefix trie induced by the set of strings. The model of computation…

The symmetric homology of a unital algebra $A$ over a commutative ground ring $k$ is defined using derived functors and the symmetric bar construction of Fiedorowicz. For a group ring $A = k[\Gamma]$, the symmetric homology is related to…

We introduce order conserving embeddings as a more general form of order preserving embeddings between finite dimensional nest algebras. The structure of these embeddings is determined, in terms of order indecomposable decompositions, and…

Rowmotion is a simple cyclic action on the distributive lattice of order ideals of a poset: it sends the order ideal x to the order ideal generated by the minimal elements not in x. It can also be computed in "slow motion" as a sequence of…

Simplicial homology manifolds are proposed as an interesting class of geometric objects, more general than topological manifolds but still quite tractable, in which questions about the microstructure of space-time can be naturally…

Let $H$ be a hereditary artin algebra of finite representation type. We first determine all hammocks in the Auslander-Reiten quiver $\GaH$ of $\mmod H$, the category of finitely generated left $H$-modules. This enables us to obtain an…

We characterize a closure of the set of dynamical-lexicographic orderings on $\mathrm{Homeo}_{+}{(\mathbb{R})}$ and prove the existence of orders outside of it.

A first-order structure $\mathfrak{A}$ is called monadically stable iff every expansion of $\mathfrak{A}$ by unary predicates is stable. In this article we give a classification of the class $\mathcal{M}$ of $\omega$-categorical monadically…

The main theorem provides a characterisation of the finite rank operators lying in a norm closed Lie ideal of a continuous nest algebra. These operators are charaterised as those finite rank operators in the nest algebra satisfying a…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

We propose a simple linear-time on-line algorithm for constructing a position heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap differs slightly from the one proposed in [Ehrenfeucht et al, 2011] in that it…

In the computation of some representation-theoretic numerical invariants of domestic string algebras, a finite combinatorial gadget introduced by Schr\"{o}er--the \emph{bridge quiver} whose vertices are (representatives of cyclic…

A rank one local system $\LL$ on a smooth complex algebraic variety $M$ is admissible roughly speaking if the dimension of the cohomology groups $H^m(M,\LL)$ can be computed directly from the cohomology algebra $H^*(M,\C)$. We say that a…

We obtain the exact Dirac algebra obeyed by the conserved non-local charges in bosonic non-linear sigma models. Part of the computation is specialized for a symmetry group $O(N)$. As it turns out the algebra corresponds to a cubic…

We show that the existence of string order in a given quantum state is intimately related to the presence of a local symmetry by proving that both concepts are equivalent within the framework of finitely correlated states. Once this…

We prove explicit and elementary formulas for the group homology and cohomology of a finite group with coefficients in any module. We describe in elementary terms the cohomology algebra $H^*(G,k)$ as a graded algebra for a finite group $G$…

Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in a homology class, we consider the problem of computing a…

The finite condensation $\sim_F$ is an equivalence relation defined on a linear order $L$ by $x \sim_F y$ if and only if the set of points lying between $x$ and $y$ is finite. We define an operation $\cdot_F$ on linear orders $L$ and $M$ by…

We present a streamlined and (hopefully) accessible proof of the model-completeness of the weak monadic second order version of a dense linear order with left-endpoint but no right-endpoint in a particular finite signature. We also show how…

Alignments, i.e., position-wise comparisons of two or more strings or ordered lists are of utmost practical importance in computational biology and a host of other fields, including historical linguistics and emerging areas of research in…