Symbol -- the class of all symbols

Symbol -- the class of all symbols

The type Symbol is a member of the class Type. Each object of class Symbol is called a symbol.

Symbols are entered as an alphabetic character followed by a sequence of alphanumeric characters; case is significant. The single symbol character ' is regarded as alphabetic, so that symbols such as x' may be used.

Symbols are used as names for values to be preserved, as indeterminates in polynomial rings, and as keys in hash tables. They may have global scope, meaning they are visible from every line of code, or local scope, with visibility restricted to a single file or function body.

i1 : ab12345cde



o1 = ab12345cde



o1 : Symbol

See also:

symbolTable -- the global symbols

local -- get a local symbol

global -- get a global symbol

symbol -- get a symbol

:= -- assignment of method or new local variable

Methods for using a symbol :

assign(Symbol,Thing)

autoload(Symbol,String)

formatDocumentTag Symbol

peek2(Symbol,ZZ)

Symbol ? IndexedVariable

Symbol _ GeneralOrderedMonoid

Symbol _ Ring -- generator of a ring with a given name

toExternalString Symbol

toString Symbol

value Symbol -- evaluate a symbol

vars Symbol

Fixed objects of class Symbol :

Adjust -- adjust the multi-degree

AfterEval -- top level method applied after evaluation

AfterNoPrint -- top level method applied after not printing

AfterPrint -- top level method applied after printing

answer

argument -- specify the function in a scripted functor for an argument

Ascending

Assasinator

Associative

Bareiss

basefield

baseRings -- store the list of base rings of a ring

BasisElementLimit -- stop when this number of basis elements is obtained

Bayer -- use the method in Bayer's thesis

BeforePrint -- top level method applied before printing results

Binomial

blocks

cache

CallLimit

ChangeMatrix -- whether to produce the change of basis matrix

CHECKED

CodimensionLimit -- stop when this codimension is reached

Cofactor

CompleteIntersection -- provide a hint when computing a radical

Component

ConversionFormat -- convert to engine format

ConvertInteger -- convert an integer from engine format

ConvertMissing -- a missing engine conversion format item

ConvertReal

ConvertToExpression -- specify mehtod for converting to engine format

dd -- differential in a chain complex

Degree

DegreeLimit -- compute up to a certain degree

DegreeMap

DegreeOrder -- sort primarily by degree

Degrees -- specify the degrees

Descending -- specify descending order

EHV

Elimination -- compute the saturation by elimination

EliminationOrder -- use the natural elmination order in a pushForward1 computation

end -- stop loading a file

Engine -- specify whether a ring is handled by the engine

FindOne -- find a primitive element

First

fraclong

fractions

GBtype

generatorExpressions -- store the generators

generatorsTable

generatorSymbols -- store the symbols for the generators

GLex -- graded lexicographic ordering

GlobalAssignHook -- hook for assignment to global variables

GlobalReleaseHook

GRevLex -- reverse lexicographic ordering

GroupLex

GroupRevLex

HardDegreeLimit -- compute only up to this degree

Headline -- make a documentation Headline item

Homogeneous

incomparable -- a result indicating incomparability

Increment

indexComponents -- specify keys for components of a direct sum

Inhomogeneous

InverseMethod -- compute reciprocals

Inverses -- specify whether generators are invertible

Iterate -- use successive ideal quotients (the default)

LengthLimit -- stop when the resolution reaches this length

Lex -- lexicographic ordering

Limit -- specify how many to compute

Linear -- use the reverse lex order

LongPolynomial

MinimalGenerators

MinimalMatrix -- set the matrix of minimal generators

minPresMapInv

Monomial

MonomialOrder -- monomial ordering

MonomialSize -- specify maximum exponent size

Monomials -- whether to display the number of monomial

name -- store the name of a hash table

NCLex

newEngine

NewMonomialOrder

newvars

NonLinear -- use the algorithm which doesn't assume that the ring map is linear

nonUnit

NoPrint -- top level method for non-printing results

NOTCHECKED

Options

Order -- specify the order of a Hilbert series required

order -- a key used internally

PairLimit -- stop when this number of pairs is handled

PairsRemaining -- whether to display the number of S-pairs remaining

PDC

pending

poincareComputation -- store the Poincare polynomial computation

pop -- pop a value from the engine's stack

Primary

PrimitiveElement -- specify a primitive element

Print -- top level method for printing results

PrintLevel

Projective -- whether to produce a projective Hilbert polynomial

pruningMap -- store the isomorphism obtained by pruning

Repair -- repair the multi-degree

returnCode

RevLex -- reverse lexicographic ordering

rings

SingleArgumentDispatch

SkewCommutative -- make a skewcommutative (alternating) ring

Sort

SortStrategy -- specify a strategy for sorting S-pairs

StopBeforeComputation -- initialize but do not begin the computation

StopWithMinimalGenerators -- stop when minimal generators have been determined

storing

Strategy -- specify a computational strategy

SubringLimit -- stop after finding enough elements of a subring

subscript -- specify the function in a scripted functor for a subscript

superscript -- specify the function in a scripted functor for a superscript

SY

synonym

Synopsis

Syzygies -- whether to collect syzygies

SyzygyLimit -- stop when this number of syzygies is obtained

SyzygyMatrix -- set the syzygy matrix

SyzygyRows -- the number rows of the syzygy matrix to collect

TeXmacsEvaluate

todo

TotalPairs -- whether to display the total number of S-pairs

TypicalValue

Unmixed -- provide a hint when computing a radical

Usage

UseHilbertFunction

Variable -- specify a name for the generator of a Galois field

VariableBaseName -- base name for variables

VariableOrder

Variables -- specify the variable names

varsR2

Verify -- verify that a map is well-defined

Weights -- specify monomial ordering by weights

WeylAlgebra -- make a Weyl algebra