Related papers: A Simplified Game for Resolution of Singularities

We introduce a new method, involving infinite games and Borel determinacy, which we use to answer several well-known questions in Borel combinatorics.

We give canonical resolutions of singularities of several cone varieties arising from invariant theory. We establish a connection between our resolutions and resolutions of singularities of closure of conjugacy classes in classical Lie…

The purpose of this paper is to show how Rees algebras can be applied in the study of singularities embedded in smooth schemes over perfect fields. In particular, we will study situations in which the multiplicity of a hypersurface is a…

An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…

In this paper we will discuss scoring play games. We will give the basic definitions for scoring play games, and show that they form a well defined set, with clear and distinct outcome classes under these definitions. We will also show that…

We solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behavior in the results of our computations, that seems to encourage odd or maximal bids.

Let $X$ be an integral affine or projective scheme of finite presentation over a perfect field. We prove that $X$ admits a resolution, that is, there exists a smooth scheme $\widetilde X$ and a projective birational morphism from…

Absolute combinatorial game theory was recently developed as a unifying tool for constructive/local game comparison (Larsson et al. 2018). The theory concerns {\em parental universes} of combinatorial games; standard closure properties are…

We discuss Hironaka's theorem on resolution of singularities in charactetistic 0 as well as more recent progress, both on simplifying and improving Hironaka's method of proof and on new results and directions on families of varieties,…

We describe combinatorial aspects of classical resolution of singularities that are free of characteristic and can be applied to singular foliations and vector fields as well as to functions and varieties. In particular, we give a…

The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent…

This paper is devoted to give all the technical constructions and definitions that will lead to the construction of an algorithm of resolution of singularities for binomial ideals. We construct a resolution function that will provide a…

We exhibit an explicit formula for the cardinality of solutions to a class of quadratic matrix equations over finite fields. We prove that the orbits of these solutions under the natural conjugation action of the general linear groups can…

We give a combinatorial algorithm for equivariant embedded resolution of singularities of a toric variety defined over a perfect field. The algorithm is realized by a finite succession of blowings-up with smooth invariant centres that…

We present a simple proof of the well-known fact concerning the number of solutions of diagonal equations over finite fields. In a similar manner, we give an alternative proof of the recent result on generalizations of Carlitz equations. In…

Modern board games are a rich source of interesting and new challenges for combinatorial problems. The game Nmbr9 is a solitaire style puzzle game using polyominoes. The rules of the game are simple to explain, but modelling the game…

In this work, we study a triangular variant of the Lights Out game, proposed in the 2025 Capixaba Mathematics Olympiad. We present a combinatorial description of the game, formally characterize its operations, and introduce the notion of a…

We define a two-player combinatorial game in which players take alternate turns; each turn consists on deleting a vertex of a graph, together with all the edges containing such vertex. If any vertex became isolated by a player's move then…

The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games,…

This paper proposes seven combinatorial problems around formulas for the characteristic polynomial and the spectral numbers of a quasihomogeneous singularity. One of them is a new conjecture on the characteristic polynomial. It is an…