A complete analysis of Black-White Hackendot

RecentlyÚlehla [1980] gave a complete analysis of an impartial two-person combinatorial game called Hackendot which was invented by von Neumann. In this note we consider a partizan (or unimpartial) variation of Hackendot. Úlehla's analysis uses the Sprague-Grundy theory for disjunctive sums of impartial games. Our analysis employs Conway's theory for disjunctive sums of partizan games, two certain “biased” ways of “adding” dyadic rationals, and the usual addition of numbers.     

Wythoff partizan subtraction

We introduce a class of normal-play partizan games, called Complementary Subtraction. These games are instances of Partizan Subtraction where we take any set A of positive integers to be Left’s subtraction set and let its complement be Right’s subtraction set. In wythoff partizan subtraction we take the set A and its complement B from wythoff nim, as the two subtraction sets. As a function of the heap size, the maximum size of the canonical forms grows quickly. However, the value of the heap is either a number or, in reduced canonical form, a switch. We find the switches by using properties of the Fibonacci word and standard Fibonacci representations of integers. Moreover, these switches are invariant under shifts by certain Fibonacci numbers. The values that are numbers, however, are distinct, and we can find their binary representation in polynomial time using a representation of integers as sums of Fibonacci numbers, known as the ternary (or “the even”) Fibonacci representation.     

Atomic weights and the combinatorial game of bipass

We define an all-small ruleset, bipass, within the framework of normal play combinatorial games. A game is played on finite strips of black and white stones. Stones of different colors are swapped provided they do not bypass one of their own kind. We find a simple surjective function from the strips to integer atomic weights (Berlekamp, Conway and Guy 1982) that measures the number of units in all-small games. This result provides explicit winning strategies for many games, and in cases where it does not, it gives narrow bounds for the canonical form game values. We find game values for some parametrized families of games, including an infinite number of strips of value ?, and we prove that the game value ?2 does not appear as a disjunctive sum of bipass. Lastly, we define the notion of atomic weight tameness, and prove that optimal misére play bipass resembles optimal normal play.     

Generalizations of projectivity and supplements revisited for superfluous ideals

We (re)introduce four ideal-related generalizations of classic module-theoretic notions: the ideal-superfluity, projective ideal-covers, the ideal-projectivity, and ideal-supplements. For a superfluous ideal I, the main theorem asserts the equivalence between the conditions: “I-supplements are direct summands in finitely generated projective modules”; “finitely generated I-projective modules are projective”; “projective modules with finitely generated factors modulo I are finitely generated”; “finitely generated flat modules with projective factors modulo I are projective.” Moreover, we provide a property of the ideal I which is sufficient for the equivalence to hold true. The property is expressed in terms of idempotent-lifting in matrix rings.     

Mollifiers for games in normal form and the Harsanyi-Selten valuation function

The concepts of disruption and mollifiers ofCharnes/Rousseau/Seiford [1978] for games in characteristic function form are here extended to games in normal form. We show for a large class of games that theHarsanyi-Selten [1959] modification ofvon Neumann /Morgenstern's [1953] construction of a characteristic function for games in normal form, to take better account of “disruption” or “threat” possibilities, yields a constant mollifier. In general, it can be non-superadditive when the von Neumann-Morgenstern function is superadditive, and it also fails to take account of coalitional sizes. Our extended “homomollifier” concept does, and always yields a superadditive constant sum characteristic function.     

On Milnor's classes “L” and “D”

A twenty-one player counterexample is presented which disposes of two questions raised by J. W. Milnor in 1952 concerning the existence of certain pre-solutions, based on plausible lower and upper bounds to what a coalition should expect to receive in a cooperative game in characteristic function form. In the counterexample, the lower-bound set, known as “L”, is empty, and the upper-bound set, known as “D”, contains no efficient outcomes.     

On a dynamic theory for the kernel of ann-person game

In this paper, a dynamic theory for the kernel ofn-person games given byBillera is studied. In terms of the (bargaining) trajectories associated with a game (i.e. solutions to the differential equations defined by the theory), an equivalence relation is defined. The “consistency” of these equivalence classes is examined. Then, viewing the pre-kernel as the set of equilibrium points of this system of differential equations, some topological, geometric, symmetry and stability properties of the pre-kernel are given.     

Partizan octal games: Partizan subtraction games

A subtraction gameS=(s ₁, ...,s _k)is a two-player game played with a pile of tokens where each player at his turn removes a number ofm of tokens providedmεS. The player first unable to move loses, his opponent wins. This impartial game becomes partizan if, instead of one setS, two finite setsS _L andS _R are given: Left removes tokens as specified byS _L, right according toS _R. We say thatS _L dominatesS _R if for all sufficiently large piles Left wins both as first and as second player. We exhibit a curious property of dominance and provide two subclasses of games in which a dominance relation prevails. We further prove that all partizan subtraction games areperiodic, and investigatepure periodicity.     

Algebroid plane curves whose Milnor and Tjurina numbers differ by one or two

In this paper we describe all irreducible plane algebroid curves, defined over an algebraically closed field of characteristic zero, modulo analytic equivalence, having the property that the difference between their Milnor and Tjurina numbers is 1 or 2. Our work extends a previous result of O. Zariski who described such curves when this difference is zero.Partially supported by PRONEX and CNPq.     

Selective sums of loopy partizan graph games

A loopy partizan graph game is a two-person game of perfect information which is played on a labelled digraph. The disjunctive sum, the continued conjunctive sum, and the selective sum are formulations for playing several l.p.g.g.'s simultaneously, so as to form a single compound game. In this paper, we present an analysis of the selective sum by utilizing certain elements of the theories for the disjunctive sum and the continued conjunctive sum.     

Sign or root of unity ambiguities of certain Gauss sums

Gauss sums play an important role in number theory and arithmetic geometry. The main objects of study in this paper are Gauss sums over the finite field with q elements. Recently, the problem of explicit evaluation of Gauss sums in the small index case has been studied in several papers. In the process of the evaluation, it is realized that a sign (or a root of unity) ambiguity unavoidably occurs. These papers determined the ambiguities by the congruences modulo L, where L is certain divisor of the order of Gauss sum. However, such method is unavailable in some situations. This paper presents a new method to determine the sign (root of unity) ambiguities of Gauss sums in the index 2 case and index 4 case, which is not only suitable for all the situations with q being odd, but also comparatively more efficient and uniform than the previous method.     

Multiplicative character sums of Fermat quotients and pseudorandom sequences

We prove a bound on sums of products of multiplicative characters of shifted Fermat quotients modulo p. From this bound we derive results on the pseudorandomness of sequences of modular discrete logarithms of Fermat quotients modulo p: bounds on the well-distribution measure, the correlation measure of order ?, and the linear complexity.     

Congruences for 9-regular partitions modulo 3

It is proved that the number of 9-regular partitions of n is divisible by 3 when n is congruent to 3 mod 4, and by 6 when n is congruent to 13 mod 16. An infinite family of congruences mod 3 holds in other progressions modulo powers of 4 and 5. A collection of conjectures includes two congruences modulo higher powers of 2 and a large family of “congruences with exceptions” for these and other regular partitions mod 3.     

Omega-Limit Sets of Generic Points of Partially Hyperbolic Diffeomorphisms

We prove that, for any E^u ⊕ E^cs partially hyperbolic C² diffeomorphism, the ω-limit set of a generic (with respect to the Lebesgue measure) point is a union of unstable leaves. As a corollary, we prove a conjecture made by Ilyashenko in his 2011 paper that the Milnor attractor is a union of unstable leaves. In the paper mentioned above, Ilyashenko reduced the local generecity of the existence of a “thick” Milnor attractor in the class of boundary-preserving diffeomorphisms of the product of the interval and the 2-torus to this conjecture.     

On the dimension of simple monotonic games

We show that the following problem is NP-hard, and hence computationally intractable: “Given d weighted majority games, decide whether the dimension of their intersection exactly equals d”. Our result indicates that the dimension of simple monotonic games is a combinatorially complicated concept.     

Generalized Gibbs phenomenon for Fourier partial sums and de la Vallée-Poussin sums

It is well-known that the Fourier partial sums of a function exhibit the Gibbs phenomenon at a jump discontinuity. We study the same question for de la Vallée-Poussin sums. Here we find a new Gibbs function and a new Gibbs constant. When the function is continuous, a behavior similar to the Gibbs phenomenon also occurs at a kink. We call it the “generalized Gibbs phenomenon”. Let $F_{n}(x):=\frac{k_{n}(g,x)-g(x)}{k_{n}(g,x_{0})-g(x_{0})}$ , where x ₀ is a kink and where k _n (g,x) represents Fourier partial sums and de la Vallée-Poussin sums. We show that F _n (x) exhibits the “generalized Gibbs phenomenon”. New universal Gibbs functions for both sums are derived.