Related papers: Algebra, coalgebra, and minimization in polynomial…
Neural networks have the ability to serve as universal function approximators, but they are not interpretable and don't generalize well outside of their training region. Both of these issues are problematic when trying to apply standard…
We develop a theory of bicrystalline ideals, synthesizing Gr\"obner basis techniques and Kashiwara's crystal theory. This provides a unified algebraic, combinatorial, and computational approach that applies to ideals of interest, old and…
In this article we present a parallel modular algorithm to compute all solutions with multiplicities of a given zero-dimensional polynomial system of equations over the rationals. In fact, we compute a triangular decomposition using…
In this paper we investigate compatible overdetermined systems of PDEs on the plane with one common characteristic. Lie's theorem states that its integration is equivalent to a system of ODEs, and we relate this to the geometry of rank 2…
We consider a class of linear ODEs of second order with variable coefficients and construct its Lie algebra of Lie group of equivalence transformations. Further we find invariants and differential invariants of this Lie algebra and by using…
Consider a rational projective plane curve C parameterized by three homogeneous forms h1,h2,h3 of the same degree d in the polynomial ring R=k[x,y] over the field k. Extracting a common factor, we may harmlessly assume that the ideal…
The "bisimulation problem" for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the bisimulation problem for deterministic rational (vectors of) boolean series on the alphabet of a dpda M. We then…
We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…
Many physical systems are governed by ordinary or partial differential equations (see, for example, Chapter ''Differential equations'', ''System of Differential Equations''). Typically the solution of such systems are functions of time or…
All subalgebras, idempotents, left(right) ideals and left quasi-units of two-dimensional algebras are described. Classification of algebras with given number of subalgebras, left(right) ideals are provided. In particular, a list of…
This paper describes the notion of \sigma -symmetry, which extends the one of \lambda-symmetry, and its application to reduction procedures of systems of ordinary differential equations and of dynamical systems as well. We also consider…
Reactive systems \`a la Leifer and Milner, an abstract categorical framework for rewriting, provide a suitable framework for deriving bisimulation congruences. This is done by synthesizing interactions with the environment in order to…
Multi-indexed orthogonal polynomials describe eigenfunctions of exactly solvable shape-invariant quantum mechanical systems in one dimension obtained by the method of virtual states deletion. Multi-indexed orthogonal polynomials are labeled…
Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…
We use the theory of bialgebras to provide the algebraic background for state space realization theorems for input-output maps of control systems. This allows us to consider from a common viewpoint classical results about formal state space…
A subalgebra B of a Lie algebra L is called a c-ideal of L if there is an ideal C of L such that L = B + C and B \cap C \leq B_L, where B_L is the largest ideal of $L$ contained in B. This is analogous to the concept of c-normal subgroup,…
Quadratization refers to a transformation of an arbitrary system of polynomial ordinary differential equations to a system with at most quadratic right-hand side. Such a transformation unveils new variables and model structures that…
Formalising the pi-calculus is an illuminating test of the expressiveness of logical frameworks and mechanised metatheory systems, because of the presence of name binding, labelled transitions with name extrusion, bisimulation, and…
We discuss as a fundamental characteristic of orthogonal polynomials like the existence of a Lie algebra behind them, can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we put…
A general method based on the polynomial deformations of the Lie algebra sl(2,R) is proposed in order to exhibit the quasi-exactly solvability of specific Hamiltonians implied by quantum physical models. This method using the…