36,089 research outputs found
Hierarchic Superposition Revisited
Many applications of automated deduction require reasoning in first-order
logic modulo background theories, in particular some form of integer
arithmetic. A major unsolved research challenge is to design theorem provers
that are "reasonably complete" even in the presence of free function symbols
ranging into a background theory sort. The hierarchic superposition calculus of
Bachmair, Ganzinger, and Waldmann already supports such symbols, but, as we
demonstrate, not optimally. This paper aims to rectify the situation by
introducing a novel form of clause abstraction, a core component in the
hierarchic superposition calculus for transforming clauses into a form needed
for internal operation. We argue for the benefits of the resulting calculus and
provide two new completeness results: one for the fragment where all
background-sorted terms are ground and another one for a special case of linear
(integer or rational) arithmetic as a background theory
Cyclic tridiagonal pairs, higher order Onsager algebras and orthogonal polynomials
The concept of cyclic tridiagonal pairs is introduced, and explicit examples
are given. For a fairly general class of cyclic tridiagonal pairs with
cyclicity N, we associate a pair of `divided polynomials'. The properties of
this pair generalize the ones of tridiagonal pairs of Racah type. The algebra
generated by the pair of divided polynomials is identified as a higher-order
generalization of the Onsager algebra. It can be viewed as a subalgebra of the
q-Onsager algebra for a proper specialization at q the primitive 2Nth root of
unity. Orthogonal polynomials beyond the Leonard duality are revisited in light
of this framework. In particular, certain second-order Dunkl shift operators
provide a realization of the divided polynomials at N=2 or q=i.Comment: 32 pages; v2: Appendices improved and extended, e.g. a proof of
irreducibility is added; v3: version for Linear Algebra and its Applications,
one assumption added in Appendix about eq. (A.2
Signature-Based Gr\"obner Basis Algorithms --- Extended MMM Algorithm for computing Gr\"obner bases
Signature-based algorithms is a popular kind of algorithms for computing
Gr\"obner bases, and many related papers have been published recently. In this
paper, no new signature-based algorithms and no new proofs are presented.
Instead, a view of signature-based algorithms is given, that is,
signature-based algorithms can be regarded as an extended version of the famous
MMM algorithm. By this view, this paper aims to give an easier way to
understand signature-based Gr\"obner basis algorithms
- …