normaliz-3.11.1-1.2 RPM for x86_64

From OpenSuSE Tumbleweed for x86_64

Normaliz is a tool for computations in affine monoids, vector configurations,
lattice polytopes, and rational cones. It supports,

* convex hulls and dual cones
* conversion from generators to constraints and vice versa
* triangulations, disjoint decompositions and Stanley decompositions
* Hilbert basis of rational, not necessarily pointed cones
* normalization of affine monoids
* lattice points of rational polytopes and (unbounded) polyhedra
* Hilbert (or Ehrhart) series and (quasi) polynomials under
  Z-gradings (for example, for rational polytopes)
* generalized (or weighted) Ehrhart series and Lebesgue integrals of
  polynomials over rational polytopes via NmzIntegrate

Provides

• normaliz
• normaliz(x86-64)

Requires

• libc.so.6()(64bit)
• libc.so.6(GLIBC_2.14)(64bit)
• libc.so.6(GLIBC_2.2.5)(64bit)
• libc.so.6(GLIBC_2.34)(64bit)
• libc.so.6(GLIBC_2.4)(64bit)
• libeanticxx.so.3()(64bit)
• libgcc_s.so.1()(64bit)
• libgcc_s.so.1(GCC_3.0)(64bit)
• libgcc_s.so.1(GCC_3.3.1)(64bit)
• libgmp.so.10()(64bit)
• libnormaliz.so.3()(64bit)
• libstdc++.so.6()(64bit)
• libstdc++.so.6(CXXABI_1.3)(64bit)
• libstdc++.so.6(CXXABI_1.3.9)(64bit)
• libstdc++.so.6(GLIBCXX_3.4)(64bit)
• libstdc++.so.6(GLIBCXX_3.4.11)(64bit)
• libstdc++.so.6(GLIBCXX_3.4.21)(64bit)
• libstdc++.so.6(GLIBCXX_3.4.32)(64bit)
• libstdc++.so.6(GLIBCXX_3.4.9)(64bit)
• rpmlib(CompressedFileNames) <= 3.0.4-1
• rpmlib(FileDigests) <= 4.6.0-1
• rpmlib(PayloadFilesHavePrefix) <= 4.0-1
• rpmlib(PayloadIsZstd) <= 5.4.18-1

License

GPL-3.0-or-later

Changelog

* Mon Feb 02 2026 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.11.1
    * This release realizes the full functionality also for
      non-integral fusion rings. In particular it is now possible to
      compute induction matrices. Moreover all computations are
      substantially accelerated by running them over the integers.
* Sun Oct 19 2025 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.11.0
    * A rearrangement of the constructor/compute interplay has made
      it possible to insert certain boolean valued options after the
      constructor.
    * Fixed a bug (#439) in the evaluation of subdivided simplices.
    * Fixed a bug (#440) with exported triangulations.
    * The potential problems on i386 systems caused by floating point
      computations should have been resolved.
* Wed Jun 04 2025 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.10.5
    * The option ExploitAutomsVectors has been activated. It uses the
      automorphism group for the computation of Hilbert bases and
      lattice points.
    * The interface for fusion rings has been extended by the
      computation of induction matrices also for noncommutative
      fusion rings of rank <= 8.
    * The options NoQuasiPolynomial and OnlyCyclotomicHilbSe are
      useful especially for file based interfaces by providing
      compact output files.
    * The computation of minimal Markov bases contained a bug.
* Mon Oct 07 2024 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.10.4
    * Added induction matrices and tests for ring homomorphisms to
      the fusion ring solver.
* Wed May 29 2024 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.10.3
    * Computation goals for SingleFusionRing and ModularGradings.
    * Implement algorithmic variant UseModularGrading.
* Fri Mar 01 2024 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.10.2
    * Special input types and computation goals for fusion rings
    * Refined management of computations on an HPC for the patching
      version of project-and-lift algorithm for lattice points
      (used for fusion rings)
    * Processing of lists of input files
    * Orbit versions of (dual) face lattice and f-vector
    * Full implementation of SingleLatticePoint
  - Delete 0001-Add-FLINT-3-support.patch (fixed upstream)
* Sat Dec 23 2023 Jan Engelhardt <jengelh@inai.de>
  - Add 0001-Add-FLINT-3-support.patch
* Wed Jun 28 2023 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.10.1
    * Improved the patching variant of the project-and-lift
      algorithm for lattice points in polytopes.
* Tue Jan 31 2023 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.10.0
    * This release adds general affine monoids and binomial ideals
      to Normaliz. In particular, it computes:
    * minimal systems of generators (Hilbert bases) of affine monoids
    * Hilbert series of affine monoids
    * singular loci of affine monoid algebras
    * Markov and Gröbner bases of lattice ideals
    * affine monoids from binomial ideals
* Wed Dec 21 2022 Jan Engelhardt <jengelh@inai.de>
  - normaliz-devel needs e-antic-devel for headers.

Files

/usr/bin/normaliz
/usr/share/doc/packages/normaliz
/usr/share/doc/packages/normaliz/NmzShortRef.pdf
/usr/share/doc/packages/normaliz/Normaliz.pdf
/usr/share/licenses/normaliz
/usr/share/licenses/normaliz/COPYING

Generated by rpm2html 1.8.1

Fabrice Bellet, Tue Apr 21 22:32:08 2026