中文
相关论文

相关论文: Evil Twins in Sums of Wildflowers

200 篇论文

We show that any disjunctive sum of Hackenbush Flowers $G$ has as evil twin $G^* \in {G, G+*}$ such that the outcomes of $G$ under normal and mis\`ere play are the same as the outcomes of $G^*$ under mis\`ere and normal play respectively.…

组合数学 · 数学 2013-01-09 Irene Y. Lo

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…

组合数学 · 数学 2026-04-14 Kengo Hashimoto

In this paper we consider ordinal sums of combinatorial games where each summand is a number, not necessarily in canonical form. In doing so we give formulas for the value of an ordinal sum of numbers where the literal form of the base has…

组合数学 · 数学 2023-05-29 Alexander Clow , Neil McKay

A sunflower is a collection of distinct sets such that the intersection of any two of them is the same as the common intersection $C$ of all of them, and $|C|$ is smaller than each of the sets. A longstanding conjecture due to Erd\H{o}s and…

组合数学 · 数学 2025-01-29 Dhruv Mubayi , Lujia Wang

Combinatorial Game Theory(CGT)is a branch of Game Theory that has developed largely independently of Economic Game Theory (EGT), and is concerned with deep mathematical properties of two-player zero-sum games recursively defined over…

计算机科学与博弈论 · 计算机科学 2025-12-09 Urban Larsson , Reshef Meir , Yair Zick

Sumner's universal tournament conjecture states that every $(2n-2)$-vertex tournament should contain a copy of every $n$-vertex oriented tree. If we know the number of leaves of an oriented tree, or its maximum degree, can we guarantee a…

组合数学 · 数学 2024-10-14 Alistair Benford , Richard Montgomery

First we reprove two results in additive number theory due to Dombi and Chen & Wang, respectively, on the number of representations of n as the sum of two odious or evil numbers, using techniques from automata theory and logic. We also use…

数论 · 数学 2022-12-21 Jean-Paul Allouche , Jeffrey Shallit

Often, a given selection game studied in the literature has a known dual game. In dual games, a winning strategy for a player in either game may be used to create a winning strategy for the opponent in the dual. For example, the Rothberger…

一般拓扑 · 数学 2018-10-01 Steven Clontz

We study impartial take away games on 2 unordered piles of finite nonnegative numbers of tokens $(x,y)$. Two players alternate in removing at least one and at most all tokens from the respective piles, according to certain rules, and the…

组合数学 · 数学 2012-06-21 Urban Larsson

In a recent post on the Seqfan list the third author proposed a conjecture concerning the summatory function of odious numbers (i.e., of numbers whose sum of binary digits is odd), and its analog for evil numbers (i.e., of numbers whose sum…

数论 · 数学 2014-05-27 Jean-Paul Allouche , Benoit Cloitre , Vladimir Shevelev

This paper explores the structure of the combinatorial domain $2^X$ in relation to sunflowers. The previous study found some intrinsic properties of the $l$-extension \[ Ext \left( \mathcal{F}, l \right) = \left\{ V ~:~ V \in {X \choose…

组合数学 · 数学 2025-04-30 Junichiro Fukuyama

Combinatorial game theory (CGT), as introduced by Berlekamp, Conway and Guy, involves two players who move alternately in a perfect information, zero-sum game, and there are no chance devices. Also the games have the finite descent property…

组合数学 · 数学 2018-10-09 Melissa Huggan , Richard J. Nowakowski , Paul Ottaway

A sunflower with $k$ petals, or $k$-sunflower, is a family of $k$ sets every two of which have a common intersection. Known since 1960, the sunflower conjecture states that a family ${\mathcal F}$ of sets each of cardinality $m$ includes a…

组合数学 · 数学 2021-12-28 Junichiro Fukuyama

This paper addresses several significant gaps in the theory of restricted mis\`ere play (Plambeck, Siegel 2008), primarily in the well-studied universe of dead-ending games, $\mathcal{E}$ (Milley, Renault 2013); if a player run out of moves…

Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial…

组合数学 · 数学 2023-02-28 Zach Hunter

We obtain explicit estimates for the mixed character sum $S= S(\chi,g,f,p^m) = \sum_{x=1}^{p^m} \chi (g(x)) e_{p^m}(f(x))$, where $p^m$ is a prime power, $\chi$ is a multiplicative character mod $p^m$ and $f,g$ are rational functions over…

数论 · 数学 2026-04-06 Todd Cochrane , Andrew Granville

Using game theory we provide mathematical proof that if a species of asexually reproducing microbes does not possess maximum variability in competitive abilities amongst its individual organisms, then that species is vulnerable to…

种群与进化 · 定量生物学 2020-12-15 Susanne Menden-Deuer , Julie Rowlett

A sunflower with $r$ petals is a collection of $r$ sets so that the intersection of each pair is equal to the intersection of all of them. Erd\H{o}s and Rado proved the sunflower lemma: for any fixed $r$, any family of sets of size $w$,…

组合数学 · 数学 2021-09-01 Ryan Alweiss , Shachar Lovett , Kewen Wu , Jiapeng Zhang

A pure pair in a tournament $G$ is an ordered pair $(A,B)$ of disjoint subsets of $V(G)$ such that every vertex in $B$ is adjacent from every vertex in $A$. Which tournaments $H$ have the property that if $G$ is a tournament not containing…

组合数学 · 数学 2023-08-09 Maria Chudnovsky , Alex Scott , Paul Seymour , Sophie Spirkl

In evolutionary game theory, an important measure of a mutant trait (strategy) is its ability to invade and take over an otherwise-monomorphic population. Typically, one quantifies the success of a mutant strategy via the probability that a…

种群与进化 · 定量生物学 2016-04-12 Alex McAvoy , Christoph Hauert
‹ 上一页 1 2 3 10 下一页 ›