Related papers: Linearization through symmetries for discrete equa…
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebraic curve, implicitly defined, and to check whether or not two given implicit planar algebraic curves are similar, i.e. equal up to a…
We consider systems, which conserve the particle number and are described by Schr\"odinger equations containing complex nonlinearities. In the case of canonical systems, we study their main symmetries and conservation laws. We introduce a…
Whereas Lie had linearized scalar second order ordinary differential equations (ODEs) by point transformations and later Chern had extended to the third order by using contact transformation, till recently no work had been done for higher…
In this set of papers we formulate a stand alone method to derive maximal number of linearizing transformations for nonlinear ordinary differential equations (ODEs) of any order including coupled ones from a knowledge of fewer number of…
In this paper, the convergence of the solutions for a discretized linear state-based static peridynamic system to the corresponding continuous solution is analytically proven. To obtain an implementable model, we further apply…
Symmetry is an important feature of many constraint programs. We show that any problem symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each…
We develop a framework that systematically casts the solvability and uniqueness conditions of linearized geometric boundary-value problems into cohomological terms. The theory is designed to be applicable without assumptions on the…
The aim of this paper is twofold. First, we introduce a new class of linearizations, based on the generalization of a construction used in polynomial algebra to find the zeros of a system of (scalar) polynomial equations. We show that one…
We consider robust discrete minimization problems where uncertainty is defined by a convex set in the objective. We show how an integrality gap verifier for the linear programming relaxation of the non-robust version of the problem can be…
Linearizability has become the key correctness criterion for concurrent data structures, ensuring that histories of the concurrent object under consideration are consistent, where consistency is judged with respect to a sequential history…
Linear complementarity problems are a powerful tool for modeling many practically relevant situations such as market equilibria. They also connect many sub-areas of mathematics like game theory, optimization, and matrix theory. Despite…
Symmetry groups of PDEs allow to transform solutions continuously into other solutions. In this paper, we use this property for the observability analysis of nonlinear PDEs with input and output. Based on a differential-geometric…
We show how to use geometric arguments to prove that the terminal solution to a rough differential equation driven by a geometric rough path can be obtained by driving the same equation by a piecewise linear path. For this purpose, we…
The linearization problem by use of the Cartan equivalence method for scalar third-order ODEs via point transformations was solved partially in [1,2]. In order to solve this problem completely, the Cartan equivalence method is applied to…
A linear system of difference equations and a nonlinear perturbation are considered. We propose sufficient conditions to ensure that the homeomorphism of topological equivalence between them is actually a $C^1$ diffeomorphism. These…
We study the scalar modes of linear perturbations in loop quantum cosmology. This is done on a lattice where each cell is taken to be homogeneous and isotropic and can be quantized via standard homogeneous loop quantum cosmology techniques.…
Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in…
This paper proposes a verification method for sparse linear systems $Ax=b$ with general and nonsingular coefficients. A verification method produces the error bound for a given approximate solution. Conventional methods use one of two…
Below, the explicit solution to a certain finite-difference equation is given and the required steps for derivation of these results are outlined. Everything is included as Mathematica formulae, so the notebook itself can be used for…
We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…