Related papers: Fixed Sets of Automorphisms of Countable, Arithmet…
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…
Abstract separation systems are a new unifying framework in which separations of graph, matroids and other combinatorial structures can be expressed and studied. We characterize the abstract separation systems that have representations as…
A bounded automorphism of a field or a group with trivial approximate centre is definable. In an expansion of a field by a Pfaffian family F of additive endomorphisms such that algebraic closure in the expansion coincides with relative…
We construct k-parameter families of rational surface automorphisms for any k. These are automorphisms of surfaces X, which are constructed from iterated blowups over the projective plane. In certain cases: we are able to determine the…
The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…
We give a sharp bound on the number of automorphisms of a stable curve of a given genus and describe all curves attaining this bound.
Two geometric interpretations of the bar automorphism in the positive part of a quantized enveloping algebra are given. The first is in terms of numbers of rational points over finite fields of quiver analogues of orbital varieties; the…
An automorphism of a graph describes its structural symmetry and the concept of fixing number of a graph is used for breaking its symmetries (except the trivial one). In this paper, we evaluate automorphisms of the co-normal product graph…
We characterize finite $p$-groups $G$ of order up to $p^7$ for which the group of central automorphisms fixing the center element-wise is of minimum possibe order.
We classify compact manifolds of dimension three equipped with a path structure and a fixed contact form (which we refer to as a strict path structure) under the hypothesis that their automorphism group is non-compact. We use a Cartan…
Solecki proved that the group of automorphisms of a countable structure cannot be an uncountable free abelian group. See more in Just, Shelah and Thomas math.LO/0003120 where as a by product we can say something on on uncountable…
We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…
We study the existence of uncountable first-order structures that are homogeneous with respect to their finitely generated substructures. In many classical cases this is either well-known or follows from general facts, for example, if the…
We adapt the notion of a (relatively) definable subset of Aut(M) when M is a saturated model to the case Aut(M/A) when M is atomic and strongly omega-homogeneous over A. We discuss the existence and uniqueness of invariant measures on the…
We study the automorphism groups attached to a free algebra with multiple, possibly infinitely many, composition laws. As an application, we prove that the automorphism group of finitely generated vertex algebras over noetherian rings are…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$. As a consequence we show that, for any countable graph $\Gamma$, there are uncountably many maximal subgroups of…
In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…
We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…
The field of constraint satisfaction problems (CSPs) studies homomorphism problems between relational structures where the target structure is fixed. Classifying the complexity of these problems has been a central quest of the field,…