Related papers: Automorphisms of polynomial algebras and Dirichlet…

This paper summarizes some known results about Appell polynomials and investigates their various analogs. The primary of these are the free Appell polynomials. In the multivariate case, they can be considered as natural analogs of the…

An automorphism of a graph $G$ with $n$ vertices is a bijective map $\phi$ from $V(G)$ to itself such that $\phi(v_i)\phi(v_j)\in E(G)$ $\Leftrightarrow$ $v_i v_j\in E(G)$ for any two vertices $v_i$ and $v_j$ of $G$. Denote by…

We prove potential automorphy results for a single Galois representation $G_F \rightarrow GL_n(\overline{\mathbb{Q}}_l)$ where $F$ is a CM number field. The strategy is to use the $p,q$ switch trick and modify the Dwork motives employed in…

A survey article that presents some recent algebraic and model-theoretic results on the automorphism groups of relatively free groups of infinite rank. The topics include topological aspects, generating sets, descripition of automorpisms…

Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…

Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…

We derive a generating series for the number of free subgroups of finite index in $\Delta^+ = \mathbb{Z}_p*\mathbb{Z}_q$ by using a connection between free subgroups of $\Delta^+$ and certain hypermaps (also known as ribbon graphs or "fat"…

We derive generalized generating functions for basic hypergeometric orthogonal polynomials by applying connection relations with one free parameter to them. In particular, we generalize generating functions for the Askey-Wilson, continuous…

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…

We prove that if $y=\sum_{n=0}^\infty{\bf a}(n)x^n\in\mathbb{F}_q[[x]]$ is an algebraic power series of degree $d$, height $h$, and genus $g$, then the sequence ${\bf a}$ is generated by an automaton with at most $q^{h+d+g-1}$ states, up to…

Let $q$ be a prime power, let $\mathbb F_q$ be the finite field with $q$ elements and let $\theta$ be a generator of the cyclic group $\mathbb F_q^*$. For each $a\in \mathbb F_q^*$, let $\log_{\theta} a$ be the unique integer $i\in \{1,…

We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on…

We prove that any $q$-automatic completely multiplicative function $f:\mathbb{N}\to\mathbb{C}$ essentially coincides with a Dirichlet character. This answers a question of J. P. Allouche and L. Goldmakher and confirms a conjecture of J.…

Let $A_1$ be the (first) Weyl algebra, and let $G$ be its automorphism group. We study the natural action of $G$ on the space of isomorphism classes of right ideals of $A_1$ (equivalently, of finitely generated rank 1 torsion-free right…

Inspired by the study of community structure in connection networks, we introduce the graph polynomial $Q(G;x,y)$, the bivariate generating function which counts the number of connected components in induced subgraphs. We give a recursive…

Let K[x,y] be the algebra of two-variable polynomials over a field K. A polynomial p=p(x, y) is called a test polynomial (for automorphisms) if, whenever \phi(p)=p for a mapping \phi of K[x,y], this \phi must be an automorphism. Here we…

In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…

The group of 2-by-2 matrices with integer entries and determinant $\pm > 1$ can be identified either with the group of outer automorphisms of a rank two free group or with the group of isotopy classes of homeomorphisms of a 2-dimensional…

For $R_1,R_2,R_3,\dots$ a family of non isomorphic rings (or algebras) having each only 2 idempotents ($1$ and $0$), we classify up to isomorphism the rings (or algebras) obtained by taking products of powers of the different $R_i$. We show…

For an arbitrary $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ we study the problem of finding those $q$-polynomials $g$ over $\mathbb{F}_{q^n}$ for which the image sets of $f(x)/x$ and $g(x)/x$ coincide. For $n\leq 5$ we provide sufficient…