English
Related papers

Related papers: Tame and wild refinement monoids

200 papers

We use a theorem of Auslander and Kostant on the representation theory of solvable Lie-groups for the study of some groups necessary for the description of certain quasi-periodic systems of solid-state physics. We show that the magnetic…

Mesoscale and Nanoscale Physics · Physics 2009-10-30 Peter Varga

In this paper, we consider the problem of determining when two tensor networks are equivalent under a heterogeneous change of basis. In particular, to a string diagram in a certain monoidal category (which we call tensor diagrams), we…

Representation Theory · Mathematics 2017-05-16 Jacob Turner

We study two classes of morphisms in infinite type: tamely presented morphisms and morphisms with coherent pullback. These are generalizations of finitely presented morphisms and morphisms of finite Tor-dimension, respectively. The class of…

Algebraic Geometry · Mathematics 2024-01-11 Sabin Cautis , Harold Williams

We define here two new classes of saturated fusion systems, reduced fusion systems and tame fusion systems. These are motivated by our attempts to better understand and search for exotic fusion systems: fusion systems which are not the…

Algebraic Topology · Mathematics 2014-02-26 Kasper K. S. Andersen , Bob Oliver , Joana Ventura

I extend the definitions of schemes relative to monoids with zero - and therefore, toric geometry - to the world of formal schemes. This expands the usual framework to include, for instance, models for Mumford's degenerating Abelian…

Algebraic Geometry · Mathematics 2015-05-29 Andrew W. Macpherson

We introduce and study several affine (=annular in this paper) versions of the classical diagram algebras such as Temperley-Lieb, partition, Brauer, Motzkin, rook Brauer, rook, planar partition, and planar rook algebras. We give generators…

Representation Theory · Mathematics 2025-12-22 David He , Daniel Tubbenhauer

Let $\Lambda$ be a finite-dimensional basic algebra over an algebraically closed field $k$. The well-known Drozd's theorem asserts, that $\Lambda$ is either tame or wild. The Crawley-Boevey's Theorem states that for a given tame algebra…

Representation Theory · Mathematics 2014-03-25 Yingbo Zhang , Yunge Xu

We investigate tameness of Toeplitz shifts. By introducing the notion of extended Bratteli-Vershik diagrams, we show that such shifts with finite Toeplitz rank are tame if and only if there are at most countably many orbits of singular…

Dynamical Systems · Mathematics 2024-05-08 Gabriel Fuhrmann , Johannes Kellendonk , Reem Yassawi

We prove that the number of parameters defining a complex of projective modules over a finite dimensional algebra is upper semi-continuous in families of algebras. Supposing that every algebra is either derived tame or derived wild, we get…

Representation Theory · Mathematics 2007-05-23 Yuriy A. Drozd

We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating…

Commutative Algebra · Mathematics 2021-12-03 Harold Polo

We give several versions of local and global inverse mapping theorem for tame non necessarily smooth, mappings. Here tame mapping means a mapping which is subanalytic or, more generally, definable in some o-minimal structure. Our sufficient…

Geometric Topology · Mathematics 2007-12-18 Toshizumi Fukui , Krzysztof Kurdyka , Laurentiu Paunescu

The concept of_refinement_ in type theory is a way of reconciling the "intrinsic" and the "extrinsic" meanings of types. We begin with a rigorous analysis of this concept, settling on the simple conclusion that the type-theoretic notion of…

Logic in Computer Science · Computer Science 2013-10-02 Paul-André Melliès , Noam Zeilberger

A henselian valued field $K$ is called separably tame if its separable-algebraic closure $K^{\operatorname{sep}}$ is a tame extension, that is, the ramification field of the normal extension $K^{\operatorname{sep}}|K$ is…

Logic · Mathematics 2015-08-18 Franz-Viktor Kuhlmann , Koushik Pal

We study representation finite $K$-rational quivers over fields of characteristic $0$ and their indecomposable representations, exploiting that all Brauer obstructions for descent of representations are trivial in this case. Contrasting the…

Representation Theory · Mathematics 2025-10-02 Fabian Januszewski

Levels of cancellativity in commutative monoids $M$, determined by stable rank values in $\mathbb{Z}_{> 0} \cup \{\infty\}$ for elements of $M$, are investigated. The behavior of the stable ranks of multiples $ka$, for $k \in \mathbb{Z}_{>…

Group Theory · Mathematics 2026-03-11 Pere Ara , Ken Goodearl , Pace P. Nielsen , Kevin C. O'Meara , Enrique Pardo , Francesc Perera

We introduce an extension of the (tame) polynomial automorphism group over finite fields: the profinite (tame) polynomial automorphism group, which is obtained by putting a natural topology on the automorphism group. We show that most known…

Algebraic Geometry · Mathematics 2015-07-13 Stefan Maubach , Abdul Rauf

We provide explicit families of tame automorphisms of the complex affine three-space which degenerate to wild automorphisms. This shows that the tame subgroup of the group of polynomial automorphisms of $\C^3$ is not closed, when the latter…

Algebraic Geometry · Mathematics 2014-07-23 Eric Edo , Pierre-Marie Poloni

The soft Barycentric refinement preserves manifolds with or without boundary. In every dimension larger than one, there is a universal spectral central limiting measure that has affinities with the Barycentric limiting measure one dimension…

Combinatorics · Mathematics 2025-03-04 Oliver Knill

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

Formal Languages and Automata Theory · Computer Science 2025-02-12 Pranshu Gaba , Arnab Sur

We introduce several classes of monoids satisfying up to five axioms and establish basic theories on their arithmetics. The one satisfying all the axioms is named natural monoid. Two typical examples are 1) the monoid $\mathbb{N}$ of…

Number Theory · Mathematics 2019-05-15 Boqing Xue