Variations on a game of Gale (III): remainder strategies

1997 ◽  
Vol 62 (4) ◽  
pp. 1253-1264 ◽  
Author(s):  
Marion Scheepers ◽  
William Weiss
Keyword(s):  
Positive Integer ◽  
Finite Subset ◽  
Winning Strategy ◽  
Finite Set ◽  
Image Position ◽  
Infinite Set

An infinite set X is given. D. Gale, in correspondence with J. Mycielski, described the following game in which players one and two play an inning per positive integer: In the nth inning one chooses a finite subset Xn of X, and two chooses a point xn from (X1∪ … ∪Xn)\{x1,…,xn−1}. A playis won by two if . Gale asked whether two could have a winning strategy which depends for each n on knowledge of only the contents of the setIn mathematical terms, is there a function F defined on the collection of finite subsets of X such that:for every sequence X1, x1, …, Xn, xn,…. where each Xn is a finite subsetof X and for each nwe have We shall call a strategy of this sort a remainder strategy for two. If there is some finite subset U of X such that F(U) ∉ U, then F cannot be a winning remainder strategy for two, because one can defeat F by choosing U each inning. So, when studying remainder strategies for two we may as well assume that for each finite set U ⊂ X, F(U) ∈ U.

Concerning n-tactics in the countable-finite game

1991 ◽  
Vol 56 (3) ◽  
pp. 786-794 ◽  
Author(s):  
Marion Scheepers
Keyword(s):  
Positive Integer ◽  
Set Theory ◽  
Winning Strategy ◽  
Perfect Information ◽  
Information Strategy ◽  
Finite Game ◽  
Finite Set ◽  
The Axiom Of Choice ◽  
Infinite Set ◽  
Special Case

In the paper [S1] I introduced a game, denoted by MG(J) (where J is a free ideal on some infinite set S) and called “the meager nowhere dense game for J”. The special case when J is the collection of finite subsets of the set S is called the countable-finite game on S. It proceeds as follows.First player ONE picks a countable set C1, then player TWO picks a finite set F1. Then in the second inning ONE picks a countable set C2 with C1 ⊂ C2 (unless explicitly indicated otherwise, “⊂” means “is a proper subset of”) and TWO responds with a finite set F2, and so on. The players construct a sequence (C1,F1,C2,F2,…,Ck,Fk,…) where for each positive integer k(i) Ck denotes ONE's countable set picked during the kth inning,(ii) Fk denotes TWO's finite set picked during the kth inning, and(iii) Ck ⊂ Ck + 1.Such a sequence is a play of the countable-finite game on S, and TWO wins this play if is contained in . The notion of a winning perfect information strategy is defined as usual (see, for example, [S1]). Zermelo-Fraenkel set theory together with the axiom of choice (denoted by ZFC; for a statement of the axioms see pp. xv–xvi of [K]) is a strong enough theory to build a winning perfect information strategy for player TWO in this game.Does TWO have a winning strategy requiring less than perfect information? Fix a positive integer k. A strategy of TWO which requires knowledge of only at the most the k most recent moves of ONE is said to be a k-tactic. For the countable-finite game on an infinite set S the following facts about the existence of winning k-tactics for TWO are proved in [S1]:1) TWO does not have a winning 1-tactic (Theorem 1 of [S1]).2) If the cardinality of S is less than ℵ2 then TWO has a winning 2-tactic (Corollary 4 of [S1]).3) If TWO has a winning k-tactic in the countable-finite game on an infinite set S, then TWO has a winning 3-tactic (Proposition 15 of [SI]).

A generalization of McDiarmid's theorem for mixed Bernoulli percolation

1980 ◽  
Vol 88 (1) ◽  
pp. 167-170 ◽  
Author(s):  
J. M. Hammersley
Keyword(s):  
Random Variables ◽  
Random Variable ◽  
Finite Sequence ◽  
Random Set ◽  
Percolation Probability ◽  
Open Path ◽  
Finite Set ◽  
Image Position ◽  
Infinite Set ◽  
Mutually Independent

Let G be an infinite partially directed graph of finite outgoing degree. Thus G consists of an infinite set of vertices, together with a set of edges between certain prescribed pairs of vertices. Each edge may be directed or undirected, and the number of edges from (but not necessarily to) any given vertex is always finite (though possibly unbounded). A path on G from a vertex V1 to a vertex Vn (if such a path exists) is a finite sequence of alternate edges and vertices of the form E12, V2, E23, V3, …, En − 1, n, Vn such that Ei, i + 1 is an edge connecting Vi and Vi + 1 (and in the direction from Vi to Vi + 1 if that edge happens to be directed). In mixed Bernoulli percolation, each vertex Vi carries a random variable di, and each edge Eij carries a random variable dij. All these random variables di and dij are mutually independent, and take only the values 0 or 1; the di take the value 1 with probability p, while the dij take the value 1 with probability p. A path is said to be open if and only if all the random variables carried by all its edges and all its vertices assume the value 1. Let S be a given finite set of vertices, called the source set; and let T be the set of all vertices such that there exists at least one open path from some vertex of S to each vertex of T. (We imagine that fluid, supplied to all the source vertices, can flow along any open path; and thus T is the random set of vertices eventually wetted by the fluid). The percolation probabilityis defined to be the probability that T is an infinite set.

scholarly journals The Divisibility of Divisor Functions

1961 ◽  
Vol 5 (1) ◽  
pp. 35-40 ◽  
Author(s):  
R. A. Rankin
Keyword(s):  
Positive Integer ◽  
Divisor Functions ◽  
Image Position ◽  
Positive Integers

For any positive integers n and v letwhere d runs through all the positive divisors of n. For each positive integer k and real x > 1, denote by N(v, k; x) the number of positive integers n ≦ x for which σv(n) is not divisible by k. Then Watson [6] has shown that, when v is odd,as x → ∞; it is assumed here and throughout that v and k are fixed and independent of x. It follows, in particular, that σ (n) is almost always divisible by k. A brief account of the ideas used by Watson will be found in § 10.6 of Hardy's book on Ramanujan [2].

Falconer's formula for the Hausdorff dimension of a self-affine set in R2

1995 ◽  
Vol 15 (1) ◽  
pp. 77-97 ◽  
Author(s):  
Irene Hueter ◽  
Steven P. Lalley
Keyword(s):  
Hausdorff Dimension ◽  
Dimensional Hausdorff Measure ◽  
Similarity Transformations ◽  
Affine Mappings ◽  
Finite Set ◽  
Self Similar ◽  
Image Position ◽  
Affine Set ◽  
Small Overlap ◽  
Box Dimensions

Let A1, A2,…,Ak be a finite set of contractive, affine, invertible self-mappings of R2. A compact subset Λ of R2 is said to be self-affine with affinitiesA1, A2,…,Ak ifIt is known [8] that for any such set of contractive affine mappings there is a unique (compact) SA set with these affinities. When the affine mappings A1, A2,…,Ak are similarity transformations, the set Λ is said to be self-similar. Self-similar sets are well understood, at least when the images Ai(Λ) have ‘small’ overlap: there is a simple and explicit formula for the Hausdorff and box dimensions [12, 10]; these are always equal; and the δ-dimensional Hausdorff measure of such a set (where δ is the Hausdorff dimension) is always positive and finite.

The Distribution Of Totatives

1955 ◽  
Vol 7 ◽  
pp. 347-357 ◽  
Author(s):  
D. H. Lehmer
Keyword(s):  
Positive Integer ◽  
Prime Factors ◽  
Image Position

This paper is concerned with the numbers which are relatively prime to a given positive integerwhere the p's are the distinct prime factors of n. Since these numbers recur periodically with period n, it suffices to study the ϕ(n) numbers ≤n and relatively prime to n.

scholarly journals An algebraically closed field

1968 ◽  
Vol 9 (2) ◽  
pp. 146-151 ◽  
Author(s):  
F. J. Rayner
Keyword(s):  
Positive Integer ◽  
Power Series ◽  
Formal Power Series ◽  
Characteristic Zero ◽  
Closed Field ◽  
Algebraically Closed Field ◽  
Zero Characteristic ◽  
Image Position ◽  
Formal Power ◽  
Puiseux Expansions

Letkbe any algebraically closed field, and denote byk((t)) the field of formal power series in one indeterminatetoverk. Letso thatKis the field of Puiseux expansions with coefficients ink(each element ofKis a formal power series intl/rfor some positive integerr). It is well-known thatKis algebraically closed if and only ifkis of characteristic zero [1, p. 61]. For examples relating to ramified extensions of fields with valuation [9, §6] it is useful to have a field analogous toKwhich is algebraically closed whenkhas non-zero characteristicp. In this paper, I prove that the setLof all formal power series of the form Σaitei(where (ei) is well-ordered,ei=mi|nprt,n∈ Ζ,mi∈ Ζ,ai∈k,ri∈ Ν) forms an algebraically closed field.

scholarly journals An Integral involving a Modified Bessel Function of the Second Kind and an E-function

1953 ◽  
Vol 1 (3) ◽  
pp. 119-120 ◽  
Author(s):  
Fouad M. Ragab
Keyword(s):  
Positive Integer ◽  
Bessel Function ◽  
Modified Bessel Function ◽  
Image Position

§ 1. Introductory. The formula to be established iswhere m is a positive integer,and the constants are such that the integral converges.

scholarly journals Categorical Functional Data Analysis. The cfda R Package

Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3074
Author(s):  
Cristian Preda ◽  
Quentin Grimonprez ◽  
Vincent Vandewalle
Keyword(s):  
Functional Data ◽  
Multiple Correspondence Analysis ◽  
Real Data ◽  
Jump Process ◽  
R Package ◽  
Finite Basis ◽  
Data Set ◽  
Stochastic Jump ◽  
Finite Set ◽  
Infinite Set

Categorical functional data represented by paths of a stochastic jump process with continuous time and a finite set of states are considered. As an extension of the multiple correspondence analysis to an infinite set of variables, optimal encodings of states over time are approximated using an arbitrary finite basis of functions. This allows dimension reduction, optimal representation, and visualisation of data in lower dimensional spaces. The methodology is implemented in the cfda R package and is illustrated using a real data set in the clustering framework.

scholarly journals Integrals involving products of modified Bessel functions of the second kind

1963 ◽  
Vol 6 (2) ◽  
pp. 70-74 ◽  
Author(s):  
F. M. Ragab
Keyword(s):  
Positive Integer ◽  
Bessel Functions ◽  
Modified Bessel Functions ◽  
Image Position

It is proposed to establish the two following integrals.where n is a positive integer, x is real and positive, μi and ν are complex, and Δ (n; a) represents the set of parameterswhere n is a positive integer and x is real and positive.

scholarly journals REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION

2017 ◽  
Vol 82 (2) ◽  
pp. 576-589 ◽  
Author(s):  
KOSTAS HATZIKIRIAKOU ◽  
STEPHEN G. SIMPSON
Keyword(s):  
Theorem Proving ◽  
Chain Condition ◽  
Reverse Mathematics ◽  
Partial Ordering ◽  
Young Diagrams ◽  
Equivalence Proof ◽  
Image Position ◽  
Countably Infinite ◽  
Infinite Set ◽  
Ascending Chain Condition

AbstractLetSbe the group of finitely supported permutations of a countably infinite set. Let$K[S]$be the group algebra ofSover a fieldKof characteristic 0. According to a theorem of Formanek and Lawrence,$K[S]$satisfies the ascending chain condition for two-sided ideals. We study the reverse mathematics of this theorem, proving its equivalence over$RC{A_0}$(or even over$RCA_0^{\rm{*}}$) to the statement that${\omega ^\omega }$is well ordered. Our equivalence proof proceeds via the statement that the Young diagrams form a well partial ordering.

Sign in / Sign up

Export Citation Format

Share Document