On Bounding Problems on Totally Ordered Commutative Semi-Groups

Abstract

The following is shown : Let S=\a1,a2,..,a2n\ be a subset of a totally ordered commutative semi-group (G,*,≤) with a1≤ a2≤...≤ a2n. Provided that a system of n aik * ajk\ (aik, ajk ∈ G ;\ 1 ≤ k ≤ n), where all 2n elements in S must be used, are less than an element N\ (∈ G), then a1*a2n, a2*a2n-1,..., an*an+1 are all less than N. This may be called the Upper Bounding Case. Moreover in the same way, we shall treat also the Lower Bounding Case.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…