Related papers: Qin's Algorithm, Continued Fractions and 2-dimensi…
We introduce an invertible operation on finite sequences of positive integers and call it "kneading". Kneading preserves three invariants of sequences -- the parity of the length, the sum of the entries, and one we call the "alternant". We…
This study investigates the theoretical and computational aspects of quaternion generalized inverses, focusing on outer inverses and {1,2}-inverses with prescribed range and/or null space constraints. In view of the non-commutative nature…
The practical application of a new class of coprime arrays based on the Chinese remainder theorem (CRT) over quadratic fields is presented in this paper. The proposed CRT arrays are constructed by ideal lattices embedded from coprime…
In recent decades, a growing number of discoveries in fields of mathematics have been assisted by computer algorithms, primarily for exploring large parameter spaces that humans would take too long to investigate. As computers and…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…
We study solutions of the Yang-Baxter equation on a tensor product of an arbitrary finite-dimensional and an arbitrary infinite-dimensional representations of the rank one symmetry algebra. We consider the cases of the Lie algebra sl_2, the…
Quaternary code (QC) designs form an attractive class of nonregular factorial fractions. We develop a complementary set theory for characterizing optimal QC designs that are highly fractionated in the sense of accommodating a large number…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…
In this paper, we use two-variable Laurent polynomials attached to matrices to encode properties of compositions of sequences. The Lagrange identity in the ring of Laurent polynomials is then used to give a short and transparent proof of a…
Previous research on quantum annealing methods focused on effectively modeling systems of linear equations by utilizing quadratic unconstrained binary optimization (QUBO) formulations. These studies take part in enhancing quantum computing…
We develop the quantum inverse scattering method for the one-dimensional Hubbard model on the infinite interval at zero density. $R$-matrix and monodromy matrix are obtained as limits from their known counterparts on the finite interval.…
Continued fractions are linked to Stern's diatomic sequence 0,1,1,2,1,3,2,3,1,4,... (given by the recursion relation a_2n=a_n and a_{2n+1} = a_n + a_{n+1}, where a_0=0 and a_1=1), which has long been known. Using a particular…
A typical system of k difference (or differential) equations can be compressed, or folded into a difference (or ordinary differential) equation of order k. Such foldings appear in control theory as the canonical forms of the controllability…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
Lattices have been conceived as a powerful tool for data hiding. While conventional studies and applications focus on achieving the optimal robustness versus distortion tradeoff, in some applications such as data hiding in…
In this paper, we propose linearly implicit and arbitrary high-order conservative numerical schemes for ordinary differential equations with a quadratic invariant. Many differential equations have invariants, and numerical schemes for…
This paper provides some preliminary results on the dynamics of certain complex continued fractions. After establishing some general number theoretic results, we explore the dynamics of the natural extension map associated to a specific…
Sliced inverse regression (Duan and Li [Ann. Statist. 19 (1991) 505-530], Li [J. Amer. Statist. Assoc. 86 (1991) 316-342]) is an appealing dimension reduction method for regression models with multivariate covariates. It has been extended…
We introduce a new, large class of continued fraction algorithms producing what are called contracted Farey expansions. These algorithms are defined by coupling two acceleration techniques -- induced transformations and contraction -- in…