Safe Haskell | None |
---|---|
Language | Haskell2010 |
Rising and falling factorials
See https://en.wikipedia.org/wiki/Falling_and_rising_factorials
Synopsis
- risingFactorial :: Int -> Univariate Integer "x"
- fallingFactorial :: Int -> Univariate Integer "x"
- newtype RisingPoly coeff = RisingPoly {
- fromRisingPoly :: FreeMod coeff RisingF
- newtype FallingPoly coeff = FallingPoly {
- fromFallingPoly :: FreeMod coeff FallingF
- expandRisingPoly :: (KnownSymbol var, Typeable c, Eq c, Num c) => FreeMod c RisingF -> Univariate c var
- expandFallingPoly :: (KnownSymbol var, Typeable c, Eq c, Num c) => FreeMod c FallingF -> Univariate c var
- newtype RisingF = RF Int
- newtype FallingF = FF Int
- expandRisingFactorial :: (KnownSymbol var, Typeable c, Eq c, Num c) => RisingF -> Univariate c var
- expandFallingFactorial :: (KnownSymbol var, Typeable c, Eq c, Num c) => FallingF -> Univariate c var
- expandRisingFactorialZ :: RisingF -> Univariate Integer var
- expandFallingFactorialZ :: FallingF -> Univariate Integer var
Rising and Falling factorials
risingFactorial :: Int -> Univariate Integer "x" Source #
fallingFactorial :: Int -> Univariate Integer "x" Source #
Polynomials using rising or falling factorials as bases
newtype RisingPoly coeff Source #
Univariate polynomials using rising factorials as a basis function
RisingPoly | |
|
Instances
Eq coeff => Eq (RisingPoly coeff) Source # | |
Defined in Math.Algebra.Polynomial.Univariate.Pochhammer (==) :: RisingPoly coeff -> RisingPoly coeff -> Bool # (/=) :: RisingPoly coeff -> RisingPoly coeff -> Bool # | |
Show coeff => Show (RisingPoly coeff) Source # | |
Defined in Math.Algebra.Polynomial.Univariate.Pochhammer showsPrec :: Int -> RisingPoly coeff -> ShowS # show :: RisingPoly coeff -> String # showList :: [RisingPoly coeff] -> ShowS # |
newtype FallingPoly coeff Source #
Univariate polynomials using falling factorials as a basis function
FallingPoly | |
|
Instances
Eq coeff => Eq (FallingPoly coeff) Source # | |
Defined in Math.Algebra.Polynomial.Univariate.Pochhammer (==) :: FallingPoly coeff -> FallingPoly coeff -> Bool # (/=) :: FallingPoly coeff -> FallingPoly coeff -> Bool # | |
Show coeff => Show (FallingPoly coeff) Source # | |
Defined in Math.Algebra.Polynomial.Univariate.Pochhammer showsPrec :: Int -> FallingPoly coeff -> ShowS # show :: FallingPoly coeff -> String # showList :: [FallingPoly coeff] -> ShowS # |
expandRisingPoly :: (KnownSymbol var, Typeable c, Eq c, Num c) => FreeMod c RisingF -> Univariate c var Source #
expandFallingPoly :: (KnownSymbol var, Typeable c, Eq c, Num c) => FreeMod c FallingF -> Univariate c var Source #
Rising and falling factorial types
Rising factorial x^(k) = x(x+1)(x+2)...(x+k-1)
Falling factorial x_(k) = x(x-1)(x-2)...(x-k+1)
expandRisingFactorial :: (KnownSymbol var, Typeable c, Eq c, Num c) => RisingF -> Univariate c var Source #
expandFallingFactorial :: (KnownSymbol var, Typeable c, Eq c, Num c) => FallingF -> Univariate c var Source #
expandRisingFactorialZ :: RisingF -> Univariate Integer var Source #
expandFallingFactorialZ :: FallingF -> Univariate Integer var Source #