Related papers: Hereditarily indecomposable continua as generic ma…

For a collection of papers in memory of Elwyn Berlekamp (1940-2019), John Conway (1937-2020), and Richard Guy (1916-2020). The Sprague-Grundy theory for finite games without cycles was extended to general finite games by Cedric Smith and by…

In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo-Euclidean space ($R^d$ with a metric of indefinite signature). We show that a…

The concept of nimbers--a.k.a. Grundy-values or nim-values--is fundamental to combinatorial game theory. Nimbers provide a complete characterization of strategic interactions among impartial games in their disjunctive sums as well as the…

We extend the classical notion of standardly stratified $k$-algebra (stated for finite dimensional $k$-algebras) to the more general class of rings, possibly without $1,$ with enough idempotents. We show that many of the fundamental…

We study two-player games with alternating moves played on infinite trees. Our main focus is on the case where the trees are full (regular) and the winning set is open (with respect to the product topology on the tree). Gale and Stewart…

Existence of superdecomposable pure-injective modules reflects complexity in the category of finite-dimensional representations over an algebra. Such an existence occurs when an algebra is non-domestic; a conjecture due to M. Prest. G.…

Two structures $A$ and $B$ are $n$-equivalent if player II has a winning strategy in the $n$-move Ehrenfeucht-Fra\"iss\'e game on $A$ and $B$. In earlier papers we studied $n$-equivalence classes of ordinals and coloured ordinals. In this…

A famous result due to L. S. Levy provides a classification of all finitely generated indecomposable modules over Dedekind-like rings. This motivates us to outline an approach to the classification of indecomposable pseudo-absorbing primary…

Subtraction games are a classical topic in Combinatorial Game Theory. A result of Golomb~(1966) shows that every subtraction game with a finite move set has an eventually periodic nim-sequence, but the known proof yields only an exponential…

This paper, and its companion [BCLV24], are devoted to a negative resolution of the Aldous--Lyons Conjecture [AL07, Ald07]. In this part we study tailored non-local games. This is a subclass of non-local games -- combinatorial objects which…

Seese's conjecture for finite graphs states that monadic second-order logic (MSO) is undecidable on all graph classes of unbounded clique-width. We show that to establish this it would suffice to show that grids of unbounded size can be…

We prove one direction of a recently posed conjecture by Gan-Gross-Prasad, which predicts the branching laws that govern restriction from p-adic $GL_n$ to $GL_{n-1}$ of irreducible smooth representations within the Arthur-type class. We…

It is shown that every continuous homomorphism of Arens-Michael algebras can be obtained as the limit of a morphism of certain projective systems consisting of Fr\'{e}chet algebras. Based on this we prove that a complemented subalgebra of…

We propose a unifying additive theory for standard conventions in Combinatorial Game Theory, including normal-, mis\`ere- and scoring-play, studied by Berlekamp, Conway, Dorbec, Ettinger, Guy, Larsson, Milley, Neto, Nowakowski, Renault,…

We introduce a new class of compact metrizable spaces, which we call fences, and its subclass of smooth fences. We isolate two families $\mathcal F, \mathcal F_0$ of Hasse diagrams of finite partial orders and show that smooth fences are…

We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every (possibly infinite) regular set F of finite…

We propose a novel constructive framework for approaching the Hodge Conjecture via explicit degenerations. Building on limiting mixed Hodge structures (LMHS), we formulate a criterion under which a rational class of type (p, p) on a smooth…

Two families of denotational models have emerged from the semantic analysis of linear logic: dynamic models, typically presented as game semantics, and static models, typically based on a category of relations. In this paper we introduce a…

This paper argues that the finite horizon paradox, where game theory contradicts intuition, stems from the limitations of standard number systems in modelling the cognitive perception of infinity. To address this issue, we propose a new…

Grothendieck-Verdier duality is a powerful and ubiquitous structure on monoidal categories, which generalises the notion of rigidity. Hopf algebroids are a generalisation of Hopf algebras, to a non-commutative base ring. Just as the…