Take a multiplicative monoid of sequences in which the multiplication is given by Hadamard product. The set of linear combinations of interleaving monoid elements then yields a ring. For hypergeometric sequences, the resulting ring is a subring of the ring of holonomic sequences. We present two algorithms in this setting: one for computing holonomic recurrence equations from hypergeometric-type normal forms and the other for finding products of hypergeometric-type terms. These are newly implemented commands in our Maple package $HyperTypeSeq$, available at \url{https://github.com/T3gu1a/HyperTypeSeq}, which we also describe.

翻译：考虑一个序列的乘法幺半群，其中乘法由哈达玛积给出。交错幺半群元素的线性组合集合构成一个环。对于超几何序列，所得环是整环序列环的子环。我们在该框架下提出两种算法：一种用于从超几何型正规形式计算整环递推方程，另一种用于寻找超几何型项的乘积。这些是我们Maple软件包$HyperTypeSeq$中新实现的命令（可通过\url{https://github.com/T3gu1a/HyperTypeSeq}获取），本文亦将对该软件包进行说明。