Related papers: Qin's Algorithm, Continued Fractions and 2-dimensi…
In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…
Real-time continuous learning over streaming data remains a central challenge in deep learning and AI systems. Traditional gradient-based models such as backpropagation through time (BPTT) face computational and stability limitations when…
We study the structure of bipartite unitary operators which generate via the Stinespring dilation theorem, quantum operations preserving some given matrix algebra, independently of the ancilla state. We characterize completely the unitary…
The quasicontinuum (QC) method, originally proposed by Tadmor, Ortiz and Phillips in 1996, is a computational technique that can efficiently handle regular atomistic lattices by combining continuum and atomistic approaches. In the present…
This is the first paper in a series on intrinsic Donaldson-Thomas theory, where we develop a new framework for enumerative geometry that allows the generalization of constructions and results from linear moduli stacks to general non-linear…
We develop a continued fraction algorithm in finite extensions of $\Q_p$ generalising certain algorithms in $\Q_p$, and prove the finiteness property for certain small degree extensions. We also discuss the metrical properties of the…
We study a natural q-analogue of a class of matrices with noncommutative entries, which were first considered by Yu. I. Manin in 1988 in relation with quantum group theory, (called Manin Matrices in [5]) . These matrices we shall call…
Chinese remainder theorem (CRT) is widely applied in cryptography, coding theory, and signal processing. It has been extended to the multidimensional CRT (MD-CRT), which reconstructs an integer vector from its vector remainders modulo…
The fundamental theorem of geometry of rectangular matrices describes the general form of bijective maps on the space of all $m\times n$ matrices over a division ring $\mathbb{D}$ which preserve adjacency in both directions. This result…
We observe structure in the sequences of quotients and remainders of the Euclidean algorithm with two families of inputs. Analyzing the remainders, we obtain new algorithms for computing modular inverses and representating prime numbers by…
This paper aims to introduce high school students to the intriguing world of continued fractions, a mathematical concept that provides a unique representation of numbers. The study focuses on the exploration and development of the…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…
We show, in full generality, that the staircase method provides integrals for mappings, and correspondences, obtained as traveling wave reductions of (systems of) integrable partial difference equations. We apply the staircase method to a…
Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or more numbers. They are defined as linear applications on some subcone of $\mathbb{R}^d$. We consider…
A generalized Chinese remainder theorem (CRT) for multiple integers from residue sets has been studied recently, where the correspondence between the remainders and the integers in each residue set modulo several moduli is not known. A…
An MV-algebra (equivalently, a lattice-ordered Abelian group with a distinguished order unit) is strongly semisimple if all of its quotients modulo finitely generated congruences are semisimple. All MV-algebras satisfy a Chinese Reminder…
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
Quantum computers, with parallel computing and entanglement effects, excel in cryptography analysis and big data processing. However, they are not fully developed yet, and their performance needs further evaluation. Traditional computer…
This article is the last of the series of articles where we reprove the foundational ideas of abstract six-functor formalisms developed by Liu-Zheng. We prove the theorem of partial adjoints, which is a simplicial technique of encoding…
We perform a In\"on\"u--Wigner contraction on Gaudin models, showing how the integrability property is preserved by this algebraic procedure. Starting from Gaudin models we obtain new integrable chains, that we call Lagrange chains,…