activity
20172026
most citedHardness of braided quantum circuit optimization in the surface code

7 citations · 8 across the 22 of their papers we have counts for

collaborators
Showing 2025Show all

6 papers · 1 filter

math.CO2025

Cyclic impartial games with carry-on moves

Tomoaki Abuku, Alda Carvalho, Urban Larsson +3

In an impartial combinatorial game, both players have the same options in the game and all its subpositions. The classical Sprague-Grundy Theory was developed for short impartial g…

math.CO2025

-Ending partisan rulesets

Hiroki Inazu, Shun-ichi Kimura, Koki Suetsugu

In this paper, we consider -ending partisan rulesets as a branch of combinatorial game theory. In these rulesets, the sets of options of both players are th…

math.CO2025

Digraph Yama Nim

Hiyu Inoue, Shun-ichi Kimura, Hikaru Manabe +3

{\sc Yama Nim} is a variant of two piles {\sc Nim}. In this ruleset, the player chosses one of the piles and removes at least two tokens from the pile. In the same move, the player…

math.CO2025

Combinatorial Games and the Golden Ratio on Digraphs

Tomoaki Abuku, Hiroki Inazu, Hiyu Inoue +4

We introduce a new combinatorial game called Triangle Game. In this game, a directed -cycle graph is given, and stones are placed on each vertex. The player chooses a directed e…

math.CO2025

On the Sprague-Grundy values of games with a pass

Hikaru Manabe, Ryohei Miyadera, Koki Suetsugu

In this paper, we consider two-player impartial games with a pass-move. A disjunctive compound of games is a position in which, on each turn, the current player chooses one of the…

math.CO2025

Extended circular nim

Koki Suetsugu

Circular nim is a variant of nim, in which there are piles of tokens arranged in a circle and each player, in their turn, chooses at most consecutive piles in th…