首页/论文/1204.1990

arXiv 1204.19902012-04cs.LOcs.CC

Pebble Games and Linear Equations

Martin Grohe, Martin Otto

英文摘要：

We give a new, simplified and detailed account of the correspondence between levels of the Sherali-Adams relaxation of graph isomorphism and levels of pebble-game equivalence with counting (higher-dimensional Weisfeiler-Lehman colour refinement). The correspondence between basic colour refinement and fractional isomorphism, due to Tinhofer (1986, 1991) and Ramana, Scheinerman and Ullman (1994), is re-interpreted as the base level of Sherali-Adams and generalised to higher levels in this sense by Atserias and Maneva (2012) and Malkin (2014), who prove that the two resulting hierarchies interleave. In carrying this analysis further, we here give (a) a precise characterisation of the level-k Sherali-Adams relaxation in terms of a modified counting pebble game; (b) a variant of the Sherali-Adams levels that precisely match the k-pebble counting game; (c) a proof that the interleaving between these two hierarchies is strict. We also investigate the variation based on boolean arithmetic instead of real/rational arithmetic and obtain analogous correspondences and separations for plain k-pebble equivalence (without counting). Our results are driven by considerably simplified accounts of the underlying combinatorics and linear algebra.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Lower Bounds for Existential Pebble Games and k-Consistency Tests

The existential k-pebble game characterizes the expressive power of the existential-positive k-variable fragment of first-order logic on finite structures. The winner of the existential k-pebble game on two given finite structures can be determined in time O(n2k) by dynamic programming on the graph of game configurations. We show that there is no O(n(k-3)/12)-time algorithm that decides which player can win the existential k-pebble game on two given structures. This lower bound is unconditional and does not rely on any complexity-theoretic assumptions. Establishing strong k-consistency is a we…

2013-10-07cs.CCcs.LO

Pebble games with algebraic rules

We define a general framework of partition games for formulating two-player pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations of graph isomorphism that is strictly stronger than the well-known Weisfeiler-Lehman method. The general framework we introduce includes as special cases the pebble games for finite-variable logics with and without counting. It also includes a matrix-equivalence game, introduced here, which characterises equivalence in the finite-variable fragments of matri…

2012-05-07cs.LO

Pebble Games, Proof Complexity, and Time-Space Trade-offs

Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing bounds on proof space, and establishing size-space trade-offs. This is a survey of research in proof complexity drawing on results and tools from pebbling, with a focus on proof space lower bounds and trade-offs between proof size and proof space.

2013-09-20cs.CCcs.DMcs.LO

经典与量子空间之间的权衡：鬼魅推石游戏

Trade-offs between classical and quantum space using spooky pebbling

本文首次将鬼魅推石游戏框架应用于通用电路，证明了量子空间的上界，并展示了求解器在有限时间内通过优化经典空间来减少量子空间的可行性。

2025-12-11cs.LOquant-ph

关于 $T^2_2(R)$ 的 Ajtai 定理与带回溯的棋子游戏

Ajtai's theorem for $T^2_2(R)$ and pebble games with backtracking

本文引入了一种带回溯选项的棋子游戏，将 $T^2_2(R)$ 中抽屉原理的可证明性归约为 Prover 的 oblivious 获胜策略问题，并在简化版游戏（仅用两枚棋子且单次回溯）下证明了 Prover 无法获胜。

2024-12-20cs.LOmath.LO

有限模型理论中的卵石关系共单子

The Pebble-Relation Comonad in Finite Model Theory

本文提出卵石关系共单子，用范畴论方法刻画路径宽，并证明其coKleisli态射与k变量无穷逻辑限制合取片段的真值保持等价，进而得到联系路径宽与带计数量词逻辑的Lovász型定理。

2024-05-28cs.LOmath.LO

更多相关论文收起更多论文

无阿贝尔正规子群的群的描述复杂性（扩展摘要）

On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract)

本文研究有限群描述复杂性，提出2-ary WL着色并证明其与Hella层级第二类双射石子游戏等价，证明仅需常数个石子和轮次即可识别所有无阿贝尔正规子群的群，对应带广义二元量词的一阶逻辑常数变量与深度刻画。

2023-10-02cs.CCcs.DScs.LO

关于无阿贝尔正规子群的群的描述复杂性

On the Descriptive Complexity of Groups without Abelian Normal Subgroups

本文研究无阿贝尔正规子群的有限群的描述复杂性，提出2-ary WL着色并证明其等价于Hella层级中第二个Ehrenfeucht–Fraïssé双射卵石博弈，进而证明仅需7个卵石和7轮即可识别所有此类群，对应于一阶逻辑中仅用7个变量和7个量词深度的广义2-ary量词公式。

2025-11-06cs.CCcs.LOmath.GR

Pebble Games and Algebraic Proof Systems（卵石博弈与代数证明系统）

Pebble Games and Algebraic Proof Systems

Universität Ulm（乌尔姆大学）

该研究建立了三类卵石博弈与三种代数证明系统的平行对应关系，证明了黑色卵石博弈与MC反驳的次数、大小和时空参数的双向转换关系，进而得到证明系统的次数分离、次数-大小权衡及变量空间分离结果。

2026-04-30cs.LO

The pebbling comonad in finite model theory

Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction and database theory. Monads and comonads are basic notions of category theory which are widely used in semantics of computation and in modern functional programming. We show that existential k-pebble games have a natural comonadic formulation. Winning strategies for Duplicator in the k-pebble game for structures A and B are equivalent to morphisms from A to B in the coKleisli category for this comonad. This leads on to comonadic characterisations of a number of central concepts in Finite Model Theory:…

2017-04-17cs.LO

Notes on presheaf representations of strategies and cohomological refinements of $k$-consistency and $k$-equivalence

In this note, we show how positional strategies for $k$-pebble games have a natural representation as certain presheaves. These representations correspond exactly to the sheaf-theoretic models of contextuality introduced by Abramsky-Brandenburger. We study the notion of cohomological $k$-consistency recently introduced by Adam O' Conghaile from this perspective.

2022-06-24cs.LO

带计数的定点逻辑中唯一博弈的不可近似性

Inapproximability of Unique Games in Fixed-Point Logic with Counting

本文在带计数的定点逻辑中证明唯一博弈问题存在不可近似间隙及任意常数因子内不可近似，并提出基于大围长图和随机仿射向量空间标记的新构造方法。

2024-04-17cs.LO

Linear Time Algorithm for Weak Parity Games

We consider games played on graphs with the winning conditions for the players specified as weak-parity conditions. In weak-parity conditions the winner of a play is decided by looking into the set of states appearing in the play, rather than the set of states appearing infinitely often in the play. A naive analysis of the classical algorithm for weak-parity games yields a quadratic time algorithm. We present a linear time algorithm for solving weak-parity games.

2008-05-09cs.LO

Games and Full Completeness for Multiplicative Linear Logic

We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of {\em history-free} strategy; strong connections are made between history-free strategies and the Geometry of Interaction. Our semantics incorporates a natural notion of polarity, leading to a refined treatment of the additive…

2013-11-23cs.LO