Related papers: Structures with not too fast unlabelled growth

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of proof is to show…

Let $\mathcal{L}$ be a first-order two-sorted language. Let $S$ be some fixed structure. A standard structure is an $\mathcal{L}$-structure of the form $(M,S)$, where $M$ is arbitrary. When $S$ is a compact topological space (and…

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

We prove that, for any infinite-type surface $S$, the integral homology of the closure of the compactly-supported mapping class group $\overline{\mathrm{PMap}_c(S)}$ and of the Torelli group $\mathcal{T}(S)$ is uncountable in every positive…

In physics, I noticed subjects not explained by formulas were often not studied, like how uncontrolled growth systems changed form. Weather, businesses, societies, environments, communities, cultures, groups, relationships, lives, and…

We deal with first-order definability in the substructure ordering $(\mathcal{D}; \sqsubseteq)$ of finite directed graphs. In two papers, the author has already investigated the first-order language of the embeddability ordering $(…

Let $G$ be a usc decomposition of $S^n$, $H_G$ denote the set of nondegenerate elements and $\pi$ be the natural projection of $S^n$ onto $S^n/G$. Suppose that each point in the decomposition space has arbitrarily small neighborhoods with…

In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite…

We show that every set S in [N]^d occupying less than p^t residue classes for some real number t < d and every prime p, must essentially lie in the solution set of a polynomial equation of degree at most (log N)^C, for some constant C…

This paper derives two stabilizability theorems for a basic class of discrete-time nonlinear systems with multiple unknown parameters. First, we claim that a discrete-time multi-parameter system is stabilizable if its nonlinear growth rate…

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

Let $p$ be prime. We prove that, for $n$ odd, the $p$-torsion part of $\pi_q(S^{n})$ has cardinality at most $p^{2^{\frac{1}{p-1}(q-n+3-2p)}}$, and hence has rank at most $2^{\frac{1}{p-1}(q-n+3-2p)}$. For $p=2$ these results also hold for…

We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…

We construct finitely generated simple algebras with prescribed growth types, which can be arbitrarily taken from a large variety of (super-polynomial) growth types. This (partially) answers a question raised by the author in a recent…

We describe a family of rational affine surfaces S with huge groups of automorphisms in the following sense: the normal subgroup of Aut(S) generated by all its algebraic subgroups is not generated by any countable family of such subgroups,…