Search arXivSearch

arXiv · 2603.12225

Evil Twins in Sums of Wildflowers

Abstract

A game $G$ is said to have the evil twin property if there exists $G^* \in \{G,G+*\}$ such that $o^+(G) = o^-(G^*)$ and $o^+(G^*) = o^-(G)$. We study sums of wildflowers, games of form $G:H$. We find that a large closed set of sums of wildflowers has the evil twin property, extending work of McKay--Milley--Nowakowski and Lo. Our argument partially generalizes the misère genus theory of Conway to partizan games, and requires proving several general theorems on ways to extend sets with the evil twin property. Many sums of mutant flowers of the form $\{*x_1,\dots,*x_n\}:a$, where $a$ is a number, also have the evil twin property. We also prove that this set of mutant flowers is the largest such closed set with the evil twin property, and that it is $\mathsf{NP\text{-}hard}$ to compute the outcome class of a sum of mutant flowers under either play convention via a reduction from \textsc{3-Sat}. Previous work on this topic was done by McKay, Milley, and Nowakowski, and later Lo.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Simon Rubinstein-Salzedo, Stephen Zhou. 2026-03-12. Evil Twins in Sums of Wildflowers. https://arxiv.org/abs/2603.12225

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO