相关论文: A heuristic algorithm for computing the Poincar\'e…

An intrinsic description of the Hamilton-Cartan formalism for first-order Berezinian variational problems determined by a submersion of supermanifolds is given. This is achieved by studying the associated higher-order graded variational…

Tools of the intrinsic analysis on manifolds, helpful in solving the invariant inverse problem of the calculus of variations are being presented comprising a combined approach which consists in the simultaneous imposition of symmetry…

We use the Poincar\'e series method to compute gravity partition functions associated to SU(N) level 1 WZW models with arbitrarily large numbers of modular invariants. The result is an average over these invariants, with the weights being…

This paper deals with the problem of numerically computing the roots of polynomials $p_k(x)$, $k=1,2,\ldots$, of degree $n=2^k-1$ recursively defined by $p_1(x)=x+1$, $p_k(x)=xp_{k-1}(x)^2+1$. An algorithm based on the Ehrlich-Aberth…

We consider the algebra of invariants of binary forms of degree 10 with complex coefficients, construct a system of parameters with degrees 2, 4, 6, 6, 8, 9, 10, 14 and find the 106 basic invariants.

The bilinear combination of Dirac spinors $u(p_1,n_1)\bar u(p_2,n_2)$ is expressed in terms of Lorentz vectors in an explicit covariant form. The fact that the obtained expression involves only one auxiliary vector makes it very convenient…

We consider the mixed states of the bipartite quantum system with the first party a qubit and the second a qutrit. The group of local unitary transformations of the system, ignoring the overall phase factor, is the direct product G of SU(2)…

We describe a deterministic algorithm that computes an approximate root of n complex polynomial equations in n unknowns in average polynomial time with respect to the size of the input, in the Blum-Shub-Smale model with square root. It…

Using the methods of classical invariant theory a general approach to finding of identities for Bernulli, Euler and Hermite polynomials is proposed.

We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…

In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity…

We investigate the interplay between monomial first integrals, polynomial invariants of certain group action, and the Poincar\'{e}-Dulac normal forms for autonomous systems of ODEs with diagonal matrix of the linear part. Using tools from…

We consider the algebra of invariants of binary forms of degree 9 with complex coefficients, find the 92 basic invariants, give an explicit system of parameters and show the existence of four more systems of parameters with different sets…

We present a Lohner-type algorithm for rigorous integration of systems of Delay Differential Equations (DDEs) with multiple delays and its application in computation of Poincar\'e maps to study the dynamics of some bounded, eternal…

We investigate multi-graded Gorenstein semigroup algebras associated with an infinite family of reflexive lattice simplices. For each of these algebras, we prove that their multigraded Poincar\'e series is rational. Our method of proof is…

The multigraded Poincare-Betti series P_R^k(x_1,...,x_n; t) of a monomial ring k[x_1,...,x_n]/<M> on a finite number of monomial generators has the form (1+tx_1)(1+tx_2)...(1+tx_n)/b_(R,k)(x_1,...,x_n; t), where b_(R,k)(x_1,...,x_n;t) is a…

Our purpose is to investigate all defined Poincar\'e series associated with multi-index filtrations and value semigroups of curve singularities---not necessarily complex---with regard to the property of forgetting variables, i.e., by making…

The phase space of an integrable Hamiltonian system is foliated by invariant tori. For an arbitrary Hamiltonian H such a foliation may not exist, but we can artificially construct one through a parameterised family of surfaces, with the…

We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…

Let (N, G), where N is a normal subgroup of G<SL_n(C), be a pair of finite groups and V a finite-dimensional fundamental G-module. We study the G-invariants in the symmetric algebra S(V) by giving explicit formulas of the Poincar\'{e}…