Related papers: Automatic Abelian Complexities of Parikh-Collinear…

We characterize simple complex abelian varieties and simple abelian surfaces in terms of primitivity of translation automorphisms. Applying this together with a result due to Diller and Favre, we then classify all primitive birational…

We consider IA-endomorphisms (i.e., Identical in Abelianization) of a free metabelian group of finite rank, and give a matrix characterization of their fixed points which is similar to (yet different from) the well-known characterization of…

We introduce the class of P-finite automata. These are a generalisation of weighted automata, in which the weights of transitions can depend polynomially on the length of the input word. P-finite automata can also be viewed as simple…

We make a start on one of George McNulty's Dozen Easy Problems: "Which finite automatic algebras are dualizable?" We give some necessary and some sufficient conditions for dualizability. For example, we prove that a finite automatic algebra…

We give a classification of maximal elements of the set of finite groups that can be realized as the full automorphism groups of simple polarized abelian fourfolds over finite fields. As an application, we compute the Jordan constants of…

Let $p$ be a prime number. A longstanding conjecture asserts that every finite non-abelian $p$-group has a non-inner automorphism of order $p$. In this paper, we prove that the conjecture is true when a finite non-abelian $p$-group $G$ has…

Morphic words are letter-to-letter images of fixed points $x$ of morphisms on finite alphabets. There are situations where these letter-to-letter maps do not occur naturally, but have to be replaced by a morphism. We call this a decoration…

It is well known that every finite subgroup of automorphism group of polynomial algebra of rank 2 over the field of zero characteristic is conjugated with a subgroup of linear automorphisms. We prove that it is not true for an arbitrary…

Given a ternary homogeneous polynomial, the fixed points of the map from $\mathbb{P}^2$ to itself defined by its gradient are called its eigenpoints. We focus on cubic polynomials, and analyze configurations of eigenpoints that admit one or…

Automatic structures are finitely presented structures where the universe and all relations can be recognized by finite automata. It is known that the isomorphism problem for automatic structures is complete for $\Sigma^1_1$; the first…

We investigate the complexity of satisfiability for finite-variable fragments of propositional dynamic logics. We consider three formalisms belonging to three representative complexity classes, broadly understood,---regular PDL, which is…

Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…

In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…

For a geometrically rational surface X over an arbitrary field of characteristic different from 2 and 3 that contains all roots of 1, we show that either X is birational to a product of a projective line and a conic, or the group of…

We give archimedean and non-archimedean constructions of Darmon points on modular abelian varieties attached to automorphic forms over arbitrary number fields and possibly non-trivial central character. An effort is made to present a…

Parikh matrices have been a powerful tool in arithmetizing words by numerical quantities. However, the dependence on the ordering of the alphabet is inherited by Parikh matrices. Strong M-equivalence is proposed as a canonical alternative…

Let (S, B) be the log pair associated with a projective completion of a smooth quasi-projective surface V . Under the assumption that the boundary B is irreducible, we obtain an algorithm to factorize any automorphism of V into a sequence…

We prove that if $F$ is a finitely generated abelian group of orientation preserving $C^1$ diffeomorphisms of $R^2$ which leaves invariant a compact set then there is a common fixed point for all elements of $F.$ We also show that if $F$ is…

We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) "Fibonacci-automatic". This class includes, for example, the famous Fibonacci word f = 01001010...,…

In this paper the complete geometrical setting of (lowest order) abelian T-duality is explored with the help of some new geometrical tools (the reduced formalism). In particular, all invariant polynomials (the integrands of the…