Abstract Fix a positive integer g and squarefree m . We prove the existence of genus curve $$C/{\mathbb {Q}}$$ C / Q such that mod representation its Jacobian is tame. The method to analyse period matrices hyperelliptic Mumford curves, which could be in...

For an arbitrary algebra A a new labelling, called the signed labelling, of the Hasse diagram of Con A is described. Under the signed labelling, each edge of the Hasse diagram of Con A receives a label from the set {+,−}. The signed labelling depends completely on a subset of the unary polynomials of A and its inspiration comes from semigroup theory. For finite algebras, the signed labelling co...

A new pair of asymptotic invariants for finitely presented groups, called intrinsic and extrinsic tame filling functions, are introduced. These filling functions are quasi-isometry invariants that strengthen the notions of intrinsic and extrinsic diameter functions for finitely presented groups. We show that the existence of a (finite-valued) tame filling function implies that the group is tame...

We study the property of tame combability for groups. We show that quasi-isometries preserve this property. We prove that an amalgamation, A ∗C B, where C is finitely generated, is tame combable iff both A and B are. An analogous result is obtained for HNN extensions. And we show that all one-relator groups are tame combable.

Interest in understanding the biological behavior of aliphatic ethers has increased owing to their use as gasoline additives. The purpose of this study was to investigate the blood pharmacokinetics of the oxygenate tertiary amyl methyl ether (TAME), its major metabolite tertiary amyl alcohol (TAA) and acetone in rats and mice following inhalation exposure to TAME. Species differences in the are...

Mechanical theorem provers have been shown to expose proof errors, some of them serious, that humans miss. Mechanical provers will be applied more widely if they are easier to use. The tool TAME (Timed Automata Modeling Environment) provides an interface to the prover PVS to simplify specifying and proving properties of automata models. Originally designed for reasoning about Lynch-Vaandrager (...

A henselian valued field K is called separably tame if its separable-algebraic closure K is a tame extension, that is, the ramification field of the normal extension K|K is separable-algebraically closed. Every separable-algebraically maximal Kaplansky field is a separably tame field, but not conversely. In this paper, we prove Ax– Kochen–Ershov Principles for separably tame fields. This leads ...