相关论文: A heuristic algorithm for computing the Poincar\'e…
An algebraic algorithm is developed for computation of invariants ('generalized Casimir operators') of general Lie algebras over the real or complex number field. Its main tools are the Cartan's method of moving frames and the knowledge of…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
We present how a probabilistic model can describe the asymptotic behaviour of the iterations, especially for ODE with an approach of the Poincar\'e-Bendixon's problem in $\mathbb{R}^d$. On pr\'esente un mod\`ele probabiliste pour d\'ecrire…
For Poincare series of binary polyhedral groups and Coxeter polynomials there are obtained statements close to the Euclid algorithm and orthogonal polynomials theory: generalized Ebeling formula, decompositions into ramified continued…
We present algorithms revealing new families of polynomials allowing sub-exponential detection of p-adic rational roots, relative to the sparse encoding. For instance, we show that the case of honest n-variate (n+1)-nomials is doable in NP…
We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm.
Toric ideals to hierarchical models are invariant under the action of a product of symmetric groups. Taking the number of factors, say m, into account, we introduce and study invariant filtrations and their equivariant Hilbert series. We…
Given a nonsingular $n \times n$ matrix of univariate polynomials over a field $\mathbb{K}$, we give fast and deterministic algorithms to compute its determinant and its Hermite normal form. Our algorithms use…
The arithmetic motivic Poincar\'e series of a variety $V$ defined over a field of characteristic zero, is an invariant of singularities which was introduced by Denef and Loeser by analogy with the Serre-Oesterl\'e series in arithmetic…
We consider the computation of two normal forms for matrices over the univariate polynomials: the Popov form and the Hermite form. For matrices which are square and nonsingular, deterministic algorithms with satisfactory cost bounds are…
In this note we give concise formulas, which lead to a simple and fast computer program that computes a powerful knot invariant. This invariant $\rho_1$ is not new, yet our formulas are by far the simplest and fastest: given a knot we write…
In this paper, we discuss the Poincar\'{e} series of Kac-Moody Lie algebras, especially for indefinite type. Firstly, we compute the Poincar\'{e} series of certain indefinite Kac-Moody Lie algebras whose Cartan matrices have the same type…
Analyzing and reasoning about safety properties of software systems becomes an especially challenging task for programs with complex flow and, in particular, with loops or recursion. For such programs one needs additional information, for…
We give an algorithm for reversion of formal power series, based on an efficient way to implement the Lagrange inversion formula. Our algorithm requires $O(n^{1/2}(M(n) + MM(n^{1/2})))$ operations where $M(n)$ and $MM(n)$ are the costs of…
We have general frameworks to obtain Poincare polynomials for Finite and also Affine types of Kac-Moody Lie algebras. Very little is known however beyond Affine ones, though we have a constructive theorem which can be applied both for…
We compute the Hilbert polynomial and the Poincare function counting the number of fixed jet-order differential invariants of conformal metric structures modulo local diffeomorphisms, and we describe the field of rational differential…
We explain how to obtain the set of solutions of a multivariate polynomial equation modulo a power of a prime number. These solutions are determined by a tree, called the trunk, which makes it possible to reconstruct all solutions. We apply…
The Poincare function is a compact form of counting moduli in local geometric problems. We discuss its property in relation to V.Arnold's conjecture, and derive this conjecture in the case when the pseudogroup acts algebraically and…
We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partition-backtracking graph software.…
In this article we study abstract and embedded invariants of reduced curve germs via topological techniques. One of the most important numerical analytic invariants of an abstract curve is its delta invariant. Our primary goal is to develop…