Related papers: The Largest Possible Finite Degree of Functions be…

Higher genus partition functions of two-dimensional conformal field theories have to be invariants under linear actions of mapping class groups. We illustrate recent results [4,6] on the construction of such invariants by concrete…

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

We describe an effective method for computing the topological degree of continuous functions $R:S^2 \to S^2$, where $S^2$ is the Riemann sphere. Our approach generalizes the degree formula for rational functions of complex polynomials,…

Bent functions as optimal combinatorial objects are difficult to characterize and construct. In the literature, bent idempotents are a special class of bent functions and few constructions have been presented, which are restricted by the…

We consider various regular graphs defined on the set of elements of given rank of a finite polar space. It is likely that no two such graphs, of the same kind but defined for different ranks, can have the same degree. We shall prove this…

We study the maximum Hamming distance (or rather, the complementary notion of "minimum approximability") of a general function on a finite group $G$ to either of the sets $\operatorname{End}(G)$ and $\operatorname{Aff}(G)$, of group…

We compute all dynamical degrees of monomial maps by interpreting them as mixed volumes of polytopes. By exploiting further the isomorphism between the polytope algebra of P. McMullen and the universal cohomology of complete toric…

Filling functions are asymptotic invariants of finitely presentable groups; the seminal work on the subject is by M.Gromov. They record features of combinatorial homotopy discs (van Kampen diagrams) filling loops in Cayley 2-complexes.…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We look at sequences of positive integers that can be realized as degree sequences of iterates of rational dominant maps of smooth projective varieties over arbitrary fields. New constraints on the degree growth of endomorphisms of the…

In this paper we investigate the higher dimensional divergence functions of mapping class groups of surfaces and of CAT(0)--groups. We show that, for mapping class groups of surfaces, these functions exhibit phase transitions at the rank…

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

Finite (word) state transducers extend finite state automata by defining a binary relation over finite words, called rational relation. If the rational relation is the graph of a function, this function is said to be rational. The class of…

A rational function is the ratio of two complex polynomials in one variable without common roots. Its degree is the maximum of the degrees of the numerator and the denominator. Rational functions belong to the same class if one turns into…

In this paper, we study the relation between two dynamical systems (V,f) and (V,g) with f. g = g . f. As an application, we show that an endomorphism (respectively a polynomial map with Zariski dense, of bounded Pre(f) has only finitely…

In this work, using maximal elements in generalized Weierstrass semigroups and its relationship with pure gaps, we extend the results in \cite{CMT2024} and provide a way to completely determine the set of pure gaps at several rational…

The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…

Generalising the concept of a complete permutation polynomial over a finite field, we define completness to level $k$ for $k\ge1$ in fields of odd characteristic. We construct two families of polynomials that satisfy the condition of high…

In this paper we introduce and study the relative cyclic subgroup commutativity degrees of a finite group. We show that there is a finite group with $n$ such degrees for all $n \in \mathbb{N}^*\setminus \lbrace 2\rbrace$ and we indicate…

We study the class $\mathcal{M}$ of functions meromorphic outside a countable closed set of essential singularities. We show that if a function in $\mathcal{M}$, with at least one essential singularity, permutes with a non-constant rational…