相关论文: The Laurent phenomenon

We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials, and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves…

It was shown by Fomin, Shapiro and Thurston that some cluster algebras arise from orientable surfaces. Subsequently, Dupont and Palesi extended this construction to non-orientable surfaces. We link this framework to Lam and Pylyavskyy's…

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

This note defines a family of Laurent polynomials (indexed in the rational projective line) which generalize the Markoff numbers and relate to the character variety of the one-cusped torus. We describe which monomials appear in each…

We give an elementary proof of the Kontsevich conjecture that asserts that the iterations of the noncommutative rational map K_r:(x,y)-->(xyx^{-1},(1+y^r)x^{-1}) are given by noncommutative Laurent polynomials.

We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…

The author introduces a conjecture about Makar-Limanov invariants of affine unique factorization domains over a field of characteristic zero. Then the author finds that the conjecture does not always hold when $\mathbbm{k}$ is not…

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

Generic Newton polygons for L-functions of exponential sums associated to Laurent polynomials in one variable are determined. The corresponding Hasse polynomials are also determined.

In this paper, we provide a combinatorial interpretation for Laurent polynomials obtained by iteratively mutating a certain periodic quiver that has been framed with frozen vertices. This yields a family of cluster variables with principal…

We prove a general statement about the integrality of the sequences generated by a recursion of the following form: $nu_n$ equals a linear combination of $u_{n-1},u_{n-2},\dots,u_0$ with polynomial coefficients in $n$ of special form. This…

Recently Dritschel proves that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix…

We prove a generalized version of Renault's theorem for Cartan subalgebras. We show that the original assumptions of second countability and separability are not needed. This weakens the assumption of topological principality of the…

We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…

In this short communication we address the problem of reducibility in a highly excited Lennard-Jones system. We show that the probability of emitting $n$ fragments can be described in terms of a single probability through the binomial…

We prove the non-commutative Laurent phenomenon for two variables.

We consider a family of nonlinear rational recurrences of odd order which was introduced by Heideman and Hogan. All of these recurrences have the Laurent property, implying that for a particular choice of initial data (all initial values…

We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…

The singularity confinement test is very useful for isolating integrable cases of discrete-time dynamical systems, but it does not provide a sufficient criterion for integrability. Quite recently a new property of the bilinear equations…