相关论文: Again, Linearizable Mappings

We present a variational approach to a general Lienard-type equation in order to linearize it and, as an example, the Van der Pol oscillator is discussed. The new equation which is almost linear is factorized. The point symmetries of the…

A classification of discrete integrable systems on quad-graphs, i.e. on surface cell decompositions with quadrilateral faces, is given. The notion of integrability laid in the basis of the classification is the three-dimensional…

This paper is the first of a series in which we develop exact and approximate algorithms for mappings of systems of differential equations. Here we introduce the MapDE algorithm and its implementation in Maple, for mappings relating…

This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper…

This work focuses on the question of how identifiability of a mathematical model, that is, whether parameters can be recovered from data, is related to identifiability of its submodels. We look specifically at linear compartmental models…

The concept of viewing graph solvability has gained significant interest in the context of structure-from-motion. A viewing graph is a mathematical structure where nodes are associated to cameras and edges represent the epipolar geometry…

We discuss first order systems of rational difference equations which have the property that lines through the origin are mapped into lines through the origin. We call such systems projective systems of rational difference equations and we…

Planarity Testing is the problem of determining whether a given graph is planar while planar embedding is the corresponding construction problem. The bounded space complexity of these problems has been determined to be exactly Logspace by…

We study learning of indexed families from positive data where a learner can freely choose a hypothesis space (with uniformly decidable membership) comprising at least the languages to be learned. This abstracts a very universal learning…

This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of regions and a constant derivative assigned to each region in the…

Recently, integrability conditions (ICs) in mutistate Landau-Zener (MLZ) theory were proposed [1]. They describe common properties of all known solved systems with linearly time-dependent Hamiltonians. Here we show that ICs enable efficient…

This article presents an overview of the theory of integrable systems with symmetries, focusing on toric systems, semitoric systems, and their classifications via decorated polygons. We discuss certain one-parameter families of integrable…

Acquiring plausible pathways on high-dimensional structural distributions is beneficial in several domains. For example, in the drug discovery field, a protein conformational pathway, i.e. a highly probable sequence of protein structural…

In two previous papers, we exposed a combinatorial approach to the program of Geometry of Interaction, a program initiated by Jean-Yves Girard. The strength of our approach lies in the fact that we interpret proofs by simpler structures -…

Let $X,Y,Z$ and $W$ be normed spaces and $f:X\times Y\times Z\longrightarrow W $ be a bounded tri-linear mapping. In this Article, we define the topological centers for bounded tri-linear mapping and we invistagate thier properties. We…

It is shown that the 3-body trigonometric G_2 integrable system is exactly-solvable. If the configuration space is parametrized by certain symmetric functions of the coordinates then, for arbitrary values of the coupling constants, the…

This is the sixth in a series of papers constructing examples of special Lagrangian m-folds in C^m. We present a construction of special Lagrangian cones in C^3 involving two commuting o.d.e.s, motivated by the first two papers of the…

In this article we determine several theorems and methods for solving linear congruences and systems of linear congruences, and we find the number of distinct solutions. Many examples of solving congruences are given.

The parameters of a linear compartment model are usually estimated from experimental input-output data. A problem arises when infinitely many parameter values can yield the same result; such a model is called unidentifiable. In this case,…

The hierarchy of commuting maps related to a set-theoretical solution of the quantum Yang-Baxter equation (Yang-Baxter map) is introduced. They can be considered as dynamical analogues of the monodromy and/or transfer-matrices. The general…