Related papers: Reducing the complexity for class group computatio…
This paper describes a simple method for estimating lower bounds on the number of classes of equivalence for a special kind of integer sequences, called division sequences. The method is based on adding group structure to classes of…
In subset selection we search for the best linear predictor that involves a small subset of variables. From a computational complexity viewpoint, subset selection is NP-hard and few classes are known to be solvable in polynomial time. Using…
The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right…
Nowadays there are several classes of constrained codes intended for different applications. The following two large classes can be distinguished. The first class contains codes with local constraints; for example, the source data must be…
Implicit computational complexity is a lively area of theoretical computer science, which aims to provide machine-independent characterizations of relevant complexity classes. % for uniformity with subsequent uses >> 1960s (but feel free to…
Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s)^{\ell} \oplus k(-2s+1)$, where $s \geq3$ and…
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 $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…
We prove a generalization of the Davenport-Heilbronn theorem to quotients of ideal class groups of quadratic fields by the primes lying above a fixed set of rational primes $S$. Additionally, we obtain average sizes for the relaxed Selmer…
We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…
A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…
We explicitly describe the defining relations for simple Lie algebra of vector fields with polynomial coefficients and its subalgebras of divergence free, hamiltonian and contact vector fields, and for the Poisson algebra (realized on…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
Polynomial reduction is one of the main tools in computational algebra with innumerable applications in many areas, both pure and applied. Since many years both the theory and an efficient design of the related algorithm have been solidly…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
We construct some families of quadratic fields whose class numbers are divisible by $3.$ The main tools used are a trinomial introduced by Kishi and a parametrization of Kishi and Miyake of a family of quadratic fields whose class numbers…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
Let $K$ be a totally real number field and let $B$ be a totally definite quaternion algebra over $K$. In this article, given a set of representatives for ideal classes for a maximal order in $B$, we show how to construct in an efficient way…
This paper focuses on the study of a mathematical program with equilibrium constraints, where the objective and the constraint functions are all polynomials. We present a method for finding its global minimizers and global minimum using a…