Related papers: Word maps, polynomial maps and image ratios

Let $\varphi:\mathbb{P}^1(\mathbb F_q)\to\mathbb{P}^1(\mathbb F_q)$ be a rational map of degree $d>1$ on a fixed finite field. We give asymptotic formulas for the size of image sets $\varphi^n(\mathbb{P}^1(\mathbb F_q))$ as a function of…

Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…

Let w be a group word. It is conjectured that if w has only countably many values in a profinite group G, then the verbal subgroup w(G) is finite. In the present paper we confirm the conjecture in the cases where w is a multilinear…

Let $\mathcal{G}$ be the class of all finite groups and consider the function $\psi'':\mathcal{G}\longrightarrow(0,1]$, given by $\psi''(G)=\frac{\psi(G)}{|G|^2}$, where $\psi(G)$ is the sum of element orders of a finite group $G$. In this…

Suppose that $F$ is a finite field and $R=M_n(F)$ is the ring of $n$-square matrices over $F$. Here we characterize when the Cayley graph of the additive group of $R$ with respect to the set of invertible elements of $R$, called the unitary…

Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…

For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…

Motivated by Carmichael numbers, we say that a finite ring $R$ is a Carmichael ring if $a^{|R|}=a$ for any $a \in R$. We then call an ideal $I$ of a ring $R$ as a Carmichael ideal if $R/I$ is a Carmichael ring, and a Carmichael element of…

We give a proof, using so-called fusion rings and q-deformations of Brauer algebras that the representation ring of an orthogonal or symplectic group can be obtained as a quotient of a ring Gr(O(\infinity)). This is obtained here as a…

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

We show that the amoeba of a complex algebraic variety defined as the solutions to a generic system of $n$ polynomials in $n$ variables has a finite basis. In other words, it is the intersection of finitely many hypersurface amoebas.…

We show that if the Sch\"{u}tzenberger graph of every positive word, that contains an $R$-word only once as it's subword, is finite over an Adain presentation $\langle X|u=v\rangle$, then the Sch\"{u}tzenberger graph of every positive word…

Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree $\tree$ where the weight of each node is the sum of the weights of its children. A treemap for $\tree$ is a hierarchical partition of a rectangle…

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

It is proven that if $G$ is a finite group, then $G^\omega$ has $2^{\mathfrak c}$ dense nonmeasurable subgroups. Also, other examples of compact groups with dense nonmeasurable subgroups are presented.

We study relationships between certain algebraic properties of groups and rings definable in a first order structure or $*$-closed in a compact $G$-space. As a consequence, we obtain a few structural results about $\omega$-categorical rings…

Mappings of a finite set into itself with restriction on the cycle lengths are considered (the so-called A-mappings). Asymptotics is given for the number of these mappings with a power-law reduction of the remainder.

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

We focus on $\Theta$-rich and almost $\Theta$-rich words over a finite alphabet $\mathcal{A}$, where $\Theta$ is an involutive antimorphism over $\mathcal{A}^*$. We show that any recurrent almost $\Theta$-rich word $\uu$ is an image of a…

Let $A$ be a finite ordered set. Define the ordered set $A^A$ as the set of all maps from $A$ to $A$, ordered pointwise. Let ${}^{A} A$ be the dual of $A^A$. We prove results in the spirit of Parts~I--III, but now using both $A^A$ and…