2014-02-06 00:38:15 +01:00
|
|
|
#
|
|
|
|
# spec file for package gap-gbnp
|
|
|
|
#
|
2022-07-16 22:10:15 +02:00
|
|
|
# Copyright (c) 2022 SUSE LLC
|
2014-02-06 00:38:15 +01:00
|
|
|
#
|
|
|
|
# All modifications and additions to the file contributed by third parties
|
|
|
|
# remain the property of their copyright owners, unless otherwise agreed
|
|
|
|
# upon. The license for this file, and modifications and additions to the
|
|
|
|
# file, is the same license as for the pristine package itself (unless the
|
|
|
|
# license for the pristine package is not an Open Source License, in which
|
|
|
|
# case the license is the MIT License). An "Open Source License" is a
|
|
|
|
# license that conforms to the Open Source Definition (Version 1.9)
|
|
|
|
# published by the Open Source Initiative.
|
|
|
|
|
|
|
|
# Please submit bugfixes or comments via http://bugs.opensuse.org/
|
|
|
|
#
|
|
|
|
|
|
|
|
|
|
|
|
Name: gap-gbnp
|
2022-07-16 22:10:15 +02:00
|
|
|
Version: 1.0.5
|
2014-02-06 00:38:15 +01:00
|
|
|
Release: 0
|
2022-07-16 22:10:15 +02:00
|
|
|
Summary: GAP: computing Gröbner bases of noncommutative polynomials
|
2014-02-06 00:38:15 +01:00
|
|
|
License: LGPL-2.1+
|
|
|
|
Group: Productivity/Scientific/Math
|
2022-07-16 22:10:15 +02:00
|
|
|
URL: https://gap-packages.github.io/gbnp/
|
2014-02-06 00:38:15 +01:00
|
|
|
|
2022-07-16 22:10:15 +02:00
|
|
|
Source: https://github.com/gap-packages/gbnp/releases/download/v%version/gbnp-%version.tar.gz
|
2014-02-06 00:38:15 +01:00
|
|
|
BuildArch: noarch
|
|
|
|
BuildRequires: fdupes
|
|
|
|
BuildRequires: gap-rpm-devel
|
|
|
|
Requires: gap-core >= 4.4
|
2022-07-16 22:10:15 +02:00
|
|
|
Requires: gap-gapdoc >= 1.5
|
2014-02-06 00:38:15 +01:00
|
|
|
|
|
|
|
%description
|
|
|
|
This package enhances GAP4 to support computing Gröbner bases of
|
|
|
|
non-commutative polynomials with coefficients from a field
|
|
|
|
implemented in GAP, and some variations, such as a weighted and
|
|
|
|
truncated version and a tracing facility.
|
|
|
|
|
|
|
|
The word algorithm is interpreted loosely: in general, one cannot
|
|
|
|
expect such an algorithm to terminate, as it would imply solvability
|
|
|
|
of the word problem for finitely presented (semi)groups.
|
|
|
|
|
|
|
|
%prep
|
2022-07-16 22:10:15 +02:00
|
|
|
%autosetup -n gbnp-%version -p1
|
2014-02-06 00:38:15 +01:00
|
|
|
|
|
|
|
%build
|
|
|
|
|
|
|
|
%install
|
2022-07-16 22:10:15 +02:00
|
|
|
find . -type f -name .depend -print -delete
|
2014-02-06 00:38:15 +01:00
|
|
|
%gappkg_simple_install
|
|
|
|
%fdupes %buildroot/%_prefix
|
|
|
|
|
|
|
|
%files -f %name.files
|
|
|
|
|
|
|
|
%changelog
|