English
Related papers

Related papers: Mis\`ere-play Hackenbush Sprigs

200 papers

Absolute Universes of combinatorial games, as defined in a recent paper by the same authors, include many standard short normal- mis\`ere- and scoring-play monoids. In this note we show that the class is categorical, by extending Joyal's…

Combinatorics · Mathematics 2016-09-12 Urban Larsson , Richard J. Nowakowski , Carlos P. Santos

We introduce Multiplicative Modular Nim (MuM), a variant of Nim in which the traditional nim-sum is replaced by heap-size multiplication modulo m. We establish a complete theory for this game, beginning with a direct, Bouton-style analysis…

Discrete Mathematics · Computer Science 2025-07-15 Satyam Tyagi

The class of Guaranteed Scoring Games (GS) are two-player combinatorial games with the property that Normal-play games (Conway et. al.) are ordered embedded into GS. They include, as subclasses, the scoring games considered by Milnor…

Combinatorics · Mathematics 2015-06-01 Urban Larsson , João P. Neto , Richard J. Nowakowski , Carlos P. Santos

Cosmic strings are linear concentrations of energy that form whenever phase transitions in the early universe break axial symmetries as originally shown by Kibble. They are the result of frustrated order in the quantum fields responsible…

Astrophysics · Physics 2008-11-11 A. Achucarro , C. J. A. P. Martins

A zero-sum two person Perfect Information Stochastic game (PISG) under limiting average payoff has a value and both the maximiser and the minimiser have optimal pure stationary strategies. Firstly we form the matrix of undiscounted payoffs…

Optimization and Control · Mathematics 2023-02-15 K. G. Bakshi , S. Sinha

Several researchers have recently established that for every Turing degree $\boldsymbol{c}$, the real closed field of all $\boldsymbol{c}$-computable real numbers has spectrum $\{\boldsymbol{d}~:~\boldsymbol{d}'\geq\boldsymbol{c}"\}$. We…

Logic · Mathematics 2019-08-20 Russell Miller , Victor Ocasio Gonzalez

Scoring play games were first studied by Fraser Stewart for his PhD thesis. He showed that under the disjunctive sum, scoring play games are partially ordered, but do not have the same "nice" structure of normal play games. In this paper I…

Combinatorics · Mathematics 2012-02-22 Fraser Stewart

A solution of the vortex type is given in a six-dimensional $SU(2)\times U(1)$ pure gauge theory coupled to Einstein gravity in a compactified background geometry. We construct the solution of an effective abelian Higgs model in terms of…

High Energy Physics - Theory · Physics 2019-05-02 Atsushi Nakamula , Satoru Hirenzaki , Kiyoshi Shiraishi

The famous open Vizing conjecture claims that the domination number of the Cartesian product graph of two graphs $G$ and $H$ is at least the product of the domination numbers of $G$ and $H$. Recently Gaar, Krenn, Margulies and Wiegele used…

Combinatorics · Mathematics 2023-06-26 Elisabeth Gaar , Melanie Siebenhofer

Given two finite sets of integers $S\subseteq\NNN\setminus\{0\}$ and $D\subseteq\NNN\setminus\{0,1\}$,the impartial combinatorial game $\IMARK(S,D)$ is played on a heap of tokens. From a heap of $n$ tokens, each player can moveeither to a…

Discrete Mathematics · Computer Science 2015-11-10 Eric Sopena

We study the computational limits of the following general hypothesis testing problem. Let H=H_n be an \emph{arbitrary} undirected graph on n vertices. We study the detection task between a ``null'' Erd\H{o}s-R\'{e}nyi random graph G(n,p)…

Statistics Theory · Mathematics 2024-03-27 Xifan Yu , Ilias Zadik , Peiyuan Zhang

A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence $(k_1+ 1, k_2+ 1, 1, \ldots, 1)$ is denoted by $S_{k_1, k_2}$. We study the edge-decomposition of regular graphs into…

Combinatorics · Mathematics 2015-05-21 Saieed Akbari , Shahab Haghi , Hamidreza Maimani , Abbas Seify

An antimagic labeling of a graph $G$ with $m$ edges is a bijection from $E(G)$ to $\{1,2,\ldots,m\}$ such that for all vertices $u$ and $v$, the sum of labels on edges incident to $u$ differs from that for edges incident to $v$. Hartsfield…

Combinatorics · Mathematics 2015-08-06 Daniel W. Cranston

By analogy with the Landau-Ginzburg theory of ordinary zero-form symmetries, we introduce and develop a Landau-Ginzburg theory of one-form global symmetries, which we call mean string field theory. The basic dynamical variable is a string…

High Energy Physics - Theory · Physics 2022-11-23 Nabil Iqbal , John McGreevy

We study the Helmholtz equation for a heterogeneous system in $d$ dimensions and show that it is possible to calculate exactly the sum rules of rational order using perturbation theory by relating the sum rules to suitable traces. The…

Mathematical Physics · Physics 2019-08-26 Paolo Amore

We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…

Combinatorics · Mathematics 2024-07-29 Mikhail Isaev , Brendan D. McKay , Angus Southwell , Maksim Zhukovskii

A set $\mathcal{A}$ is said to be an additive $h$-basis if each element in $\{0,1,\ldots,hn\}$ can be written as an $h$-sum of elements of $\mathcal{A}$ in {\it at least} one way. We seek multiple representations as $h$-sums, and, in this…

Number Theory · Mathematics 2017-05-16 Anant Godbole , Zach Higgins , Zoe Koch

In recent work, Watanabe, Eberhart, Asada, and Hasuo have shown that parity games can be seen as string diagrams, that is, as the morphisms of a symmetric monoidal category, an algebraic structure with two different operations of…

Logic in Computer Science · Computer Science 2025-01-31 Robin Piedeleu

We consider the inhomogeneous decay of an unstable D-brane of bosonic string theory in a linear dilaton background in a light-cone frame. At the lowest level, the dynamical equation that describes this process is a generalisation (that…

High Energy Physics - Theory · Physics 2015-03-31 Debashis Ghoshal , Preeda Patcharamaneepakorn

We study the multicolour discrepancy of spanning trees and Hamilton cycles in graphs. As our main result, we show that under very mild conditions, the $r$-colour spanning-tree discrepancy of a graph $G$ is equal, up to a constant, to the…

Combinatorics · Mathematics 2021-12-30 Lior Gishboliner , Michael Krivelevich , Peleg Michaeli