Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2511.14468

$\mathcal{L}\mathcal{R}$-Ending partisan rulesets

Hiroki Inazu·Shun-ichi Kimura·Koki Suetsugu
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we consider $\mathcal{L}\mathcal{R}$-ending partisan rulesets as a branch of combinatorial game theory. In these rulesets, the sets of options of both players are the same. However, there are two kinds of terminal positions. If the game ends in one kind of terminal position, then a player wins, and if the game ends in the other kind of terminal position, the other player wins. We introduce notations for positions in $\mathcal{L}\mathcal{R}$-ending partisan rulesets including disjunctive sum of terminal positions depending on the parity and basic definitions and show their algebraic structures. We also introduce some examples of $\mathcal{L}\mathcal{R}$-ending partisan rulesets and show how our results can be used for analyzing the rulesets.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hiroki Inazu, Shun-ichi Kimura, Koki Suetsugu. 2026-08-21. $\mathcal{L}\mathcal{R}$-Ending partisan rulesets. https://arxiv.org/abs/2511.14468

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗