Related papers: Automatic sequences are also non-uniformly morphic

In this short note we formulate a stabilizer formalism in the language of noncommutative graphs. The classes of noncommutative graphs we consider are obtained via unitary representations of compact groups, and suitably chosen operators on…

We determine all possible orders of automorphisms of complex K3 surfaces. A positive integer N is the order of an automorphism of a complex K3 surface if and only if $\phi(N) \leq 20$ where $\phi$ is the Euler function.

In this paper we study the sequence of strings of $k$ last nonzero digits of $n!$ in a given base $b$. We determine for which $b$ this sequence is automatic and show how to generate it using a uniform morphism. We also compute how often…

We give an explicit formula, as a formal differential operator, for quantum microformal morphisms of (super)manifolds that we introduced earlier. Such quantum microformal morphisms are essentially oscillatory integral operators or Fourier…

A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…

We prove that, if $\Gamma$ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of $\Gamma$ of order at least $6$, or the number of vertices of $\Gamma$ is bounded above by an absolute…

Conditions are given under which an infinitesimal automorphism of a torsion-free connection preserving a symplectic form is necessarily a symplectic vector field. An example is given of a compact symplectic manifold admitting a flat…

We show that the closure of the value set of a real linear recurrence sequence is the union of a countable set and a finite collection of intervals. Conversely, any finite collection of closed intervals is the closure of the value set of…

Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new estimation for the upper bound of B_k sequences.

We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…

We associate each endomorphism of a finite cyclic group with a digraph and study many properties of this digraph, including its adjacent matrix and automorphism group.

Let $G\subset GL_n(k)$ be a finite subgroup and $k[x_1,\dots, x_n]^G\subset k[x_1,\dots, x_n]$ its ring of invariants. We show that, in many cases, the automorphism group of $k[x_1,\dots, x_n]^G$ is $k^\times$. Version 2: Incorporates parts…

Let $G$ be a finite $p$-group.

The aim of this paper is to give an explicit description of the fixed loci of symplectic automorphisms for certain hyperkahler manifolds, namely for Hilbert schemes on K3 surfaces and for generalized Kummer varieties. Here we extend our…

Let $R$ be a commutative $k-$algebra over a field $k$. Assume $R$ is a noetherian, infinite, integral domain. The group of $k-$automorphisms of $R$,i.e.$Aut_k(R)$ acts in a natural way on $(R-k)$.In the first part of this article, we study…

We study those automatic sequences which are produced by an automaton whose underlying graph is the Cayley graph of a finite group. For $2$-automatic sequences, we find a characterization in terms of what we call homogeneity, and among…

A configuration of points and lines is cyclic if it has an automorphism which permutes its points in a full cycle. A closed formula is derived for the number of non-isomorphic connected cyclic configurations of type (v_3), i.e., which have…

We give an unique string representation, up to isomorphism, for initially connected deterministic finite automata (ICDFAs) with n states over an alphabet of k symbols. We show how to generate all these strings for each n and k, and how its…

We show that a generic Hamiltonian diffeomorphism on a closed symplectic manifold which is symplectically aspherical has at least the stable Morse number of fixed points - this is in line with a conjecture by Arnold.