Related papers: QRT maps and related Laurent systems
We study the recurrence coefficients of the orthogonal polynomials with respect to a semi-classical extension of the Krawtchouk weight. We derive a coupled discrete system for these coefficients and show that they satisfy the fifth…
The Somos-4 equation defines the sequences with this name. Looking at these sequences with an additional property we get a quartic polynomial in 4 variables. This polynomial defines a rational, projective surface in $\mathbb{RP}^{3}$. Here…
Despite their ubiquity in NLP tasks, Long Short-Term Memory (LSTM) networks suffer from computational inefficiencies caused by inherent unparallelizable recurrences, which further aggravates as LSTMs require more parameters for larger…
Building on the recent derivation of a bare factorization theorem for the $b$-quark induced contribution to the $h\to\gamma\gamma$ decay amplitude based on soft-collinear effective theory, we derive the first renormalized factorization…
We study recursive algorithm for computing DCT of lengths $N=q 2^m$ ($m,q \in \mathbb{N}$, $q$ is odd) due to C.W.Kok. We show that this algorithm has the same multiplicative complexity as theoretically achievable by the prime factor…
We present a novel quantum high-dimensional linear regression algorithm with an $\ell_1$-penalty based on the classical LARS (Least Angle Regression) pathwise algorithm. Similarly to available classical algorithms for Lasso, our quantum…
Using the LP algebraic toolkit, Conway's original topograph is rethought of as a cluster construction, paving the way for a wider topography based on mutation-type local rules. As a remarkable application of such cluster-driven upgrade,…
Recursion formulae are derived for the calculation of two centre matrix elements of a radial function in relativistic quantum mechanics. The recursions are obtained between not necessarily diagonal radial eigensates using arbitrary radial…
We introduce QuaRot, a new Quantization scheme based on Rotations, which is able to quantize LLMs end-to-end, including all weights, activations, and KV cache in 4 bits. QuaRot rotates LLMs in a way that removes outliers from the hidden…
We detail the continued fraction expansion of the square root of monic sextic polynomials. We note in passing that each line of the expansion corresponds to addition of the divisor at infinity, and interpret the data yielded by the general…
In this paper, we present the QR Algorithm with Permutations that shows an improved convergence rate compared to the classical QR algorithm. We determine a bound for performance based on best instantaneous convergence, and develop low…
Factorization of matrices of Laurent polynomials plays an important role in mathematics and engineering such as wavelet frame construction and filter bank design. Wavelet frames (a.k.a. framelets) are useful in applications such as signal…
In this paper we study quantitative recurrence and the shrinking target problem for dynamical systems coming from overlapping iterated function systems. Such iterated function systems have the important property that a point often has…
In the context of applying the Lorentz group theory to polarization optics in the frames of Stokes-Mueller formalism, some properties of the Lorentz group are investigated. We start with the factorized form of arbitrary Lorentz matrix as a…
We study linear recurrence relations in the character solutions of $Q$-systems obtained from the Kirillov-Reshetikhin modules. We explain how known results on difference $L$-operators lead to a uniform construction of linear recurrences in…
In this paper, we extend the work of Liesen et al. (2002), which analyzes how the condition number of an orthonormal matrix Q changes when a column is added ([Q, c]), particularly focusing on the perpendicularity of c to the span of Q.…
The implicitly shifted QR iteration is used as a restart procedure for the Arnoldi method for the calculation of a few dominant eigenvalues of a large matrix. We show that the underlying idea of implicit polynomial filtering can be utilized…
Recursive partitioning is the core of several statistical methods including CART, random forest, and boosted trees. Despite the popularity of tree based methods, to date, there did not exist methods for combining multiple trees into a…
Given a lattice basis of n vectors in Z^n, we propose an algorithm using 12n^3+O(n^2) floating point operations for checking whether the basis is LLL-reduced. If the basis is reduced then the algorithm will hopefully answer ''yes''. If the…
We study the correspondence assigning the vertices of a certain quotient of the local Bruhat-Tits tree for the general linear group over a global function field, to conjugacy classes of maximal orders in some quaternion algebras. The…