All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 96

Showing per page

Polynomials over the reals in proofs of termination : from theory to practice

Salvador Lucas (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

This paper provides a framework to address termination problems in term rewriting by using orderings induced by algebras over the reals. The generation of such orderings is parameterized by concrete monotonicity requirements which are connected with different classes of termination problems: termination of rewriting, termination of rewriting by using dependency pairs, termination of innermost rewriting, top-termination of infinitary rewriting, termination of context-sensitive rewriting, etc. We...

Polynomials over the reals in proofs of termination : from theory to practice

Salvador Lucas (2010)

RAIRO - Theoretical Informatics and Applications

This paper provides a framework to address termination problems in term rewriting by using orderings induced by algebras over the reals. The generation of such orderings is parameterized by concrete monotonicity requirements which are connected with different classes of termination problems: termination of rewriting, termination of rewriting by using dependency pairs, termination of innermost rewriting, top-termination of infinitary rewriting, termination of context-sensitive rewriting, etc. We...

Positive characteristic analogs of closed polynomials

Piotr Jędrzejewicz (2011)

Open Mathematics

The notion of a closed polynomial over a field of zero characteristic was introduced by Nowicki and Nagata. In this paper we discuss possible ways to define an analog of this notion over fields of positive characteristic. We are mostly interested in conditions of maximality of the algebra generated by a polynomial in a respective family of rings. We also present a modification of the condition of integral closure and discuss a condition involving partial derivatives.

Prime rational functions

Omar Kihel, Jesse Larone (2015)

Acta Arithmetica

Let f(x) be a complex rational function. We study conditions under which f(x) cannot be written as the composition of two rational functions which are not units under the operation of function composition. In this case, we say that f(x) is prime. We give sufficient conditions for complex rational functions to be prime in terms of their degrees and their critical values, and we also derive some conditions for the case of complex polynomials.

Currently displaying 41 – 60 of 96