Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPreordered groups and valued fields
57
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study algebraic, combinatorial and topological properties of the set of preorders on a group, and the set of valuations on a field. We show strong analogies between these two kinds of sets and develop a dictionary for these ones. Among the results we make a detailed study of the set of preorders on $mathbb Z^n$. We also prove that the set of valuations on a countable field of transcendence degree at least 2 is an ultrametric Cantor set.
rate research
Read More
We introduce a class of theories called metastable, including the theory of algebraically closed valued fields (ACVF) as a motivating example. The key local notion is that of definable types dominated by their stable part. A theory is metastable (over a sort $Gamma$) if every type over a sufficiently rich base structure can be viewed as part of a $Gamma$-parametrized family of stably dominated types. We initiate a study of definable groups in metastable theories of finite rank. Groups with a stably dominated generic type are shown to have a canonical stable quotient. Abelian groups are shown to be decomposable into a part coming from $Gamma$, and a definable direct limit system of groups with stably dominated generic. In the case of ACVF, among definable subgroups of affine algebraic groups, we characterize the groups with stably dominated generics in terms of group schemes over the valuation ring. Finally, we classify all fields definable in ACVF.
Motivated by trying to find a new proof of Artins theorem on positive polynomials, we state and prove a Positivstellensatz for preordered semirings in the form of a local-global principle. It relates the given algebraic order on a suitably well-behaved semiring to the geometrical order defined in terms of a probing by homomorphisms to test algebras. We introduce and study the latter as structures intended to capture the behaviour of a semiring element in the infinitesimal neighbourhoods of a real point of the real spectrum. As first applications of our local-global principle, we prove two abstract non-Archimedean Positivstellensatze. The first one is a non-Archimedean generalization of the classical Positivstellensatz of Krivine-Kadison-Dubois, while the second one is deeper. A companion paper will use our second Positivstellensatz to derive an asymptotic classification of random walks on locally compact abelian groups. As an important intermediate result, we develop an abstract Positivstellensatz for preordered semifields which states that a semifield preorder is always the intersection of its total extensions. We also introduce quasiordered rings and develop some of their theory. While these are related to Marshalls $T$-modules, we argue that quasiordered rings offer an improved definition which puts them among the basic objects of study for real algebra.
We prove that any Cayley graph $G$ with degree $d$ polynomial growth does not satisfy ${f(n)}$-containment for any $f=o(n^{d-2})$. This settles the asymptotic behaviour of the firefighter problem on such graphs as it was known that $Cn^{d-2}$ firefighters are enough, answering and strengthening a conjecture of Develin and Hartke. We also prove that intermediate growth Cayley graphs do not satisfy polynomial containment, and give explicit lower bounds depending on the growth rate of the group. These bounds can be further improved when more geometric information is available, such as for Grigorchuks group.
Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these representations: here we assume that they are represented by tuples of reduced words (generators of a subgroup) or of cyclically reduced words (relators). Classical models consider fixed size tuples of words (e.g. the few-generator model) or exponential size tuples (e.g. Gromovs density model), and they usually consider that equal length words are equally likely. We generalize both the few-generator and the density models with probabilistic schemes that also allow variability in the size of tuples and non-uniform distributions on words of a given length.Our first results rely on a relatively mild prefix-heaviness hypothesis on the distributions, which states essentially that the probability of a word decreases exponentially fast as its length grows. Under this hypothesis, we generalize several classical results: exponentially generically a randomly chosen tuple is a basis of the subgroup it generates, this subgroup is malnormal and the tuple satisfies a small cancellation property, even for exponential size tuples. In the special case of the uniform distribution on words of a given length, we give a phase transition theorem for the central tree property, a combinatorial property closely linked to the fact that a tuple freely generates a subgroup. We then further refine our results when the distribution is specified by a Markovian scheme, and in particular we give a phase transition theorem which generalizes the classical results on the densities up to which a tuple of cyclically reduced words chosen uniformly at random exponentially generically satisfies a small cancellation property, and beyond which it presents a trivial group.
In this paper, we study the class of free hyperplane arrangements. Specifically, we investigate the relations between freeness over a field of finite characteristic and freeness over $mathbb{Q}$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
