scholarly journals Guaranteed Scoring Games

10.37236/5417 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Urban Larsson ◽  
Richard J. Nowakowski ◽  
João P. Neto ◽  
Carlos P. Santos
Keyword(s):  
Congruence Class ◽  
Order Relation ◽  
Combinatorial Games ◽  
Partially Ordered ◽  
Ordered Monoid ◽  
Partially Ordered Monoid ◽  
Congruence Classes

The class of Guaranteed Scoring Games (GS) are two-player combinatorial games with the property that Normal-play games (Conway et. al.) are ordered embedded into GS. They include, as subclasses, the scoring games considered by Milnor (1953), Ettinger (1996) and Johnson (2014). We present the structure of GS and the techniques needed to analyze a sum of guaranteed games. Firstly, GS form a partially ordered monoid, via defined Right- and Left-stops over the reals, and with disjunctive sum as the operation. In fact, the structure is a quotient monoid with partially ordered congruence classes. We show that there are four reductions that when applied, in any order, give a unique representative for each congruence class. The monoid is not a group, but in this paper we prove that if a game has an inverse it is obtained by 'switching the players'. The order relation between two games is defined by comparing their stops in any disjunctive sum. Here, we demonstrate how to compare the games via a finite algorithm instead, extending ideas of Ettinger, and also Siegel (2013).

Monoid based semantics for linear formulas

2001 ◽  
Vol 66 (4) ◽  
pp. 1597-1619 ◽  
Author(s):  
W. P. R. Mitchell ◽  
H. Simmons
Keyword(s):  
Ordered Group ◽  
Partially Ordered ◽  
Ordered Monoid ◽  
Partially Ordered Group ◽  
Girard Quantale ◽  
Partially Ordered Monoid

Abstract.Each Girard quantale (i.e., commutative quantale with a selected dualizing element) provides a support for a semantics for linear propositional formulas (but not for linear derivations). Several constructions of Girard quantales are known. We give two more constructions, one using an arbitrary partially ordered monoid and one using a partially ordered group (both commutative). In both cases the semantics can be controlled be a relation between pairs of elements of the support and formulas. This gives us a neat way of handling duality.

Monoid based semantics for linear formulas (corrected republication)

2002 ◽  
Vol 67 (2) ◽  
pp. 505-527
Author(s):  
W. P. R. Mitchell ◽  
H. Simmons
Keyword(s):  
Ordered Group ◽  
Partially Ordered ◽  
Ordered Monoid ◽  
Partially Ordered Group ◽  
Girard Quantale ◽  
Partially Ordered Monoid

AbstractEach Girard quantale (i.e., commutative quantale with a selected dualizing element) provides a support for a semantics for linear propositional formulas (but not for linear derivations). Several constructions of Girard quantales are known. We give two more constructions, one using an arbitrary partially ordered monoid and one using a partially ordered group (both commutative). In both cases the semantics can be controlled be a relation between pairs of elements of the support and formulas. This gives us a neat way of handling duality.

scholarly journals Examples of Pomonoids of Full Transformations of a Poset

2022 ◽  
pp. 1-4
Author(s):  
Bana Al Subaiei
Keyword(s):  
Partially Ordered ◽  
Ordered Monoid ◽  
Partially Ordered Monoid

In this research, the partially ordered monoid (simple pomonoid) full transformations of a poset O(X) is studied, and some related properties are examined. We show that when the poset X_ is not totally ordered, the pomonoid of all decreasing singular self-maps of a poset X_ (denoted by S^-) and the pomonoid of all increasing singular self-maps of a poset X_ (denoted by S^+) may not be generally isomorphic. Some specific partial ordered relations are considered, and the cardinalities of S^- and S^+ under these relations are found. The set of fixed, decreasing, and increasing points of mapping α in O(X) are also investigated. KEYWORDS Posets, pomonoids, full transformations

scholarly journals SUMS OF PRODUCTS OF CONGRUENCE CLASSES AND OF ARITHMETIC PROGRESSIONS

2009 ◽  
Vol 05 (04) ◽  
pp. 625-634
Author(s):  
SERGEI V. KONYAGIN ◽  
MELVYN B. NATHANSON
Keyword(s):  
Arithmetic Progression ◽  
Congruence Class ◽  
Arithmetic Progressions ◽  
Sum Of Products ◽  
Sums Of Products ◽  
Positive Integers ◽  
Congruence Classes

Consider the congruence class Rm(a) = {a + im : i ∈ Z} and the infinite arithmetic progression Pm(a) = {a + im : i ∈ N0}. For positive integers a,b,c,d,m the sum of products set Rm(a)Rm(b) + Rm(c)Rm(d) consists of all integers of the form (a+im) · (b+jm)+(c+km)(d+ℓm) for some i,j,k,ℓ ∈ Z. It is proved that if gcd (a,b,c,d,m) = 1, then Rm(a)Rm(b) + Rm(c)Rm(d) is equal to the congruence class Rm(ab+cd), and that the sum of products set Pm(a)Pm(b)+Pm(c)Pm eventually coincides with the infinite arithmetic progression Pm(ab+cd).

scholarly journals Congruence Class Sizes in Finite Sectionally Complemented Lattices

2004 ◽  
Vol 47 (2) ◽  
pp. 191-205 ◽  
Author(s):  
G. Grätzer ◽  
E. T. Schmidt
Keyword(s):  
Congruence Class ◽  
Typical Result ◽  
Complemented Lattices ◽  
The Family ◽  
Complemented Lattice ◽  
Congruence Classes

AbstractThe congruences of a finite sectionally complemented lattice L are not necessarily uniform (any two congruence classes of a congruence are of the same size). To measure how far a congruence Θ of L is from being uniform, we introduce Spec Θ, the spectrum of Θ, the family of cardinalities of the congruence classes of Θ. A typical result of this paper characterizes the spectrum S = (mj | j < n) of a nontrivial congruence Θ with the following two properties:

scholarly journals ACDC: Analysis of Congruent Diversification Classes

2022 ◽  
Author(s):  
Sebastian Hoehna ◽  
Bjoern Tore Kopperud ◽  
Andrew F Magee
Keyword(s):  
Congruence Class ◽  
R Package ◽  
Rate Function ◽  
Diversification Rate ◽  
Extinction Rate ◽  
Diversification Rates ◽  
Common Features ◽  
Alternative Hypotheses ◽  
Rate Functions ◽  
Congruence Classes

Diversification rates inferred from phylogenies are not identifiable. There are infinitely many combinations of speciation and extinction rate functions that have the exact same likelihood score for a given phylogeny, building a congruence class. The specific shape and characteristics of such congruence classes have not yet been studied. Whether speciation and extinction rate functions within a congruence class share common features is also not known. Instead of striving to make the diversification rates identifiable, we can embrace their inherent non-identifiable nature. We use two different approaches to explore a congruence class: (i) testing of specific alternative hypotheses, and (ii) randomly sampling alternative rate function within the congruence class. Our methods are implemented in the open-source R package ACDC (https://github.com/afmagee/ACDC). ACDC provides a flexible approach to explore the congruence class and provides summaries of rate functions within a congruence class. The summaries can highlight common trends, i.e. increasing, flat or decreasing rates. Although there are infinitely many equally likely diversification rate functions, these can share common features. ACDC can be used to assess if diversification rate patterns are robust despite non-identifiability. In our example, we clearly identify three phases of diversification rate changes that are common among all models in the congruence class. Thus, congruence classes are not necessarily a problem for studying historical patterns of biodiversity from phylogenies.

Sign in / Sign up

Export Citation Format

Share Document