相关论文: Mis\`ere-play Hackenbush Sprigs

We study a two-person game based on the well-studied brushing process on graphs. Players Min and Max alternately place brushes on the vertices of a graph. When a vertex accumulates at least as many brushes as its degree, it sends one brush…

In an impartial combinatorial game, both players have the same options in the game and all its subpositions. The classical Sprague-Grundy Theory was developed for short impartial games, where players have a finite number of options, there…

We consider combining the definition of a cardinal invariant and the notion of an infinite game. We focus on the splitting number $\mathfrak{s}$ since the corresponding cardinal invariants behave in an interesting way. We introduce three…

We associate to each synchronous game an algebra whose representations determine if the game has a perfect deterministic strategy, perfect quantum strategy or one of several other perfect strategies. when applied to the graph coloring game,…

The Domination game is an impartial game on graphs, introduced in 2010, and proved PSPACE-complete in the normal variant in 2026. In this game, Alice and Bob alternately select playable vertices, where a vertex is playable if it dominates…

The spin analogues of several classical concepts and results for Hecke algebras are established. A Frobenius type formula is obtained for irreducible characters of the Hecke-Clifford algebra. A precise characterization of the trace…

A sequence of nonnegative integers \pi =(d_1,d_2,...,d_n) is graphic if there is a (simple) graph G with degree sequence \pi. In this case, G is said to realize or be a realization of \pi. Degree sequence results in the literature generally…

Number systems with a rational number $a/b > 1$ as base have gained interest in recent years. In particular, relations to Mahler's 3/2-problem as well as the Josephus problem have been established. In the present paper we show that the…

In this paper, we show that the concatenation of the Fibonacci sequence is \textit{normal} in base $10$, meaning every string of a given length, $k$, occurs as frequently as every other string of length $k$ (there are as many $1$'s as $2$'s…

Certain supersymmetric elementary string states with spin can be viewed as small black rings whose horizon has the topology of S^1 \times S^{d-3} in a d-dimensional string theory. By analyzing the singular black ring solution in the…

Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc…

Classically, the splitting principle says how to pull back a vector bundle in such a way that it splits into line bundles and the pullback map induces an injection on $K$-theory. Here we categorify the splitting principle and generalize it…

We reconsider the general properties of gravitational lensing effects induced by cosmic string systems, taking into account their equation of state and motion equations. We explicitly show that the deflection patterns induced by a string is…

Considering the so-called Simpson system on smooth projective varieties, defined over an algebraically closed field of characteristic 0, whose canonical bundle is ample, I give another proof the stability of this Higgs bundle, from which…

Given an impartial combinatorial game G, we create a class of related games (CIS-G) by specifying a finite set of positions in G and forbidding players from moving to those positions (leaving all other game rules unchanged). Such…

A string is the one-dimensional generalization of a point particle. In this sense, the analog of a cloud of dust would be a cloud of strings. In this work, we consider a cloud of strings around a regular solution in general gelativity. We…

A normal 5-edge-coloring of a cubic graph is a coloring such that for every edge the number of distinct colors incident to its end-vertices is 3 or 5 (and not 4). The well known Petersen Coloring Conjecture is equivalent to the statement…

An edge e is normal in a proper edge-coloring of a cubic graph G if the number of distinct colors on four edges incident to e is 2 or 4: A normal edge-coloring of G is a proper edge-coloring in which every edge of G is normal. The Petersen…

We introduce a class of normal play partizan games, called Complementary Subtraction. Let $A$ denote your favorite set of positive integers. This is Left's subtraction set, whereas Right subtracts numbers not in $A$. The Golden Nugget…

Misner space, also known as the Lorentzian orbifold $R^{1,1}/boost$, is the simplest tree-level solution of string theory with a cosmological singularity. We compute tree-level scattering amplitudes involving twisted states, using operator…