English
Related papers

Related papers: Hereditarily indecomposable continua as generic ma…

200 papers

The Game of Cycles is a combinatorial game introduced by Francis Su in 2020 in which players take turns marking arrows on the edges of a simple plane graph, avoiding the creation of sinks and sources and seeking to complete a "cycle cell."…

Combinatorics · Mathematics 2022-05-31 Bryant G. Mathews

We generalize the classical Tanaka result on the finiteness of symmetry algebra for non-degenerate pseudo-product structures to the case when the completely-integrable distributions defining the pseudo-product structure are no longer…

Differential Geometry · Mathematics 2026-05-19 Boris Doubrov , Igor Zelenko

An $n$-player game $X$ in normal form can be modeled via undirected discrete graphical models where the discrete random variables represent the players and their state spaces are the set of pure strategies. There exists an edge between the…

Algebraic Geometry · Mathematics 2024-06-27 Irem Portakal , Javier Sendra-Arranz

Game comonads provide a categorical syntax-free approach to finite model theory, and their Eilenberg-Moore coalgebras typically encode important combinatorial parameters of structures. In this paper, we develop a framework whereby the…

Logic in Computer Science · Computer Science 2024-02-14 Samson Abramsky , Luca Reggio

Combinatorial games are played under two different play conventions: normal play, where the last player to move wins, and \mis play, where the last player to move loses. Combinatorial games are also classified into impartial positions and…

Combinatorics · Mathematics 2010-08-25 Meghan Rose Allen

Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…

Differential Geometry · Mathematics 2025-05-09 Jonathan Kress , Konrad Schöbel , Andreas Vollmer

We develop the theory of module categories over a Grothendieck-Verdier category, i.e. a monoidal category with a dualizing object and hence a duality structure more general than rigidity. Such a category C comes with two monoidal structures…

Category Theory · Mathematics 2024-06-03 Jürgen Fuchs , Gregor Schaumann , Christoph Schweigert , Simon Wood

The concept of biased Maker-Breaker games, introduced by Chv\'atal and Erd{\H o}s, is a central topic in the field of positional games, with deep connections to the theory of random structures. For any given hypergraph ${\cal H}$ the main…

Combinatorics · Mathematics 2018-08-06 Christopher Kusch , Juanjo Rué , Christoph Spiegel , Tibor Szabó

We present a unified apoach to the study of separable and Frobenius algebras. The crucial observation is thsat both cases are related to the nonlinear equation $R^{12}R^{23}=R^{23}R^{13}=R^{13}R^{12}$, called the FS-equation. Given a…

Quantum Algebra · Mathematics 2009-09-25 S. Caenepeel , B. Ion , G. Militaru

Let $X$ be a projective smooth geometrically connected curve defined over a finite field $\mathbb{F}_q$ of cardinality $q$. Let $S$ be a finite set of closed points of $X$. Let $\bar{X}$ and $\bar{S}$ be the base change of $X$, $S$ to an…

Algebraic Geometry · Mathematics 2024-07-23 Hongjie Yu

We prove a theorem computing the number of solutions to a system of equations which is generic subject to the sparsity conditions embodied in a graph. We apply this theorem to games obeying graphical models and to extensive-form games. We…

Commutative Algebra · Mathematics 2007-05-23 Ruchira S. Datta

Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…

Logic in Computer Science · Computer Science 2023-11-28 Jan Dreier , Nikolas Mählmann , Sebastian Siebertz , Szymon Toruńczyk

Let M be a filtered module. Some properties of elements of M are "generic" in the following sense: (being open/stable) if an element z of M has a property P then any approximation of z has P; (being dense) any element of M is approximated…

Commutative Algebra · Mathematics 2019-10-15 Dmitry Kerner

A number of model-comparison games central to (finite) model theory, such as pebble and Ehrenfeucht-Fra\"{i}ss\'{e} games, can be captured as comonads on categories of relational structures. In particular, the coalgebras for these comonads…

Logic in Computer Science · Computer Science 2025-05-07 Samson Abramsky , Thomas Laure , Luca Reggio

A hyperbolic transcendental entire function with connected Fatou set is said to be "of disjoint type". It is known that a disjoint-type function provides a model for the dynamics near infinity of all maps in the same parameter space; hence…

Dynamical Systems · Mathematics 2026-03-05 Lasse Rempe

S. Garcia-Ferreira and H. Ohta gave a construction that was intended to produce a tau-pseudocompact space, which has a regular-closed zero set A and a regular-closed C-embedded set B such that neither A nor B is tau-pseudocompact. We show…

General Topology · Mathematics 2009-03-14 Jerry E. Vaughan

We prove that any category of props in a symmetric monoidal model category inherits a model structure. We devote an appendix, about half the size of the paper, to the proof of the model category axioms in a general setting. We need the…

Algebraic Topology · Mathematics 2010-02-17 Benoit Fresse

One of the algebraic structures that has emerged recently in the study of the operator product expansions of chiral fields in conformal field theory is that of a Lie conformal algebra [K]. A Lie pseudoalgebra is a generalization of the…

Quantum Algebra · Mathematics 2007-05-23 B. Bakalov , A. D'Andrea , V. G. Kac

The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…

Logic in Computer Science · Computer Science 2025-06-26 Georg Schindling

We study first-order as well as infinitary logics extended with quantifiers closed upwards under embeddings. In particular, we show that if a chain of quasi-homogeneous structures is sufficiently long then a given formula of such a logic is…

Logic · Mathematics 2014-07-04 Jevgeni Haigora , Kerkko Luosto