Related papers: The Laurent phenomenon
The aim of this article is to investigate the issues of multiplicative inverses and composition in the set of formal Laurent series. We show the lack of general uniqueness of inverses of formal Laurent series; necessary and sufficient…
We straighten a result of [5] about arithmetic properties of the Laurent coefficients of the conformal isomorphism from the complement of the unit disk onto the complement of the Mandelbrot set. This confirms an empirical observation by Don…
We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…
Let L be a finite extension of Q_p and d a positive integer. A conjecture, due to C. Breuil and P. Schneider, says that the existence of invariant norms on certain locally algebraic representations of GL_{d+1}(L) should be equivalent to the…
We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…
Following our earlier work, where doubly indexed and irreducible over Q two-variable Laguerre polynomials were introduced, we prove for such polynomials some recurrence formulas and obtain a generating function. In addition, we show how…
In 1882, Kronecker established that a given univariate formal Laurent series over a field can be expressed as a fraction of two univariate polynomials if and only if the coefficients of the series satisfy a linear recurrence relation. We…
We establish a generalization of Bourgain double recurrence theorem by proving that for any map $T$ acting on a probability space $(X,\mathcal{A},\mu)$, and for any non-constant polynomials $P, Q$ mapping natural numbers to themselves, for…
In a recent beautiful but technical article, William Y.C. Chen, Qing-Hu Hou, and Doron Zeilberger developed an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequences,…
We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
Jacobian conjectures (that nonsingular implies a global inverse) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The birational…
We introduce a recurrence which we term the multidimensional cube recurrence, generalizing the octahedron recurrence studied by Propp, Fomin and Zelevinsky, Speyer, and Fock and Goncharov and the three-dimensional cube recurrence studied by…
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
In this article we shows some results about algebra with the group of units having special polynomial identity.
The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. We prove the conjecture for a multivariate generalization of the matching polynomial. This is further…
We prove a function field analogue of a conjecture of Schinzel on the factorization of univariate polynomials over the rationals. We derive from it a finiteness theorem for the irreducible factorizations of the bivariate Laurent polynomials…
We construct the Laurent phenomenon algebras the cluster variables of which satisfy the discrete BKP equation and other difference equations obtained by its reduction. These Laurent phenomenon algebras are constructed from seeds with a…
A simple formal procedure makes the main properties of the lagrangian binomial extendable to functions depending to any kind of order of the time--derivatives of the lagrangian coordinates. Such a broadly formulated binomial can provide the…
In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with…