We study bounded width algebras which are minimal in the sense that every proper reduct does not have bounded width. We show that minimal bounded width algebras can be arranged into a pseudovariety with one basic ternary operation. We classify minimal bounded width algebras which have size at most three, and prove a structure theorem for minimal bounded width algebras which have no majority sub...

In this paper, for each positive integer m, we associate with a finite monoid S0 and m finite commutative monoids S1,..., Sm, a product ◊m(Sm,..., S1, S0) . We give a representation of the free objects in the pseudovariety ◊m(Wm,..., W1, W0) generated by these (m + 1)-ary products where Si ∈ Wi for all 0 ≤ i ≤ m. We then give, in particular, a criterion to determine when an identity holds in ◊m...

The tame flows are “nice” flows on “nice” spaces. The nice (tame) sets are the pfaffian sets introduced by Khovanski, and a flow Φ : R×X → X on pfaffian set X is tame if the graph of Φ is a pfaffian subset of R × X × X. Any compact tame set admits plenty tame flows. We prove that the flow determined by the gradient of a generic real analytic function with respect to a generic real analytic metr...

Abstract Birge Huisgen-Zimmermann calls a finite dimensional algebra homologically tame provided the little and big finitistic dimension are equal finite. The question formulated in title has been discussed by her paper “Representation-tame algebras need not be tame”, looking for any r ≥ 1 at sequence of Λ m with + . As we will show, also is It follows that contrary to assertion, all tame.

Tame is a new event-based system for managing concurrency in network applications. Code written with Tame abstractions does not suffer from the “stackripping” problem associated with other event libraries. Like threaded code, tamed code uses standard control flow, automatically-managed local variables, and modular interfaces between callers and callees. Tame’s implementation consists of C++ lib...

In this paper we characterize tame dynamical systems and functions in terms of eventual non-sensitivity and eventual fragmentability. As a notable application we obtain a neat characterization of tame subshifts X ⊂ {0, 1}Z: for every infinite subset L ⊆ Z there exists an infinite subset K ⊆ L such that πK(X) is a countable subset of {0, 1}K . The notion of eventual fragmentability is one of the...

The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a finite field k if and only if all its finite minors are representable over k. We expect that the method we use to prove this will make it possible to lift m...

In this paper it is established that all two-dimensional polynomial automorphisms over a Dedekind Q-algebra are stably tame; in fact, they become tame with the addition of three more dimensions. A key element in the proof is this additional new theorem: Over an Artinian Q-algebra all two-dimensional polynomial automorphisms having Jacobian determinant one are tame.

Marden conjectured that a hyperbolic 3-manifold M with finitely generated fundamental group is tame, i.e. it is homeomorphic to the interior of a compact manifold with boundary [42]. Since then, many consequences of this conjecture have been developed by Kleinian group theorists and 3-manifold topologists. We prove this conjecture in theorem 10.2, actually in slightly more generality for PNC ma...

We relate the problem of computing the closure of a finitely generated subgroup of the free group in the pro-V topology, where V is a pseudovariety of finite groups, with an extension problem for inverse automata which can be stated as follows: given partial one-to-one maps on a finite set, can they be extended into permutations generating a group in V? The two problems are equivalent when V is...