English
Related papers

Related papers: On multiplicative independence of rational functio…

200 papers

For each odd prime power q, we construct an infinite sequence of rational functions f(X) in F_q(X), each of which is exceptional, which means that for infinitely many n the map c-->f(c) induces a bijection of P^1(F_{q^n}). Moreover, each of…

Number Theory · Mathematics 2022-06-08 Zhiguo Ding , Michael E. Zieve

Let $\mathcal{R}$ be a finite valuation ring of order $q^r$. In this paper we generalize and improve several well-known results, which were studied over finite fields $\mathbb{F}_q$ and finite cyclic rings $\mathbb{Z}/p^r\mathbb{Z}$, in the…

Combinatorics · Mathematics 2016-11-22 Pham Van Thang , Le Anh Vinh

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

Number Theory · Mathematics 2025-10-16 Joachim König

This paper deepens the connections between critically finite rational maps and finite subdivision rules. The main theorem is that if f is a critically finite rational map with no periodic critical points, then for any sufficiently large…

Dynamical Systems · Mathematics 2007-05-23 J. W. Cannon , W. J. Floyd , W. R. Parry

Iterating Newton's method symbolically for the general quadratic yields a rational function, the numerator and denominator of which are polynomials with highly composite coefficients.

Combinatorics · Mathematics 2007-05-23 Hal Canary , Carl Edquist , Samuel Lachterman , Brendan Younger

The independence polynomial of a graph $G$ is the generating polynomial corresponding to its independent sets of different sizes. More formally, if $a_k(G)$ denotes the number of independent sets of $G$ of size $k$ then \[I(G,z) \as…

Combinatorics · Mathematics 2025-10-13 Om Prakash , Vikram Sharma

We classify the pairs of polynomials $f,g \in \mathbb{C}[X]$ having orbits satisfying infinitely many multiplicative dependence relations, extending a result of Ghioca, Tucker and Zieve. Moreover, we show that given $f_1,\ldots, f_n$ from a…

Number Theory · Mathematics 2024-02-22 Marley Young

In this paper we construct an entire function of two variables having the property that its values and its partial derivatives of any order at any distinct algebraic points are algebraically independent. Such an entire function is generated…

Number Theory · Mathematics 2019-08-20 Haruki Ide

Adopting the approach of [7] we study rational function carrying invariant line fields on the Julia set. In particular, we show that under certain weak conditions all possible measurable invariant line fields of a rational function on its…

Dynamical Systems · Mathematics 2024-08-28 Genadi Levin

We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…

Number Theory · Mathematics 2026-04-22 Akio Nakagawa

We investigate finite sets of rational functions $\{ f_{1},f_{2}, \dots, f_{r} \}$ defined over some number field $K$ satisfying that any $t_{0} \in K$ is a $K_{p}$-value of one of the functions $f_{i}$ for almost all primes $p$ of $K$. We…

Number Theory · Mathematics 2024-08-19 Benjamin Klahn , Joachim König

We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express…

Databases · Computer Science 2015-07-07 Vilem Vychodil

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

Symbolic Computation · Computer Science 2023-09-26 Mihai Prunescu

We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…

Combinatorics · Mathematics 2019-12-23 Manuel Aprile , Samuel Fiorini

A conjecture of Odoni stated over Hilbertian fields $K$ of characteristic zero asserts that for every positive integer $d$, there exists a polynomial $f\in K[x]$ of degree $d$ such that for every positive integer $n$, each iterate $f^{\circ…

Number Theory · Mathematics 2023-05-11 Sushma Palimar

For a polynomial in several variables depending on some parameters, we discuss some results to the effect that for almost all values of the parameters the polynomial is irreducible. In particular we recast in this perspective some results…

Algebraic Geometry · Mathematics 2015-10-22 Arnaud Bodin , Pierre Dèbes , Salah Najib

It is well known that conditional independence can be used to factorize a joint probability into a multiplication of conditional probabilities. This paper proposes a constructive definition of inter-causal independence, which can be used to…

Artificial Intelligence · Computer Science 2013-02-28 Nevin Lianwen Zhang , David L Poole

We study the multiplicative convolution for c-monotone independence. This convolution unifies the monotone, Boolean and orthogonal multiplicative convolutions. We characterize convolution semigroups for the c-monotone multiplicative…

Operator Algebras · Mathematics 2013-12-04 Takahiro Hasebe

We prove that function fields of varieties of dimension at least two over an algebraic closure of a finite field are determined, modulo purely inseparable extensions, by the quotient by the second term in the lower central series of their…

Algebraic Geometry · Mathematics 2009-12-31 Fedor Bogomolov , Yuri Tschinkel

A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…

Information Theory · Computer Science 2011-02-24 Davide Schipani , Michele Elia , Joachim Rosenthal