Related papers: A sharp version of Shimizu's theorem on entire aut…
Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of full uniform reflection of $\mathsf{PA}$. This result is commonly known as Feferman's completeness theorem. The purpose of this…
The first result is the semicontinuity of automorphism groups for the collection of complex two-dimensional bounded pseudoconvex domains with smooth boundary of finite D'Angelo type. The method of proof is new so that it simplifies the…
In this paper we provide a complete characterisation of transitive fractional jumps by showing that they can only arise from transitive projective automorphisms. Furthermore, we prove that such construction is feasible for arbitrarily large…
In this paper, we investigate the precise behavior of orbits inside attracting basins of rational functions on $\mathbb P^1$ and entire functions $f$ in $\mathbb{C}$. Let $R(z)$ be a rational function on $\mathbb P^1$, $\mathcal {A}(p)$ be…
We study an analogue of the conjugacy growth function in finitely generated groups: the automorphic growth function. This counts the number of automorphic orbits that intersect the ball of radius $n$ in the group. We show that this is not a…
Douglass B. Morris announced in 1970 that it is consistent with ZF that "For every $\alpha$, there exists a set $A_\alpha$ which is the countable union of countable sets, and $\mathcal P(A_\alpha)$ can be partitioned into $\aleph_\alpha$…
We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…
Using a generalization of the Kechris-Pestov-Todor\v{c}evi\'{c} correspondence due to Nguyen Van Th\'{e} we obtain fixed point theorems for null and tame actions of groups of the form $\mathrm{Aut}(\mathcal F)$, where $\mathcal{F}$ is a…
A sofic shift is a shift space consisting of bi-infinite labels of paths from a labelled graph. Being a dynamical system, the distribution of its closed orbits may indicate the complexity of the space. For this purpose, prime orbit and…
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…
We prove that no quantifier-free formula in the language of group theory can define the $\aleph_1$-half graph in a Polish group, thus generalising some results from [6]. We then pose some questions on the space of groups of automorphisms of…
We consider a class $\mathscr{X}$ of continuous functions on $[0,1]$ that is of interest from two different perspectives. First, it is closely related to sets of functions that have been studied as generalizations of the Takagi function.…
F-theory, as Theory of Everything is compactified on Calabi-Yau threefolds or fourfolds. Using toric approximation of Batyrev and mirror symmetry of Calabi-Yau manifolds it is possible to present Calabi-Yau in the form of dual integer…
We prove a nonsmooth implicit function theorem applicable to the zero set of the difference of convex functions. This theorem is explicit and global: it gives a formula representing this zero set as a difference of convex functions which…
This is the first in a sequence of papers that will develop the theory of automorphisms of nonsolvable finite groups. The sequence will culminate in a new proof of McBride's Nonsolvable Signalizer Functor Theorem, which is one of the…
We make a connection between the structure of the bidisc and a distinguished subgroup of its automorphism group. The automorphism group of the bidisc, as we know, is of dimension six and acts transitively. We observe that it contains a…
For a finite field $\mathbb{F}$, it is a basic result of Galois theory that the fixed field $E$ of $\text{Aut}(\mathbb{F}(x)/\mathbb{F})$ is a proper extension of $\mathbb{F}$. In this expository paper we construct, for all finite fields,…
We consider the task of computing functions $f: \mathbb{N}^k\to \mathbb{N}$, where $ \mathbb{N}$ is the set of natural numbers, by finite teams of agents modelled as deterministic finite automata. The computation is carried out in a…
An automorphism $\alpha$ of a group $G$ is called a commuting automorphism if each element $x$ in $G$ commutes with its image $\alpha(x)$ under $\alpha$. Let $A(G)$ denote the set of all commuting automorphisms of $G$. Rai [Proc. Japan…
Extending and unifying a number of well-known conjectures and open questions, we conjecture that locally elliptic (that is, every element has a bounded orbit) actions by automorphisms of finitely generated groups on finite dimensional…