Related papers: Orbit length generating functions of automorphisms…

For a fixed dimension $N$ we compute the generating function of the numbers $t_N(n)$ (respectively $\bar{t}_N(n)$) of $PGL_{N+1}(k)$-orbits of rational $n$-sets (respectively rational $n$-multisets) of the projective space $\mathb{P}^N$…

The group of isometries W of a regular rooted tree, and many of its subgroups with branching structure, have groups of automorphisms induced by conjugation in W. This fact has stimulated the computation of the group of automorphisms of such…

We prove that if $L=\mbox{}^2F_4(2^{2n+1})'$ and $x$ is a nonidentity automorphism of $L$ then $G=\langle L,x\rangle$ has four elements conjugate to $x$ that generate $G$. This result is used to study the following conjecture about the…

Given a field $K$, a rational function $\phi \in K(x)$, and a point $b \in \mathbb{P}^1(K)$, we study the extension $K(\phi^{-\infty}(b))$ generated by the union over $n$ of all solutions to $\phi^n(x) = b$, where $\phi^n$ is the $n$th…

We introduce a generating function associated to the homogeneous generators of a graded algebra that measures how far is this algebra from being finitely generated. For the case of some algebras of Frobenius endomorphisms we describe this…

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

Ordinals can help prove termination for dependently typed programs. Brouwer trees are a particular ordinal notation that make it very easy to assign sizes to higher order data structures. They extend natural numbers with a limit…

We prove several results on backward orbits of rational functions over number fields. First, we show that if $K$ is a number field, $\phi\in K(x)$ and $\alpha\in K$ then the extension of $K$ generated by the abelian points in the backward…

The binomial notation (w u) represents the number of occurrences of the word u as a (scattered) subword in w. We first introduce and study possible uses of a geometrical interpretation of (w ab) and (w ba) when a and b are distinct letters.…

Let $\varPhi$ be a root system of a finite Weyl group $W$ with simple roots $\Delta$ and corresponding simple reflections $S$. For $J \subseteq S$, denote by $W_J$ the standard parabolic subgroup of $W$ generated by $J$, and by $\Delta_J…

A normal network is uniquely determined by the set of phylogenetic trees that it displays. Given a set $\mathcal{P}$ of rooted binary phylogenetic trees, this paper presents a polynomial-time algorithm that reconstructs the unique binary…

Let $K$ be a global function field of characteristic $p$ and degree $D$ over $\mathbb F_{p}(t)$. We consider dynamical systems over the projective line $\mathbb P^1(K)$ defined by rational maps with at most one prime of bad reduction. The…

We study the dilatation of outer automorphisms of right-angled Artin groups. Given a right-angled Artin group defined on a simplicial graph: $A(\Gamma) = \langle V | E \rangle$ and an automorphism $\phi \in Out(A(\Gamma))$ there is a…

Using Frobenius normal forms of matrices over finite fields as well as the Burnside Basis Theorem, we give a direct proof of Horo\v{s}evski\u{i}'s result that every automorphism $\alpha$ of a finite nilpotent group has a cycle whose length…

For a prime $p$ and nonnegative integers $j$ and $n$ let $\vartheta_p(j,n)$ be the number of entries in the $n$-th row of Pascal's triangle that are exactly divisible by $p^j$. Moreover, for a finite sequence $w=(w_{r-1}\cdots w_0)\neq…

Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words…

Let $\Gamma$ be a rooted tree and let $t$ be a positive integer. We study algebraic invariants and properties of the path ideal generated by monomial corresponding to paths of length $(t-1)$ in $\Gamma$. In particular, we give a recursive…

We prove a conjecture of Bourn and Willenbring (2020) regarding the palindromicity and unimodality of a certain family of polynomials $N_n(t)$. These recursively defined polynomials arise as the numerators of generating functions in the…

Four types of discrete transforms of Weyl orbit functions on the finite point sets are developed. The point sets are formed by intersections of the dual-root lattices with the fundamental domains of the affine Weyl groups. The finite sets…

Planar functions over finite fields give rise to finite projective planes and other combinatorial objects. They were originally defined only in odd characteristic, but recently Zhou introduced a definition in even characteristic which…