19,620 research outputs found
Parallelization of Modular Algorithms
In this paper we investigate the parallelization of two modular algorithms.
In fact, we consider the modular computation of Gr\"obner bases (resp. standard
bases) and the modular computation of the associated primes of a
zero-dimensional ideal and describe their parallel implementation in SINGULAR.
Our modular algorithms to solve problems over Q mainly consist of three parts,
solving the problem modulo p for several primes p, lifting the result to Q by
applying Chinese remainder resp. rational reconstruction, and a part of
verification. Arnold proved using the Hilbert function that the verification
part in the modular algorithm to compute Gr\"obner bases can be simplified for
homogeneous ideals (cf. \cite{A03}). The idea of the proof could easily be
adapted to the local case, i.e. for local orderings and not necessarily
homogeneous ideals, using the Hilbert-Samuel function (cf. \cite{Pf07}). In
this paper we prove the corresponding theorem for non-homogeneous ideals in
case of a global ordering.Comment: 16 page
Fast Recognition of Partial Star Products and Quasi Cartesian Products
This paper is concerned with the fast computation of a relation on the
edge set of connected graphs that plays a decisive role in the recognition of
approximate Cartesian products, the weak reconstruction of Cartesian products,
and the recognition of Cartesian graph bundles with a triangle free basis.
A special case of is the relation , whose convex closure
yields the product relation that induces the prime factor
decomposition of connected graphs with respect to the Cartesian product. For
the construction of so-called Partial Star Products are of particular
interest. Several special data structures are used that allow to compute
Partial Star Products in constant time. These computations are tuned to the
recognition of approximate graph products, but also lead to a linear time
algorithm for the computation of for graphs with maximum bounded
degree.
Furthermore, we define \emph{quasi Cartesian products} as graphs with
non-trivial . We provide several examples, and show that quasi
Cartesian products can be recognized in linear time for graphs with bounded
maximum degree. Finally, we note that quasi products can be recognized in
sublinear time with a parallelized algorithm
- …