Related papers: QRT maps and related Laurent systems
We show that the coefficients of the three-term recurrence relation for orthogonal polynomials with respect to a semi-classical extension of the Laguerre weight satisfy the fourth Painlev\'e equation when viewed as functions of one of the…
We provide lower bounds for p-adic valuations of multisums of factorial ratios which satisfy an Ap\'ery-like recurrence relation: these include Ap\'ery, Domb, Franel numbers, the numbers of abelian squares over a finite alphabet, and…
This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice…
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
Factorization theorems for single inclusive jet production play a crucial role in the study of jets and their substructure. In the case of small radius jets, the dynamics of the jet clustering can be factorized from both the hard production…
In this paper, we study the Laurent coefficients of meromorphic modular forms at CM points by giving two approaches of computing them. The first is a generalization of the method of Rodriguez-Villegas and Zagier, which expresses the Laurent…
We treat three cubic recurrences, two of which generalize the famous iterated map $x \mapsto x (1-x)$ from discrete chaos theory. A feature of each asymptotic series developed here is a constant, dependent on the initial condition but…
Under a map T, a point x recurs at rate given by a sequence {r_n} near a point x_0 if d(T^n(x),x_0)< r_n infinitely often. Let us fix x_0, and consider the set of those x's. In this paper, we study the size of this set for expanding maps…
We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} =…
The central idea of this article is to present a systematic approach to construct some recurrence relations for the solutions of the second-order linear difference equation of hypergeometric-type defined on the quadratic-type lattices. We…
We develop our method to prove quantum superintegrability of an integrable 2D system, based on recurrence relations obeyed by the eigenfunctions of the system with respect to separable coordinates. We show that the method provides rigorous…
There is a theory of continued fractions for Laurent series in x^{-1} with coefficients in a field F. This theory bears a close analogy with classical continued fractions for real numbers with Laurent series playing the role of real numbers…
We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…
Reproduction studies reported in NLP provide individual data points which in combination indicate worryingly low levels of reproducibility in the field. Because each reproduction study reports quantitative conclusions based on its own,…
We derive recursive equations for the characteristic numbers of rational nodal plane curves with at most one cusp, subject to point conditions, tangent conditions and flag conditions, developing techniques akin to quantum cohomology on a…
The resummed expression for the quark form factor illustrates the fact that dimensional continuation provides a regularization not only for ultraviolet and infrared singularities of fixed order QCD amplitudes, but also for the Landau pole…
I propose a way to use non-Euclidean norms to formulate a QR-like factorization which can unlock interesting and potentially useful properties of non-Euclidean norms - for example the ability of $l^1$ norm to suppresss outliers or promote…
We give iterative constructions for irreducible polynomials over F_q of degree nt^r for all nonnegative integers r, starting from irreducible polynomials of degree n. The iterative constructions correspond modulo fractional linear…
The Fermat numbers have many notable properties, including order universality, coprimality, and definition by a recurrence relation. We use arbitrary elliptic curves and rational points of infinite order to generate sequences that are…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…