Related papers: An algorithm for computing the canonical bases of …
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.…
This paper extends an algorithm and canonical embedding by Cauchon to a large class of quantum algebras. It applies to iterated Ore extensions over a field satisfying some suitable assumptions which cover those of Cauchon's original setting…
We introduce an algorithm that can be used to compute the canonical height of a point on an elliptic curve over the rationals in quasi-linear time. As in most previous algorithms, we decompose the difference between the canonical and the…
We describe an algorithm for computing the $p$-canonical basis of the Hecke algebra, or one of its antispherical modules. The algorithm does not operate in the Hecke category directly, but rather uses a faithful embedding of the Hecke…
We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-$k$ mosaic from incrementally constructed lower-order mosaics…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
We present a family of algorithms, combining real-space renormalization methods and belief propagation, to estimate the free energy of a topologically ordered system in the presence of defects. Such an algorithm is needed to preserve the…
We obtain some simple relations between decomposition numbers of quantized Schur algebras at an n-th root of unity (over a field of characteristic 0). These relations imply that every decomposition number for such an algebra occurs as a…
The canonical partition function approach was designed to avoid the overlap problem that affects the lattice simulations of nuclear matter at high density. The method employs the projections of the quark determinant on a fix quark number…
The direct method used for calculating smooth radial basis function (RBF) interpolants in the flat limit becomes numerically unstable. The RBF-QR algorithm bypasses this ill-conditioning using a clever change of basis technique. We extend…
We develop a systematic method for computing a renormalized light-front field theory Hamiltonian that can lead to bound states that rapidly converge in an expansion in free-particle Fock-space sectors. To accomplish this without dropping…
A general scheme for the wedge construction of q-deformed Fock spaces using the theory of perfect crystals is presented. Let $U_q(\g)$ be a quantum affine algebra. Let $V$ be a finite-dimensional $U'_q(\g)$-module with a perfect crystal…
We give algorithms of computing bases of logarithmic cohomology groups for square-free polynomials in two variables. (Fixed typos of v1)
A method is presented to obtain the canonical-form solutions of the HFB equation for atomic nuclei with zero-range interactions like the Skyrme force. It is appropriate to describe pairing correlations in the continuum in coordinate-space…
In recent years, differential equations have become the method of choice to compute multi-loop Feynman integrals. Whenever they can be cast into canonical form, their solution in terms of special functions is straightforward. Recently,…
We prove a base point free theorem for nef and log big divisors on log canonical surfaces.
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.
Starting from a differential equation for the unique field, the equation for the generating vector |V> of the n-point information (correlation and smeared functions) in the free Fock space is derived. In derived equation, due to appropriate…
The deterministic recursive pivot-free algorithms for the computation of generalized Bruhat decomposition of the matrix in the field and for the computation of the inverse matrix are presented. This method has the same complexity as…
In this paper, we develop a new deformation and generalization of the Natural integral transform based on the conformable fractional $q$-derivative. We obtain transformation of some deformed functions and apply the transform for solving…