Related papers: Functional Graphs of Polynomials over Finite Field…

We prove that, if f:R^n\to R satisfies Fr\'echet's functional equation and f(x_1,...,x_n) is not an ordinary algebraic polynomial in the variables x_1,...,x_n, then f is unbounded on all non-empty open set U of R^n. Furthermore, the closure…

We give an algorithm that, for every fixed k, decides isomorphism of graphs of rank width at most k in polynomial time. As the clique width of a graph is bounded in terms of its rank width, we also obtain a polynomial time isomorphism test…

We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…

We investigate classical and quantum physics-based algorithms for solving the graph isomorphism problem. Our work integrates and extends previous work by Gudkov et al. (cond-mat/0209112) and by Rudolph (quant-ph/0206068). Gudkov et al.…

Let $\Gamma$ be a quiver on n vertices $v_1, v_2, ..., v_n$ with $g_{ij}$ edges between $v_i$ and $v_j$, and let $\alpha \in \N^n$. Hua gave a formula for $A_{\Gamma}(\alpha, q)$, the number of isomorphism classes of absolutely…

In this paper we study the description of the functional graphs associated with the power maps over finite groups. We present a structural result which describes the isomorphism class of these graphs for abelian groups and also for flower…

Consider the power pseudorandom-number generator in a finite field ${\mathbb F}_q$. That is, for some integer $e\ge2$, one considers the sequence $u,u^e,u^{e^2},\dots$ in ${\mathbb F}_q$ for a given seed $u\in {\mathbb F}_q^\times$. This…

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…

The functional equation f(p(z))=g(q(z)) is studied, where p,q are polynomials and f,g are trancendental meromorphic functions in C. We find all the pairs p,q for which there exist nonconstant f,g satisfying our equation and there exist no…

Given a number field $K$ and a polynomial $f(z) \in K[z]$, one can naturally construct a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points of $f$, with an edge $\alpha \to \beta$ if and only if $f(\alpha)…

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…

We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two…

Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the…

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

A function $f$ of a graph is called a complete graph invariant if the isomorphism of graphs $G$ and $H$ is equivalent to the equality $f(G)=f(H)$. If, in addition, $f(G)$ is a graph isomorphic to $G$, then $f$ is called a canonical form for…

The study of iterations of functions over a finite field and the corresponding functional graphs is a growing area of research with connections to cryptography. The behaviour of such iterations is frequently approximated by what is know as…

The classification of maximal function fields over a finite field is a difficult open problem, and even determining isomorphism classes among known function fields is challenging in general. We study a particular family of maximal function…

We prove a characterization of all polynomial-time computable queries on the class of interval graphs by sentences of fixed-point logic with counting. More precisely, it is shown that on the class of unordered interval graphs, any query is…

Choose a random degree d poly f with coefficients in a finite field F. We estimate the ultimate period of f under compositional iteration. We also determine the joint distribution of the small cycle lengths in the graph with edges (x,f(x)),…