Related papers: Dynamics of polynomial maps over finite fields

Finding a homomorphism from some hypergraph $\mathcal{Q}$ (or some relational structure) to another hypergraph $\mathcal{D}$ is a fundamental problem in computer science. We show that an answer to this problem can be maintained under…

We present a one-parameter family of continuous, piecewise affine, area preserving maps of the square, which are inspired by a dynamical system in game theory. Interested in the coexistence of stochastic and (quasi-)periodic behaviour, we…

A unified algebraic interpretation of both finite families of orthogonal polynomials and biorthogonal rational functions of $q$-Hahn type is provided. The approach relies on the meta $q$-Hahn algebra and its finite-dimensional bidiagonal…

We define a $q$-deformation of the classical ring of integer-valued polynomials which we call the ring of quantum integer-valued polynomials. We show that this ring has a remarkable combinatorial structure and enjoys many positivity…

We show mathematical structure of the function dynamics, i.e., the dynamics of interval maps $f_{n+1} = (1-\e)f_n + \e f_n\circ f_n$ and clarify the types of fixed points, the self-referential structure and the hierarchical structure.

An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such…

This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…

We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

We obtain some properties of a class $\mathcal{A}$ of $q$-hypergeometric orthogonal polynomials with $q=-1$, described by a uniform parametrization of the recurrence coefficients. We construct a class $\mathcal{C}$ of complementary $-1$…

Polyharmonic maps of order k (briefly, k-harmonic maps) are a natural generalization of harmonic and biharmonic maps. These maps are defined as the critical points of suitable higher order functionals which extend the classical energy…

The cost functions considered are $c(x,y)=h(x-y)$, with $h\in C^2(R^n)$, homogeneous of degree $p\geq 2$, with positive definite Hessian in the unit sphere. We consider monotone maps $T$ concerning that cost and establish local…

This contribution summarizes recent work of the authors that combines methods from dynamical systems theory (discrete Painlev\'e equations) and asymptotic analysis of orthogonal polynomial recurrences, to address long-standing questions in…

Let $ R$ be a compact Riemann surface, and let $ P: R \to \mathbb P^1(\mathbb C) $ and $ Q: R \to \mathbb P^1(\mathbb C) $ be holomorphic maps. In this paper, we investigate the following problem: under what conditions do the preimages $…

Let ${\mathbb{D}}^{m\times n}$ be the set of $m\times n$ matrices over a division ring $\mathbb{D}$. Two matrices $A,B\in {\mathbb{D}}^{m\times n}$ are adjacent if ${\rm rank}(A-B)=1$. By the adjacency, ${\mathbb{D}}^{m\times n}$ is a…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

In this paper we investigate the (Kohn-Sham) density-to-potential map in the case of spinless fermions in one spatial dimension, whose existence has been rigorously established by the first author in [arXiv:2504.05501 (2025)]. Here, we…

A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…

Given a polynomial f and a finite field F one can construct a directed graph where the vertices are the values in the finite field, and emanating from each vertex is an edge joining the vertex to its image under f. When f is a Chebyshev…

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…