Related papers: Transfer systems for rank two elementary Abelian g…

For a finite group $G$, $G$-transfer systems are combinatorial objects which encode the homotopy category of $G$-$N_\infty$ operads, whose algebras in $G$-spectra are $E_\infty$ $G$-spectra with a specified collection of multiplicative…

Transfer systems on finite posets have recently been gaining traction as a key ingredient in equivariant homotopy theory. Additionally, they also naturally occur in the data of a model structure. We give a complete characterization of all…

For a finite group $G$, the notion of a $G$-transfer system provides homotopy theorists with a combinatorial way to study equivariant objects. In this paper, we focus on the properties of transfer systems for non-abelian groups. We…

Transfer systems are combinatorial objects which classify $N_\infty$ operads up to homotopy. By results of A. Blumberg and M. Hill, every transfer system associated to a linear isometries operad is also saturated (closed under a particular…

For an ascending correspondence $F:X\to 2^X$ with chain-complete values on a complete lattice $X$, we prove that the set of fixed points is a complete lattice. This strengthens Zhou's fixed point theorem. For chain-complete posets that are…

Transfer systems are a combinatorial model for $N_{\infty}$-operads, which encode commutative structures in equivariant homotopy theory. Blumberg--Hill and Chan gave criteria for when two transfer systems are a compatible pair, meaning they…

We describe the reduced formal context of the lattice of saturated transfer systems on a finite abelian group. As an application, we compute that there are 13,784,538,270,571 saturated transfer systems on the elementary abelian group…

We show that the functor which assigns to an A-infinity morphism between isotopy classes of A-infinity algebras whose linear part is a chain homotopy equivalence its underlying chain map is a discrete Grothendieck bifibration. We then…

In this paper we study three classes of models widely used in physics, computer science and social science: the Chip Firing Game, the Abelian Sandpile Model and the Chip Firing Game on a mutating graph. We study the set of configurations…

We show how to perfectly transfer, without state initialization and remote collaboration, arbitrary functions in interacting boson lattices. We describe a possible implementation of state transfer through bosonic atoms trapped in optical…

We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…

Bi-incomplete Tambara functors over a group $G$ can be understood in terms of compatible pairs of $G$-transfer systems. In the case of $G = C_{p^n}$ , Hill, Meng and Li gave a necessary and sufficient condition for compatibility and…

Game theory provides a general mathematical background to study the effect of pair interactions and evolutionary rules on the macroscopic behavior of multi-player games where players with a finite number of strategies may represent a wide…

We find analytic models that can perfectly transfer, without state initializati$ or remote collaboration, arbitrary functions in two- and three-dimensional interacting bosonic and fermionic networks. We elaborate on a possible…

Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection between elements of a distributive lattice and the family of upper sets of an associated poset. Although not used explicitly, this result is at the backbone of the…

We give new characterizations of core imputations for the following games: * The assignment game. * Concurrent games, i.e., general graph matching games having non-empty core. * The unconstrained bipartite $b$-matching game (edges can be…

Saturation is a fundamental game-semantic property satisfied by strategies that interpret higher-order concurrent programs. It states that the strategy must be closed under certain rearrangements of moves, and corresponds to the intuition…

In our previous paper, we constructed and studied a functorial extension of the evaluation map $S^1 \times \mathcal{L}X \to X$ to transfers along finite covers. In this paper, we show that this induces a natural evaluation map on the full…

Let $G$ be a finite group acting on $\mathbb{C}^N$. We study the problem of identifyng the class in $\mathbb{C}^N / G$ of a given signal: this encompasses several types of problems in signal processing. Some instances include certain…

We develop the theory of transfer and norm maps for finite group schemes, extending classical results from finite group theory to a context where induction and restriction are not necessarily bi-adjoint. In the additive setting, we…