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

In this paper, an exact algorithm in polynomial time is developed to solve unrestricted binary quadratic programs. The computational complexity is $O\left( n^{\frac{15}{2}}\right) $, although very conservative, it is sufficient to prove…

We continue the analysis of modular invariant functions, subject to inhomogeneous Laplace eigenvalue equations, that were determined in terms of Poincar\'e series in a companion paper. The source term of the Laplace equation is a product of…

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…

The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…

Many invariants of finitely generated positive cancelative commutative semigroups can be studied from their Poincar\'e series. We offer and present several closed formulas for them. Moreover, those formulas have elementary proofs and are…

We investigate a formulation of Poincar\'e invariant quantum mechanics where the dynamical input is Euclidean invariant Green functions or their generating functional. We argue that within this framework it is possible to calculate…

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

In this survey one discusses the notion of the Poincar\'e series of multi-index filtrations, an alternative approach to the definition, a method of computation of the Poincar\'e series based on the notion of integration with respect to the…

In [Trace identities and $\bf {Z}/2\bf {Z}$-graded invariants, {\it Trans. Amer. Math. Soc. \bf309} (1988), 581--589] we generalized the first and second fundamental theorems of invariant theory from the general linear group to the general…

We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…

Poincare return maps are a fundamental tool for analyzing periodic orbits in hybrid dynamical systems, including legged locomotion, power electronics, and other cyber-physical systems with switching behavior. The Poincare return map…

We present an algorithm which takes as input a closed semi-algebraic set, $S \subset \R^k$, defined by \[ P_1 \leq 0, ..., P_\ell \leq 0, P_i \in \R[X_1,...,X_k], \deg(P_i) \leq 2, \] and computes the Euler-Poincar\'e characteristic of $S$.…

Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…

We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

We offer a new approach to a definition of an equivariant version of the Poincar\'e series. This Poincar\'e series is defined not as a power series, but as an element of the Grothendieck ring of $G$-sets with an additional structure. We…

We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…

We compute explicit formulas for the curvature operators and Poincar\'e polynomials of all compact irreducible symmetric spaces. We can easily derive the Poincar\'e polynomials using quantum numbers, giving a formula that mirrors the known…

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…

There are two ways to compute Poincar\'e-Dulac normal forms of systems of ODEs. Under the original approach used by Poincar\'e the normalizing transformation is explicitly computed. On each step, the normalizing procedure requires the…