On bounding problems in totally ordered commutative semi-groups

MaRDI QIDQ2908638zbMATH OpenFDO

Authors Susumu Oda

Publication date 5 September 2012

Published in Journal for Algebra and Number Theory Academia (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.3820

zbMATH Keywords

ascending chainestimate problem

Mathematics Subject Classification ID

Elementary number theory (11A99) Diophantine inequalities (11D75)

Abstract: The following is shown : Let $S=a_1,a_2,\mathrm{..},a_{2n}$ be a subset of a totally ordered commutative semi-group $(G,\ast ,leq)$ with $a_{1}leq{a}_{2}leq\mathrm{...}leq{a}_{2n}$. Provided that a system of $n$ $a_{i_k}\ast a_{j_k}(a_{i_k},a_{j_k}inG;1leqkleqn)$, where all $2n$ elements in $S$ must be used, are less than an element $N(inG)$, then $a_1\ast a_{2n},a_2\ast a_{2n-1},\mathrm{...},a_n\ast a_{n+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.

Recommendations

• Small doubling in ordered semigroups.
• scientific article; zbMATH DE number 4144040
• Structure of ordered semirings
• scientific article; zbMATH DE number 3943883
• On the additive semigroup of ordered semirings

Cited in

(3)

• Pre-c-symplectic condition for the product of odd-spheres
• Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
• Sums and products of intervals in ordered semigroups

This page was built for publication: On bounding problems in totally ordered commutative semi-groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908638)