English
Related papers

Related papers: Erratum to: Lattice point methods for combinatoria…

200 papers

We investigate combinatorial issues relating to the use of random orbit approximations to the attractor of an iterated function system with the aim of clarifying the role of the stochastic process during generation the orbit. A Baire…

Dynamical Systems · Mathematics 2013-01-31 Michael F. Barnsley , Krzysztof Leśniak

An error occurs in a part of the statement and proof of Proposition 2.2 in Jour. Math. Anal. and Appl., 476, (2019), 53-85 that is corrected in this erratum. The revised result reveals a new and unexpected critical phenomenon, having…

Probability · Mathematics 2023-08-08 Radu Dascaliuc , Tuan N. Pham , Enrique A. Thomann , Edward C. Waymire

On [3, p. 199] one says "We mention parenthetically that the proof of [99, Lemma 41.3] is incorrect, and we do not know whether it, [99, Theorem 41.5] and [99, Theorem 41.6] are true". The previously cited reference [99] is our reference…

Functional Analysis · Mathematics 2009-10-21 M. D. Voisei

This paper contains a reformulation of any $n$-player finite, static game into a framework of distributed, dynamical system based on agents' payoff-based deviations. The reformulation generalizes the method employed in the second part of…

Computer Science and Game Theory · Computer Science 2017-10-19 Yuke Li , Fengjiao Liu , A. Stephen Morse

We provide here an epistemic analysis of arbitrary strategic games based on the possibility correspondences. Such an analysis calls for the use of transfinite iterations of the corresponding operators. Our approach is based on Tarski's…

Computer Science and Game Theory · Computer Science 2007-06-08 Krzysztof R. Apt

Parity games are combinatorial representations of closed Boolean mu-terms. By adding to them draw positions, they have been organized by Arnold and one of the authors into a mu-calculus. As done by Berwanger et al. for the propositional…

Logic in Computer Science · Computer Science 2008-03-13 Walid Belkhir , Luigi Santocanale

Self-play post-training methods has emerged as an effective approach for finetuning large language models and turn the weak language model into strong language model without preference data. However, the theoretical foundations for…

Machine Learning · Computer Science 2026-02-03 Shangzhe Li , Xuchao Zhang , Chetan Bansal , Weitong Zhang

A new combinatorial game is given. It generalizes both Substraction and Nim. It is proved the computation of Nash equilibrium points in this new game is NP-hard.

Computer Science and Game Theory · Computer Science 2024-08-27 Chunlei Liu

We establish an error estimate for counting lattice points in Euclidean norm balls (associated to an arbitrary irreducible linear representation) for lattices in simple Lie groups of real rank at least two. Our approach utilizes refined…

Number Theory · Mathematics 2016-08-31 Alexander Gorodnik , Amos Nevo , Gal Yehoshua

The purpose of this erratum is to fill a gap in the proof of the `Composite Braid Theorem' in the manuscript "Studying Links Via Closed Braids IV: Composite Links and Split Links (SLVCB-IV)", Inventiones Math, \{bf 102\} Fasc. 1 (1990),…

Geometric Topology · Mathematics 2009-11-10 Joan S. Birman , William W. Menasco

We propose a new determinacy hypothesis for transfinite games, use the hypothesis to extend the perfect set theorem, prove relationships between various determinacy hypotheses, expose inconsistent versions of determinacy, and provide a…

Logic · Mathematics 2016-12-16 Dmytro Taranovsky

We correct here two errors in our earlier paper "An algebraic model for finite loop spaces" [arXiv:1212.2033]

Algebraic Topology · Mathematics 2025-11-05 Carles Broto , Ran Levi , Bob Oliver

This paper investigates the long-term behavior of an interacting particle system of interest in the hot topic of evolutionary game theory. Each site of the $d$-dimensional integer lattice is occupied by a player who is characterized by one…

Probability · Mathematics 2016-06-07 Eric Foxall , Nicolas Lanchier

We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP.…

Combinatorics · Mathematics 2021-01-26 Sylvie Corteel , Matthieu Josuat-Verges , Thomas Prellberg , Martin Rubey

We complete the proof of Proposition 5.3 of [GJR04].

Number Theory · Mathematics 2019-05-23 David Ginzburg , Dihua Jiang , Baiying Liu , Stephen Rallis

The purpose of this note is to point to a gap in an argument in our paper "Stabilization for the automorphisms of free groups with boundaries", and explain how to fill it.

Geometric Topology · Mathematics 2014-11-11 Allen Hatcher , Nathalie Wahl

We introduce a new class of context dependent, incomplete information games to serve as structured prediction models for settings with significant strategic interactions. Our games map the input context to outcomes by first condensing the…

Machine Learning · Computer Science 2019-05-30 Vikas K. Garg , Tommi Jaakkola

We show how the software Walnut can be used to obtain concise proofs of results concerning variants of the famous Wythoff game, in which blocking maneuvers or terminal positions are added, as discussed respectively by Larsson (2011) and…

Discrete Mathematics · Computer Science 2025-12-15 Antoine Renard , Michel Rigo

We correct a misattribution in our book.

Algebraic Geometry · Mathematics 2007-05-23 János Kollár , Karen E. Smith , Alessio Corti

Combinatorial games are two-player games of pure strategy where the players, usually called Left and Right, move alternately. In this paper, we introduce Cheating Robot games. These arise from simultaneous-play combinatorial games where one…

Combinatorics · Mathematics 2022-02-11 Melissa A. Huggan , Richard J. Nowakowski