Searcharxiv⌕ Search

arXiv subjects

Kengo Hashimoto

Publications and source records attributed to Kengo Hashimoto.

11 recordsLinked to original sources

Closing the Complexity Gap for Wheeler Graph Recognition on $d$-NFAs

Wheeler graph recognition asks whether a directed graph whose arcs are labeled by symbols from a totally ordered alphabet admits a Wheeler order, a total order on its vertices compatible with the labels of arcs and the order of their tails. A $d$-NFA is a nondeterministic finite automaton in which at most $d$ transitions with any given label leave each state. For Wheeler graph recognition on $d$-NFAs, Alanko et al. gave a polynomial-time algorithm for $d \leq 2$, whereas Gibney and Thankachan proved NP-completeness for every fixed $d \geq 5$. The computational complexity for $d = 3$ and $d = 4$ remained open. We resolve both open cases by extending the reduction of Gibney and Thankachan with a new encoding of clauses of Not-All-Equal 3-SAT. Specifically, we prove that recognition is NP-complete even for directed acyclic graphs over an ordered binary alphabet with a unique source reaching every vertex and total out-degree at most three at every vertex. Consequently, Wheeler graph recognition on $d$-NFAs is NP-complete for every fixed $d \geq 3$.

cs.CC↗

The Two-Level Poset Game is PSPACE-Complete

Poset games form a fundamental class of combinatorial games that includes classical games such as Nim and Chomp. Determining the outcome of a poset game is known to be PSPACE-complete even for posets of height at most three. However, the exact computational complexity of Two-Level Poset Game, played on posets of height at most two, has remained an open problem for over a decade. We resolve this problem by proving that Two-Level Poset Game is PSPACE-complete via a polynomial-time reduction from Avoid True on positive CNF formulas.

cs.CC↗

The Computational Complexity of the Ungar Games on Distributive Lattices

The Ungar game, introduced by Defant et al., is a combinatorial game played on a finite lattice, which originates from a geometric transformation introduced by Ungar to resolve Scott's slope problem. When played on a distributive lattice $L$, the Ungar game reduces to repeatedly choosing and removing a non-empty set of maximal elements from a finite poset $P$, where $L$ is represented as the lattice $J(P)$ of the order ideals of $P$ by Birkhoff's representation theorem. Defant et al. raised the open question of whether determining the outcome of the Ungar game on $J(P)$ is PSPACE-complete with respect to $|P|$. In this paper, we settle this open question in the affirmative. More precisely, we prove that the problem is PSPACE-complete even when restricted to posets $P$ with maximum chain length $l(P) \le 3$ such that the underlying graph of the Hasse diagram of $P$ is bipartite, where the length of a chain is defined as the number of elements in the chain minus one. Furthermore, we show that the problem is NP-complete for $l(P) \le 2$, whereas the case $l(P) \le 1$ is known to belong to LOGSPACE.

math.CO↗

Partizan Serial Nim

A combinatorial game is a two-player game without hidden information or chance elements. The main object of combinatorial game theory is to determine the outcome (i.e., which player has a winning strategy) of a given position in combinatorial games. Nim is a well-known and fundamental ruleset in combinatorial game theory. This paper proposes a novel partizan variant of Nim called Partizan-Serial-Nim, defined as follows: there are $n$ piles of stones indexed by $1, 2, \ldots, n$; the two players have permutations $\mathbfσ^L$ and $\mathbfσ^R$ of $(1, 2, \ldots, n)$, respectively; a move is to remove any positive number of stones from the non-empty pile with the minimum value in the player's permutation; the player who cannot make a move loses. This ruleset is a generalization of Serial-Nim and Partizan-End-Nim. We give an algorithm to compute the outcome of a given position in Partizan-Serial-Nim in $O(n^2)$ time, provided that each arithmetic and comparison operation is performed in $O(1)$ time. Also, for the case where all non-empty piles have the same number $m$ of stones, we prove that the outcome does not depend on $m$ for $m \geq 2$ and present an algorithm to compute the outcome in $O(n)$ time. Further, we prove that the atomic weight of every position in Partizan-Serial-Nim is an integer.

math.CO↗

Ordinal Sums with Substitution of Impartial Games

A combinatorial game is a two-player game without hidden information or chance elements. The disjunctive sum $G + H$ of games $G$ and $H$ is the game in which $G$ and $H$ are played in parallel, and a player makes a move on exactly one of $G$ and $H$ in a turn. The ordinal sum $G \colon H$ is similar to the disjunctive sum, but once the left game $G$ is played, the right game $H$ is discarded and can no longer be played. It is known that the outcome of a mixture of disjunctive sums and ordinal sums, such as $(G_1 \colon G_2) + ((G_3 + G_4) \colon G_5)$, is determined by the variation sets, the set of Grundy numbers of all options, of the components in the normal-play. In this paper, we propose a generalization of an ordinal sum, called an ordinal sum with substitution $G \colon_{\widehat{H}} H$, which is the game made by combining $G$, $H$, and $\widehat{H}$ in the following way: the games $G$ and $H$ are played in parallel; a player makes a move on exactly one of $G$ and $H$ in a turn; each time the left game $G$ is played, the right game $H$ is replaced with $\widehat{H}$. We investigate their fundamental properties and prove a simple formula for the variation sets of ordinal sums with substitution. Apply the formula, we give an explicit expression of the Grundy number of a chain of ordinal sums with substitution consisting of nimbers. We also provide an example illustrating the generalization of ordinal sums with substitution to poset structures.

math.CO↗

Impartial Games with Activeness

A combinatorial game is a two-player game without hidden information or chance elements. The main object of combinatorial game theory is to obtain the outcome, which player has a winning strategy, of a given combinatorial game. Positions of many well-known combinatorial games are naturally decomposed into a disjunctive sum of multiple components and can be analyzed independently for each component. Therefore, the study of disjunctive sums is a major topic in combinatorial game theory. Combinatorial games in which both players have the same set of possible moves for every position are called impartial games. In the normal-play convention, it is known that the outcome of a disjunctive sum of impartial games can be obtained by computing the Grundy number of each term. The theory of impartial games is generalized in various forms. This paper proposes another generalization of impartial games to a new framework, impartial games with activeness: each game is assigned a status of either ``active'' or ``inactive''; the status may change by moves; a disjunctive sum of games ends immediately, not only when no further moves can be made, but also when all terms become inactive. We formally introduce impartial games with activeness and investigate their fundamental properties.

math.CO↗

The Game Value of Sequential Compounds of Integers and Stars

A combinatorial game is a two-player game without hidden information or chance elements. One of the major approaches to analyzing games in combinatorial game theory is to break down a given game position into a disjunctive sum of multiple sub-positions, then evaluate the game value of each component of the sum, and finally integrate these game values to find which player has a winning strategy in the whole position. Accordingly, finding the game value of a given position is a major topic in combinatorial game theory. The sequential compound proposed by Stromquist and Ullman is a combinatorial game consisting of two combinatorial games. In the sequential compound of games $G$ and $H$, the players make moves on $G$ until $G$ is over, and then they play on $H$. In this paper, we investigate the general properties of sequential compounds. As the main result, we give the game values of sequential compounds of a finite number of integers and stars, which are basic and typical games in combinatorial game theory.

math.CO↗

Reduction of Sufficient Number of Code Tables of $k$-Bit Delay Decodable Codes

A $k$-bit delay decodable code-tuple is a lossless source code that can achieve a smaller average codeword length than Huffman codes by using a finite number of code tables and allowing at most $k$-bit delay for decoding. It is known that there exists a $k$-bit delay decodable code-tuple with at most $2^{(2^k)}$ code tables that attains the optimal average codeword length among all the $k$-bit delay decodable code-tuples for any given i.i.d. source distribution. Namely, it suffices to consider only the code-tuples with at most $2^{(2^k)}$ code tables to accomplish optimality. In this paper, we propose a method to dramatically reduce the number of code tables to be considered in the theoretical analysis, code construction, and coding process.

cs.IT↗

The Optimality of AIFV Codes in the Class of $2$-bit Delay Decodable Codes

AIFV (almost instantaneous fixed-to-variable length) codes are noiseless source codes that can attain a shorter average codeword length than Huffman codes by allowing a time-variant encoder with two code tables and a decoding delay of at most 2 bits. First, we consider a general class of noiseless source codes, called k-bit delay decodable codes, in which one allows a finite number of code tables and a decoding delay of at most k bits for k >= 0. Then we prove that AIFV codes achieve the optimal average codeword length in the 2-bit delay decodable codes class.

cs.IT↗

Properties of k-bit Delay Decodable Codes

The class of k-bit delay decodable codes, source codes allowing decoding delay of at most k bits for k >= 0, can attain a shorter average codeword length than Huffman codes. This paper discusses the general properties of the class of k-bit delay decodable codes with a finite number of code tables and proves two theorems which enable us to limit the scope of code-tuples to be considered when discussing optimal k-bit delay decodable code-tuples.

cs.IT↗

Optimality of Huffman Code in the Class of 1-bit Delay Decodable Codes

For a given independent and identically distributed (i.i.d.) source, Huffman code achieves the optimal average codeword length in the class of instantaneous code with a single code table. However, it is known that there exist time-variant encoders, which achieve a shorter average codeword length than the Huffman code, using multiple code tables and allowing at most k-bit decoding delay for k = 2, 3, 4, . . .. On the other hand, it is not known whether there exists a 1-bit delay decodable code, which achieves a shorter average length than the Huffman code. This paper proves that for a given i.i.d. source, a Huffman code achieves the optimal average codeword length in the class of 1-bit delay decodable codes with a finite number of code tables.

cs.IT↗