Factorization of Z-homogeneous polynomials in the First (q)-Weyl Algebra

We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be almost completely reduced to commutative univariate factorization over the same base field with some additional uncomplicated combinatorial steps. This allows to deduce the complexity of our algorithms in detail. Furthermore, we will show for homogeneous polynomials that irreducibility in the polynomial first Weyl algebra also implies irreducibility in the rational one, which is of interest for practical reasons. We report on our implementation in the computer algebra system \textsc{Singular}. It outperforms for homogeneous polynomials currently available implementations dealing with factorization in the first Weyl algebra both in speed and elegancy of the results.Comment: 26 pages, Singular implementation, 2 algorithms, 1 figure, 2 table

Beyond series expansions: mathematical structures for the susceptibility of the square lattice Ising model

We first study the properties of the Fuchsian ordinary differential equations for the three and four-particle contributions $\chi^{(3)}$ and $\chi^{(4)}$ of the square lattice Ising model susceptibility. An analysis of some mathematical properties of these Fuchsian differential equations is sketched. For instance, we study the factorization properties of the corresponding linear differential operators, and consider the singularities of the three and four-particle contributions $\chi^{(3)}$ and $\chi^{(4)}$, versus the singularities of the associated Fuchsian ordinary differential equations, which actually exhibit new ``Landau-like'' singularities. We sketch the analysis of the corresponding differential Galois groups. In particular we provide a simple, but efficient, method to calculate the so-called ``connection matrices'' (between two neighboring singularities) and deduce the singular behaviors of $\chi^{(3)}$ and $\chi^{(4)}$. We provide a set of comments and speculations on the Fuchsian ordinary differential equations associated with the $n$-particle contributions $\chi^{(n)}$ and address the problem of the apparent discrepancy between such a holonomic approach and some scaling results deduced from a Painlev\'e oriented approach.Comment: 21 pages Proceedings of the Counting Complexity conferenc

Computation of formal fundamental solutions

AbstractA new proof for the existence of formal fundamental solutions of meromorphic systems of linear ordinary differential equations is given. The proof is presented in a totally constructive form. Moreover, we give a corresponding proof of existence for highest level formal solutions

Effective Scalar Products for D-finite Symmetric Functions

Many combinatorial generating functions can be expressed as combinations of symmetric functions, or extracted as sub-series and specializations from such combinations. Gessel has outlined a large class of symmetric functions for which the resulting generating functions are D-finite. We extend Gessel's work by providing algorithms that compute differential equations these generating functions satisfy in the case they are given as a scalar product of symmetric functions in Gessel's class. Examples of applications to k-regular graphs and Young tableaux with repeated entries are given. Asymptotic estimates are a natural application of our method, which we illustrate on the same model of Young tableaux. We also derive a seemingly new formula for the Kronecker product of the sum of Schur functions with itself.Comment: 51 pages, full paper version of FPSAC 02 extended abstract; v2: corrections from original submission, improved clarity; now formatted for journal + bibliograph