NDLI: Sparse Gröbner bases: the unmixed case

Please wait, while we are loading the content...

Mathematics by machine

Effective quantifier elimination for industrial applications

Sparse interpolation over finite fields via low-order roots of unity

Fuzzy simplification of non-numeric expressions containing some intervals and/or floating point numbers

How to develop a mobile computer algebra system

Multivariate sparse interpolation using randomized Kronecker substitutions

Maximum likelihood for matrices with rank constraints

Introduction to max-plus algebra

Computing the differential Galois group of a parameterized second-order linear differential equation

Algebraic complexity theory and matrix multiplication

A new deterministic algorithm for sparse multivariate polynomial interpolation

Gröbner bases of toric ideals and their application

A fast algorithm for computing the characteristic polynomial of the p-curvature

Symbolic-numeric algorithms for computing validated results

Computing necessary integrability conditions for planar parametrized homogeneous potentials

Improved algorithm for computing separating linear forms for bivariate systems

Solving higher order linear differential equations having elliptic function coefficients

Quantifier elimination by cylindrical algebraic decomposition based on regular chains

Parallel telescoping and parameterized Picard-Vessiot theory

A generalized Apagodu-Zeilberger algorithm

The asymptotic analysis of some interpolated nonlinear recurrence relations

Fast arithmetic for the algebraic closure of finite fields

On the computation of the topology of plane curves

Logspace computations in graph products

Essentially optimal interactive certificates in linear algebra

Root counts of semi-mixed systems, and an application to counting nash equilibria

Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation)

Sub-cubic change of ordering for Gröbner basis: a probabilistic approach

Sparse Gröbner bases: the unmixed case

The MMO problem

Factoring linear differential operators in n variables

Online order basis algorithm and its impact on the block Wiedemann algorithm

On isomorphisms of modules over non-commutative PID

Radical solutions of first order autonomous algebraic ordinary differential equations

Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach

Maximum likelihood geometry in the presence of data zeros

Constructing fewer open cells by GCD computation in CAD projection

An a posteriori certification algorithm for Newton homotopies

Evaluating parametric holonomic sequences using rectangular splitting

Equivariant lattice generators and Markov bases

Sparse polynomial interpolation codes and their decoding beyond half the minimum distance

Sparse multivariate function recovery with a high error rate in the evaluations

Bounds for D-finite closure properties

Powers of tensors and fast matrix multiplication

Reduction among bracket polynomials

Formal solutions of a class of Pfaffian systems in two variables

On the reduction of singularly-perturbed linear differential systems

High performance implementation of the TFT

Randomized detection of extraneous factors

Toric border basis

On efficient algorithms for computing parametric local cohomology classes associated with semi-quasihomogeneous singularities and standard bases

A near-optimal algorithm for computing real roots of sparse polynomials

LLL reducing with the most significant bits

Covering of surfaces parametrized without projective base points

Linear independence oracles and applications to rectangular and low rank linear systems

Cylindrical algebraic decomposition using local projections

Matrix-F5 algorithms over finite-precision complete discrete valuation fields

Faster relaxed multiplication

Unimodular completion of polynomial matrices

Tame decompositions and collisions

Sparse Gröbner bases: the unmixed case

Content Provider	ACM Digital Library
Author	Svartz, Jules Faugère, Jean-Charles Spaenlehauer, Pierre-Jean
Abstract	Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a semigroup algebra, i.e. an algebra generated by a subset of Laurent monomials. In order to solve symbolically sparse systems, we introduce sparse Gröbner bases, an analog of classical Gröbner bases for semigroup algebras, and we propose sparse variants of the $F_{5}$ and FGLM algorithms to compute them. Our prototype "proof-of-concept" implementation shows large speedups (more than 100 for some examples) compared to optimized (classical) Gröbner bases software. Moreover, in the case where the generating subset of monomials corresponds to the points with integer coordinates in a normal lattice polytope P ⊂ $R^{n}$ and under regularity assumptions, we prove complexity bounds which depend on the combinatorial properties of P. These bounds yield new estimates on the complexity of solving 0-dim systems where all polynomials share the same Newton polytope (unmixed case). For instance, we generalize the bound $min(n_{1},$ $n_{2})$ + 1 on the maximal degree in a Gröbner basis of a 0-dim. bilinear system with blocks of variables of sizes $(n_{1},$ $n_{2})$ to the multilinear case: Σ $n_{i}$ - $max(n_{i})$ + 1. We also propose a variant of Fröberg's conjecture which allows us to estimate the complexity of solving overdetermined sparse systems. Finally, our complexity results apply in the dense (usual) case and, as a surprising by-product, we prove that restrictive assumptions in usual complexity estimates of classical inhomogeneous Gröbner bases algorithms can be removed.
Starting Page	178
Ending Page	185
Page Count	8
File Format	PDF
ISBN	9781450325011
DOI	10.1145/2608628.2608663
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-07-23
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Gröbner bases f₅ algorithm Fglm Sparse polynomial systems Toric rings
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in