syzextra.h File Reference

#include <vector>
#include <map>
#include <string.h>
#include <stack>
#include "singularxx_defs.h"
#include "kernel/ideals.h"

Go to the source code of this file.

Data Structures
class	SBucketFactory
struct	SchreyerSyzygyComputationFlags
	Computation attribute storage. More...
class	CLCM
class	CLeadingTerm
class	CReducerFinder
struct	CCacheCompare
class	SchreyerSyzygyComputation

Macros
#define	NOPRODUCT   1
#define	NODIVISION   1

Typedefs
typedef idrec *	idhdl
typedef kBucket *	kBucket_pt
typedef sBucket *	sBucket_pt
typedef poly	TCacheKey
typedef poly	TCacheValue
typedef std::map< TCacheKey, TCacheValue, CCacheCompare >	TP2PCache
typedef std::map< int, TP2PCache >	TCache

Functions
poly	leadmonom (const poly p, const ring r, const bool bSetZeroComp=true)
	return a new term: leading coeff * leading monomial of p with 0 leading component! More...
poly	p_Tail (const poly p, const ring r)
	return the tail of a given polynomial or vector returns NULL if input is NULL, otherwise the result is a new polynomial/vector in the ring r More...
ideal	id_Tail (const ideal id, const ring r)
	return the tail of a given ideal or module returns NULL if input is NULL, otherwise the result is a new ideal/module in the ring r NOTE: the resulting rank is autocorrected More...
void	Sort_c_ds (const ideal id, const ring r)
	inplace sorting of the module (ideal) id wrt <_(c,ds) More...
bool	my_p_LmCmp (poly, poly, const ring)
static void	ComputeSyzygy (const ideal L, const ideal T, ideal &LL, ideal &TT, const SchreyerSyzygyComputationFlags A)
static ideal	ComputeLeadingSyzygyTerms (const ideal &L, const SchreyerSyzygyComputationFlags A)
static ideal	Compute2LeadingSyzygyTerms (const ideal &L, const SchreyerSyzygyComputationFlags A)
static poly	FindReducer (poly product, poly syzterm, ideal L, ideal LS, const SchreyerSyzygyComputationFlags A)
static poly	TraverseTail (poly multiplier, poly tail, ideal L, ideal T, ideal LS, const SchreyerSyzygyComputationFlags A)
static poly	ReduceTerm (poly multiplier, poly term4reduction, poly syztermCheck, ideal L, ideal T, ideal LS, const SchreyerSyzygyComputationFlags A)
static poly	SchreyerSyzygyNF (poly syz_lead, poly syz_2, ideal L, ideal T, ideal LS, const SchreyerSyzygyComputationFlags A)

Detailed Description

Computation of Syzygies

ABSTRACT: Computation of Syzygies due to Schreyer

Author

Oleksandr Motsak

Definition in file syzextra.h.

Macro Definition Documentation

NODIVISION

#define NODIVISION   1

Definition at line 39 of file syzextra.h.

NOPRODUCT

#define NOPRODUCT   1

Definition at line 33 of file syzextra.h.

Typedef Documentation

idhdl

typedef idrec* idhdl

Definition at line 28 of file syzextra.h.

kBucket_pt

typedef kBucket* kBucket_pt

Definition at line 30 of file syzextra.h.

sBucket_pt

typedef sBucket* sBucket_pt

Definition at line 60 of file syzextra.h.

TCache

typedef std::map<int, TP2PCache> TCache

Definition at line 334 of file syzextra.h.

TCacheKey

typedef poly TCacheKey

Definition at line 316 of file syzextra.h.

TCacheValue

typedef poly TCacheValue

Definition at line 317 of file syzextra.h.

TP2PCache

typedef std::map<TCacheKey, TCacheValue, CCacheCompare> TP2PCache

Definition at line 333 of file syzextra.h.

Function Documentation

Compute2LeadingSyzygyTerms()

static ideal Compute2LeadingSyzygyTerms ( const ideal &  L, const SchreyerSyzygyComputationFlags  A  )

inlinestatic

Definition at line 518 of file syzextra.h.

{
  SchreyerSyzygyComputation syz(L, NULL, A);
  syz.ComputeLeadingSyzygyTerms(true);
  ideal LL, TT;
  syz.ReadOffResult(LL, TT);
  return LL; // assume TT is NULL!
}

ComputeLeadingSyzygyTerms()

static ideal ComputeLeadingSyzygyTerms ( const ideal &  L, const SchreyerSyzygyComputationFlags  A  )

inlinestatic

Definition at line 509 of file syzextra.h.

{
  SchreyerSyzygyComputation syz(L, NULL, A);
  syz.ComputeLeadingSyzygyTerms(false);
  ideal LL, TT;
  syz.ReadOffResult(LL, TT);
  return LL; // assume TT is NULL!
}

ComputeSyzygy()

static void ComputeSyzygy ( const ideal  L, const ideal  T, ideal &  LL, ideal &  TT, const SchreyerSyzygyComputationFlags  A  )

inlinestatic

Definition at line 502 of file syzextra.h.

{
  SchreyerSyzygyComputation syz(L, T, A);
  syz.ComputeSyzygy();
  syz.ReadOffResult(LL, TT);
}

FindReducer()

static poly FindReducer ( poly  product, poly  syzterm, ideal  L, ideal  LS, const SchreyerSyzygyComputationFlags  A  )

inlinestatic

Definition at line 527 of file syzextra.h.

{
  SchreyerSyzygyComputation syz(L, NULL, LS, A);
  return syz._FindReducer(product, syzterm);
}

id_Tail()

ideal id_Tail	(	const ideal	id,
		const ring	r
	)

return the tail of a given ideal or module returns NULL if input is NULL, otherwise the result is a new ideal/module in the ring r NOTE: the resulting rank is autocorrected

Definition at line 325 of file syzextra.cc.

{
  if( UNLIKELY(id == NULL) )
    return NULL;
 
  const ideal newid = idInit(IDELEMS(id),id->rank);
 
  for (int i=IDELEMS(id) - 1; i >= 0; i--)
    newid->m[i] = p_Tail( id->m[i], r );
 
  newid->rank = id_RankFreeModule(newid, currRing);
 
  return newid;
}

leadmonom()

poly leadmonom	(	const poly	p,
		const ring	r,
		const bool	bSetZeroComp = true
	)

return a new term: leading coeff * leading monomial of p with 0 leading component!

Definition at line 288 of file syzextra.cc.

{
  if( UNLIKELY(p == NULL ) )
     return NULL;
 
    assume( p != NULL );
    p_LmTest(p, r);
 
    poly m = p_LmInit(p, r);
    p_SetCoeff0(m, n_Copy(pGetCoeff(p), r->cf), r);
 
    if( bSetZeroComp )
      p_SetComp(m, 0, r);
 
    p_Setm(m, r);
 
    assume( m != NULL );
    assume( pNext(m) == NULL );
    p_LmTest(m, r);
 
    if( bSetZeroComp )
      assume( p_GetComp(m, r) == 0 );
 
  return m;
}

my_p_LmCmp()

bool my_p_LmCmp	(	poly	,
		poly	,
		const	ring
	)

Definition at line 1140 of file syzextra.cc.

{ return p_LmCmp(a, b, r) == -1; } // TODO: change to simple lex. memory compare!

p_Tail()

poly p_Tail	(	const poly	p,
		const ring	r
	)

return the tail of a given polynomial or vector returns NULL if input is NULL, otherwise the result is a new polynomial/vector in the ring r

Definition at line 316 of file syzextra.cc.

{
  if( UNLIKELY(p == NULL) )
    return NULL;
  else
    return p_Copy( pNext(p), r );
}

ReduceTerm()

static poly ReduceTerm ( poly  multiplier, poly  term4reduction, poly  syztermCheck, ideal  L, ideal  T, ideal  LS, const SchreyerSyzygyComputationFlags  A  )

inlinestatic

Definition at line 541 of file syzextra.h.

{
  SchreyerSyzygyComputation syz(L, T, LS, A);
  return syz.ReduceTerm(multiplier, term4reduction, syztermCheck);
}

SchreyerSyzygyNF()

static poly SchreyerSyzygyNF ( poly  syz_lead, poly  syz_2, ideal  L, ideal  T, ideal  LS, const SchreyerSyzygyComputationFlags  A  )

inlinestatic

Definition at line 549 of file syzextra.h.

{
  SchreyerSyzygyComputation syz(L, T, LS, A);
  return syz.SchreyerSyzygyNF(syz_lead, syz_2);
}

Sort_c_ds()

void Sort_c_ds	(	const ideal	id,
		const ring	r
	)

inplace sorting of the module (ideal) id wrt <_(c,ds)

Definition at line 342 of file syzextra.cc.

{
  const int sizeNew = IDELEMS(id);
 
#if ( (defined(HAVE_QSORT_R)) && (defined __APPLE__ || defined __MACH__ || defined __DARWIN__ || defined __FreeBSD__ || defined __BSD__ || defined OpenBSD3_1 || defined OpenBSD3_9) )
#define qsort_my(m, s, ss, r, cmp) qsort_r(m, s, ss, r, cmp)
#elif ( (defined(HAVE_QSORT_R)) && (defined _GNU_SOURCE || defined __GNU__ || defined __linux__))
#define qsort_my(m, s, ss, r, cmp) qsort_r(m, s, ss, cmp, r)
#else
#define qsort_my(m, s, ss, r, cmp) qsort(m, s, ss, cmp)
#endif
 
  if( sizeNew >= 2 )
    qsort_my(id->m, sizeNew, sizeof(poly), r, FROM_NAMESPACE(SORT_c_ds, cmp_c_ds));
 
#undef qsort_my
 
  id->rank = id_RankFreeModule(id, r);
}

TraverseTail()

static poly TraverseTail ( poly  multiplier, poly  tail, ideal  L, ideal  T, ideal  LS, const SchreyerSyzygyComputationFlags  A  )

inlinestatic

Definition at line 534 of file syzextra.h.

{
  SchreyerSyzygyComputation syz(L, T, LS, A);
  return syz.TraverseTail(multiplier, tail);
}