Related papers: Algorithmic reduction of Poincare'-Dulac normal fo…
Recent work in deep learning has opened new possibilities for solving classical algorithmic tasks using end-to-end learned models. In this work, we investigate the fundamental task of solving linear systems, particularly those that are…
In the classification of real singularities by Arnold et al. (1985), normal forms, as representatives of equivalence classes under right equivalence, are not always uniquely determined. We describe the complete structure of the equivalence…
Given a Dirac subbundle and an isotropic subbundle of a Courant algebroid, we provide a canonical method to obtain a new Dirac subbundle. When the original Dirac subbundle is involutive (i.e., a Dirac structure) this construction has…
Several issues concerning quantum kappa-Poincare algebra are discussed and reconsidered here. We propose two different formulations of kappa-Poincare quantum algebra. Firstly we present a complete Hopf algebra formulae of kappa-Poincare in…
Potential algebras can be used effectively in the analysis of the quantum systems. In the article, we focus on the systems described by a separable, 2x2 matrix Hamiltonian of the first order in derivatives. We find integrals of motion of…
We discuss a method for constructing multiplicative connections on proper Lie groupoids or, more exactly, for reducing the task of constructing such connections to a number of in principle simpler tasks involving only Lie groupoids that are…
The problem of representing a class of maps in a form suited for application of normal form methods is revisited. It is shown that using the methods of Lie series and of Lie transform a normal form algorithm is constructed in a…
We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
Let h \subset g be an inclusion of Lie algebras with quotient h-module n. There is a natural degree filtration on the h-module U(g)/U(g)h whose associated graded h-module is isomorphic to S(n). We give a necessary and sufficient condition…
In this paper we derive a Toeplitz-structured closed form of the unique positive semi-definite stabilizing solution for the discrete-time algebraic Riccati equations, especially for the case that the state matrix is not stable. Based on the…
We propose a new method to design adaptation algorithms that guarantee a certain prescribed level of performance and are applicable to systems with nonconvex parameterization. The main idea behind the method is, given the desired…
Ordinary differential equations of the first order on the torus have been investigated in detail by H. Poincar\'e and A. Denjoy. The long-standing problem of generalising these results for the equations of the order $k>1$ (or for the…
Subatomic systems were recently introduced to identify the structural principles underpinning the normalization of proofs. "Subatomic" means that we can reformulate logical systems in accordance with two principles. Their atomic formulas…
A class of two-dimensional systems of second-order ordinary differential equations is identified in which a system requires fewer Lie point symmetries than required to solve it. The procedure distinguishes among those which are…
By introducing an unconventional realization of the Poincare algebra alt_1 of special relativity as conformal transformations, we show how it may occur as a dynamical symmetry algebra for ageing systems in non-equilibrium statistical…
We construct integrable holomorphic G-structures and flat holomorphic Cartan geometries on every complex Hopf manifold, without using the normal forms given by the Poincar\'e-Dulac Theorem. We provide a new proof of the latter using charts…
The systematization of the purely Lagrangean approach to constrained systems in the form of an algorithm involves the iterative construction of a generalized Hessian matrix W taking a rectangular form. This Hessian will exhibit as many left…
Ill-posed linear inverse problems (ILIP), such as restoration and reconstruction, are a core topic of signal/image processing. A standard approach to deal with ILIP uses a constrained optimization problem, where a regularization function is…
We propose a heuristic algorithm for fast computation of the Poincar\'{e} series $P_n(t)$ of the invariants of binary forms of degree $n$, viewed as rational functions. The algorithm is based on certain polynomial identities which remain to…