Search Results (24)

This survey provides a systematic review of delayed matrix functions and their role in deriving explicit solutions for linear discrete delay systems. Tracing the evolution from foundational single-delay first-order systems to sophisticated multi-delay configurations, we cover delayed matrix exponentials, sines, and cosines for both commutative and non-commutative coefficient matrices, as well as generalizations for two-sided delay terms. We synthesize closed-form solution representations for a wide spectrum of initial value problems and highlight applications across stability analysis, controllability, iterative learning control, and finite-time stability. The paper concludes with a critical discussion identifying open problems-including extensions to higher-order differences, Volterra-type systems, and non-commutative multi-delay scenarios-serving as a unified reference connecting algebraic construction to analytical utility in linear discrete dynamical systems with memory. The review is reported in accordance with the PRISMA 2020 guidelines; the completed checklist and flow diagram are provided. Full article

This study formulates closed-form solution expressions for linear discrete matrix equations that involve several time delays, without requiring the coefficient matrices or the non-homogeneous term to commute. Using a generalized multinomial series and exponential matrix functions adapted to multiple delays, we establish fundamental solutions in a setting where matrix multiplication is not assumed to be commutative. These explicit representations are subsequently utilized to analyze the stability properties of the system, specifically establishing Hyers–Ulam stability. The analysis elucidates the influence of both delay structure and noncommutativity on solution behavior and robustness. A representative example is provided to illustrate the practical applicability of the proposed method and to highlight the significant qualitative effects induced by delays and noncommutative matrix interactions. Notably, the results extend classical theories by addressing noncommutative settings and yield novel contributions that remain significant even in the absence of delays. Full article

This paper develops a structured analytical framework and a robust numerical methodology for the spectral stability of time-varying bilateral quaternion differential equations of the form $\dot{q}=A\left(t\right)q+qB\left(t\right)$. By systematically extending classical real matrix theory to non-commutative dynamical systems via exact isometric real representations, this study utilizes the Kronecker product of real adjoint matrices to rigorously elucidate the underlying tensor structure of the bilateral evolution operator. This tensor-based reformulation proves that the Floquet multipliers of the bilaterally coupled system can be strictly decoupled into the product of the spectra corresponding to the left and right unilateral subsystems. Second, a “Scalar-Vector Stability Separation Principle” based on logarithmic norms is proposed, demonstrating that the transient energy evolution of the system is governed exclusively by the Hermitian real parts of the coefficient matrices, remaining entirely independent of the anti-Hermitian imaginary parts (rotation terms). Furthermore, for constant-coefficient and slowly varying systems, the Riesz projection from holomorphic functional calculus is introduced to establish algebraic criteria for exponential dichotomies, thereby revealing a cubic scaling law that relates the robustness threshold to the spectral gap (${\epsilon }_0\propto {\beta }^3$). Numerically, a Quaternion Chebyshev Spectral Collocation Method (Q-CSCM) is embedded within this exact vectorization framework to ensure that the algebraic symmetries of the bilateral system are strictly preserved through the isomorphic mapping. By explicitly constructing the fully discrete Kronecker product matrix via the exact real vectorization isomorphism, discrete energy estimates are utilized to rigorously prove that the numerical scheme successfully inherits the intrinsic spectral accuracy of the Chebyshev approximation. Comprehensive numerical experiments demonstrate that, within the low-dimensional regime, this methodology exhibits substantial temporal approximation efficiency advantages and superior numerical robustness compared to an alternative Legendre spectral baseline, as well as traditional explicit and state-of-the-art implicit symplectic Runge–Kutta methods, particularly when solving stiff and critically stable problems such as nonlinear Riccati oscillators. Full article

We review aspects of entanglement entropy in the quantum mechanics of $N\times N$ matrices, i.e., matrix quantum mechanics (MQM), at large N. In doing so, we review standard models of MQM and their relation to string theory, D-brane physics, and emergent non-commutative geometries. We overview, in generality, definitions of subsystems and entanglement entropies in theories with gauge redundancy and discuss the additional structure required for definining subsystems in MQMs possessing a $U\left(N\right)$ gauge redundancy. In connecting these subsystems to non-commutative geometry, we review several works on ‘target space entanglement,’ and entanglement in non-commutative field theories, highlighting the conditions in which target space entanglement entropy displays an ‘area law’ at large N. We summarize several example calculations of entanglement entropy in non-commutative geometries and MQMs. We review recent work in connecting the area law entanglement of MQM to the Ryu–Takayanagi formula, highlighting the conditions in which $U\left(N\right)$ invariance implies a minimal area formula for the entanglement entropy at large N. Finally, we make comments on open questions and research directions. Full article

Symmetric structures are key in non-associative algebras. A Mock-Lie algebra, defined by commutativity and the Jacobi identity, shows strong algebraic symmetry. This paper studies the quasi-centroid, which captures the symmetry of linear operators commuting with the algebra’s product. We define the quasi-centroid and set its condition for linear endomorphisms under the bracket operation. We classify matrix representations of quasi-centroids for all Mock-Lie algebras of dimensions 2 to 5 by computing matrices and analyzing coefficient relations. These results provide a foundation for further structural study. We also show that in each case, the centroid is strictly contained in the quasi-centroid, confirming proper containment for all these algebras. Full article

This paper addresses the solvability and controllability of fractional delay differential Sylvester matrix equations with non-permutable coefficient matrices. By applying a vectorization approach and Kronecker product algebra, we transform the matrix-valued problem into an equivalent vector system, enabling the derivation of explicit solution representations using a delayed perturbation of two-parameter Mittag-Leffler-type matrix functions. We establish necessary and sufficient conditions for controllability via a fractional delay Gramian matrix, providing a computationally verifiable criterion that requires no commutativity assumptions. The theoretical results are validated through numerical examples, demonstrating effectiveness in noncommutative scenarios where classical methods fail. Full article

The pure states of two-qubit quantum systems are described by a four-dimensional vector of complex numbers, and unitary operators transferring a two-qubit quantum system from one state to another have the form of a $4\times 4$ matrix with complex elements. This fact brings to mind the idea of studying the spaces of four-dimensional numbers with complex components. Moreover, the results obtained by the authors for four-dimensional numbers with real components inspire some optimism. In this paper we construct four-dimensional spaces of complex numbers by analogy with four-dimensional spaces of real numbers. Each four-dimensional number is mapped to a matrix formed from its components and it is proved that the constructed mapping is a bijection and a homomorphism. In the space of four-dimensional numbers of the eight basis elements, half are real and half are imaginary. The presence of such symmetry distinguishes these spaces from the space of quaternions, in which one basis element is real and the rest are imaginary. The symmetry of the basis numbers makes these spaces a natural generalization of one-dimensional and two-dimensional (complex) algebra. The conditions under which the corresponding matrices are gates for two-qubit quantum systems are defined. The notion of a unitary state of a two-qubit quantum system is introduced, to which various gates from commutative groups of gates correspond. It is shown that any gate of a unitary state transforms a unitary state into a unitary state and a non-unitary state into a non-unitary state. Almost all gates used in the construction of quantum circuits, in particular H, SWAP, CX, CY, and CZ, have the same properties. The problem of searching for a gate that transfers a quantum system from one unitary state to another unitary state has been solved. Thus, with the help of four-dimensional spaces of complex numbers it was possible to construct whole classes of two-qubit gates, which opens new possibilities for the construction of quantum algorithms. The results obtained have important theoretical and practical implications for quantum computing. Full article

This work investigates a new category of linear non-homogeneous discrete-matrix equations that feature multiple delays and first-order differences, under the assumption of pairwise permutable coefficient matrices. We define a novel multi-delayed discrete-matrix-exponential function that extends previous concepts. Using this function and specific commutativity properties, we construct an explicit matrix solution. The study highlights the advantages of our approach by contrasting it with prior research and identifying new open questions. Finally, a numerical example illustrates the application and relevance of the derived solution. Full article

A new class of linear non-homogeneous discrete matrix equations with multiple delays and second-order differences is considered, where the coefficient matrices satisfy pairwise permutability conditions. First, new multi-delayed discrete matrix sine- and cosine-type functions are introduced, which generalize existing delayed discrete matrix functions. Based on the introduced matrix functions and appropriate commutativity conditions, an explicit matrix representation of the solution is derived. The importance of our results is shown by comparing them with related previous works, along with suggestions about some new open problems. Finally, an example is provided to illustrate the importance of the results. Full article

This paper presents the construction and analysis of a novel class of alternant codes over Gaussian integers, aimed at enhancing error correction capabilities in high-reliability communication systems. These codes are constructed using parity-check matrices derived from finite commutative local rings with unity, specifically ${\mathbb{Z}}_n\left[i\right],$ where $i^2=-1$. A detailed algebraic investigation of the polynomial $x^n-1$ over these rings is conducted to facilitate the systematic construction of such codes. The proposed alternant codes extend the principles of classical BCH and Goppa codes to complex integer domains, enabling richer algebraic structures and greater error-correction potential. We evaluate the performance of these codes in terms of error correction capability, and redundancy. Numerical results show that the proposed codes outperform classical short-length codes in scenarios requiring moderate block lengths, such as those applicable in certain segments of 5G and IoT networks. Unlike conventional codes, these constructions allow enhanced structural flexibility that can be tuned for various application-specific parameters. While the potential relevance to quantum-safe communication is acknowledged, it is not the primary focus of this study. This work demonstrates how extending classical coding techniques into non-traditional algebraic domains opens up new directions for designing robust and efficient communication codes. Full article

This paper investigates the distributed state estimation problem for the linear system against non-Gaussian noise, where every sensor commutates information only within its adjacent sensors without the need for a fusion center. Correntropy is a similarity metric based on a kernel function that has symmetry. Symmetry means that for any two data points, the output value of the kernel function does not depend on the order of the data points. By adopting a correntropy cost function based on the rational quadratic kernel function approximation to restrain non-Gaussian heavy-tailed noise, a centralized maximum correntropy Kalman filter is first derived for the linear sens+or network system at first. Then the corresponding centralized maximum correntropy information filter is attained by employing the information matrices, which is a foundation for further designing distributed information algorithms under multi-sensor networks. Thirdly, the distributed rational quadratic maximum correntropy information filter and distributed adaptive rational quadratic maximum correntropy information filter are designed by exploiting the weighted census average to solve the non-Gaussian heavy-tailed noise interference in sensor networks. Finally, the performance of the proposed algorithms is illustrated through numerical simulations on the sensor network system. Full article

This work aims to explore the algebraic and spectral properties of a novel parametric Hermitian non-Pauli spin basis. The primary motivation for this work is to introduce an alternative to the Pauli spin basis for investigating systems where conventional quantum statistics no longer apply. This study explores the symmetries, commutation relations, Lie algebra structures, and ladder operators of the proposed spin matrices. Additionally, it provides discussions on key findings, potential applications, and concludes with some final remarks. An example for modeling the spectrum of a quantum system is provided. Full article

The reduced density matrix that characterises the state of an open quantum system is a projection from the full density matrix of the quantum system and its environment, and there are many full density matrices consistent with a given reduced version. Without a specification of relevant details of the environment, the time evolution of a reduced density matrix is therefore typically unpredictable, even if the dynamics of the full density matrix are deterministic. With this in mind, we investigate a two-level open quantum system using a framework of quantum state diffusion. We consider the pseudorandom evolution of its reduced density matrix when subjected to an environment-driven process that performs a continuous quantum measurement of a system observable, invoking dynamics that asymptotically send the system to one of the relevant eigenstates. The unpredictability is characterised by a stochastic entropy production, the average of which corresponds to an increase in the subjective uncertainty of the quantum state adopted by the system and environment, given the underspecified dynamics. This differs from a change in von Neumann entropy, and can continue indefinitely as the system is guided towards an eigenstate. As one would expect, the simultaneous measurement of two non-commuting observables within the same framework does not send the system to an eigenstate. Instead, the probability density function describing the reduced density matrix of the system becomes stationary over a continuum of pure states, a situation characterised by zero further stochastic entropy production. Transitions between such stationary states, brought about by changes in the relative strengths of the two measurement processes, give rise to finite positive mean stochastic entropy production. The framework investigated can offer useful perspectives on both the dynamics and irreversible thermodynamics of measurement in quantum systems. Full article

This article considers arrowhead and diagonal-plus-rank-one matrices in ${\mathbb{F}}^{n\times n}$ where $\mathbb{F}\in \{\mathbb{R},\mathbb{C},\mathbb{H}\}$ and where $\mathbb{H}$ is a noncommutative algebra of quaternions. We provide unified formulas for fast determinants and inverses for considered matrices. The formulas are unified in the sense that the same formula holds in both commutative and noncommutative associative fields or algebras, with noncommutative examples being matrices of quaternions and block matrices. Each formula requires $O\left(n\right)$ arithmetic operations, as does multiplication of such matrices with a vector. The formulas are efficiently implemented using the polymorphism or multiple-dispatch feature of the Julia programming language. Full article

In the Standard Model, ad hoc hypotheses assume the existence of three generations of point-like leptons and quarks, which possess a point-like structure and follow the Dirac equation involving four anti-commutative matrices. In this work, we consider the sedenion hypercomplex algebra as an extension of the Standard Model and show its close link to SU(5), which is the underlying symmetry group for the grand unification theory (GUT). We first consider the direct-product quaternion model and the eight-element octonion algebra model. We show that neither the associative quaternion model nor the non-associative octonion model could generate three fermion generations. Instead, we show that the sedenion model, which contains three octonion sub-algebras, leads naturally to precisely three fermion generations. Moreover, we demonstrate the use of basis sedenion operators to construct twenty-four 5 × 5 generalized lambda matrices representing SU(5) generators, in analogy to the use of octonion basis operators to generate Gell-Mann’s eight 3 × 3 lambda-matrix generators for SU(3). Thus, we provide a link between the sedenion algebra and Georgi and Glashow’s SU(5) GUT model that unifies the electroweak and strong interactions for the Standard Model’s elementary particles, which obey SU(3)$\otimes$SU(2)$\otimes$U(1) symmetry. Full article