Related papers: Tame and wild refinement monoids
Say that a cone is a commutative monoid in which x+y=0 implies that x=y=0. We show that cones (resp. simple cones) of many kinds order-embed or even embed unitarily into refinement cones (resp. simple refinement cones) of the same kind,…
We characterize, in terms of elementary properties, the abelian monoids which are direct limits of finite direct sums of monoids of the form $(Z/nZ)\sqcup\{0\}$ (where 0 is a new zero element), for positive integers $n$. The key properties…
The Realization Problem for (von Neumann) regular rings asks what are the conical refinement monoids which can be obtained as the monoids of isomorphism classes of finitely generated projective modules over a regular ring. The analogous…
A finite \'etale map between irreducible, normal varieties is called tame, if it is tamely ramified with respect to all partial compactifications whose boundary is the support of a strict normal crossings divisor. We prove that if the…
Consider tuples of separable algebras over a common local or global number field, related to each other by specified resolvent constructions. Under the assumption that all ramification is tame, simple group-theoretic calculations give best…
We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and we explicitly determine their associated…
The celebrated Drozd's theorem asserts that a finite-dimensional basic algebra $\Lambda$ over an algebraically closed field $k$ is either tame or wild, whereas the Crawley-Boevey's theorem states that given a tame algebra $\Lambda$ and a…
We extend both Dobbertin's characterization of primely generated regular refinement monoids and Pierce's characterization of primitive monoids to general primely generated refinement monoids.
We study minimal disjoint degenerations for representations of tame quivers. In particular, we prove that their codimensions are bounded by 2. Therefore a quiver is Dynkin resp. Euclidean resp. wild iff the codimensions are 1 resp. bounded…
We prove that every finite dimensional algebra over an algebraically closed field is either derived tame or derived wild. We also prove that any deformation of a derived tame algebra is derived tame.
We introduce the notion of interlaced weak ditalgebras and apply reduction procedures to their module categories to prove a tame-wild dichotomy for the category ${\cal F}(\Delta)$ of $\Delta$-filtered modules for an arbitrary finite…
It is proved that the tame automorphism group of a differential polynomial algebra $k\{x,y\}$ over a field $k$ of characteristic $0$ in two variables $x,y$ with $m$ commuting derivations $\delta_1, \ldots, \delta_m$ is a free product with…
In representation theory, the problem of classifying pairs of matrices up to simultaneous similarity is used as a measure of complexity; classification problems containing it are called wild problems, and the other are referred to as tame.
Let $\Lambda$ be a finite-dimensional algebra over an algebraically closed field, then $\Lambda$ is either tame or wild. Is there any homological description in terms of AR-translations on tameness? Or equivalently, is there any…
We study the relation between two important classes of valued fields: tame fields and defectless fields. We show that in the case of valued fields of equal characteristic or rank one valued fields of mixed characteristic, tame fields are…
We extend the notion of a tame covering of a pair (X,D) where X is a regular scheme and D is a normal crossing divisor (cf. SGA1), to pairs (X,Y) where X is an arbitrary scheme and Y is a closed subset in X. We show that the abelianized…
Graph monoids arise naturally in the study of non-stable K-theory of graph C*-algebras and Leavitt path algebras. They play also an important role in the current approaches to the realization problem for von Neumann regular rings. In this…
We prove that every finite dimensional algebra over an algebraically closed field is either derived tame or derived wild. The proof is based on the technique of matrix problems (boxes and reduction algorithm). It implies, in particular,…
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…
We prove that the free product of two finitely presented locally tame groups is locally tame and describe many examples of tame subgroups of finitely presented groups. We also include some open problems related to tame subgroups.