Related papers: An Extension to an Algebraic Method for Linear Tim…
An intriguing interpretation of the time-evolution of dynamical systems is to view it as a computation that transforms an initial state to a final one. This paradigm has been explored in discrete systems such as cellular automata models,…
When a computer algebra system fails to solve an Ordinary Differential Equation, is this a limitation of its implementation, or a genuine computational barrier? Three traditions bear on the question. Modern computer algebra algorithms can…
$C_{\lambda}$-extended oscillator algebras generalizing the Calogero-Vasiliev algebra, where $C_{\lambda}$ is the cyclic group of order $\lambda$, are studied both from mathematical and applied viewpoints. Casimir operators of the algebras…
Linear algebraic primitives are at the core of many modern algorithms in engineering, science, and machine learning. Hence, accelerating these primitives with novel computing hardware would have tremendous economic impact. Quantum computing…
Part I of this paper embeds the AC power flow problem with voltage control and exponential load model in the complex plane. Modeling the action of network controllers that regulate the magnitude of voltage phasors is a challenging task in…
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…
A simple algorithm with quasi-linear time complexity and linear space complexity for the evaluation of the hypergeometric series with rational coefficients is constructed. It is shown that this algorithm is suitable in practical informatics…
String diagrams turn algebraic equations into topological moves that have recurring shapes, involving the sliding of one diagram past another. We individuate, at the root of this fact, the dual nature of polygraphs as presentations of…
Recently, we introduced the notion of flow (depending on time) of finite-dimensional algebras. A flow of algebras (FA) is a particular case of a continuous-time dynamical system whose states are finite-dimensional algebras with (cubic)…
Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space. We…
We derive certain systems of differential equations for matrix elements of products and iterates of logarithmic intertwining operators among strongly graded generalized modules for a strongly graded conformal vertex algebra under suitable…
A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the…
Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…
Inspired by code vertex operator algebras (VOAs) and their representation theory, we define code algebras, a new class of commutative non-associative algebras constructed from binary linear codes. Let $C$ be a binary linear code of length…
We introduce a new class of operator algebras -- tracially complete C*-algebras -- as a vehicle for transferring ideas and results between C*-algebras and their tracial von Neumann algebra completions. We obtain structure and classification…
We investigate a linear operator associated with a functional equation that arises from studying some class of invariant measures under multidimensional transformations. By examining its iterates, we derive an explicit solution formula for…
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems,…
We introduce a general tensor model suitable for data analytic tasks for {\em heterogeneous} datasets, wherein there are joint low-rank structures within groups of observations, but also discriminative structures across different groups. To…
In this paper we give a characterization of both Boolean and arithmetic circuit classes of logarithmic depth in the vein of descriptive complexity theory, i.e., the Boolean classes $\textrm{NC}^1$, $\textrm{SAC}^1$ and $\textrm{AC}^1$ as…
In this paper, the author present a reliable symbolic computational algorithm for inverting a general comrade matrix by using parallel computing along with recursion. The computational cost of our algorithm is O(n^2). The algorithm is…