Related papers: Asymptotic dimension, decomposition complexity, an…

In this manuscript, we define and study probabilistic values for cooperative games on simplicial complexes. Inspired by the work of Weber "Probabilistic values for games", we establish the new theory step by step, following the classical…

We define the direct sum of a countable family of pointed metric spaces in a way resembling the direct sum of groups. Then we prove that if a family consists of $0$-hyperbolic (in the sense of Gromov) and $D$-discrete spaces, then its…

The aim of this paper is to investigate properties preserved and co-preserved by coarsely $n$-to-1 functions, in particular by the quotient maps $X\to X/\sim$ induced by a finite group $G$ acting by isometries on a metric space $X$. The…

In view of the complexity of the dynamics of learning in games, we seek to decompose a game into simpler components where the dynamics' long-run behavior is well understood. A natural starting point for this is Helmholtz's theorem, which…

This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…

Let $A$, $B$ be C*-algebras; $A$ separable, $B$ $\sigma$-unital and stable. We introduce a notion of translation invariance for asymptotic homomorphisms from $SA=C_0(\mathbb R)\otimes A$ to $B$ and show that the Connes-Higson construction…

We prove that the countable intersection of $C^1$-diffeomorphic images of certain Diophantine sets has full Hausdorff dimension. For example, we show this for the set of badly approximable vectors in $\mathbb{R}^d$, improving earlier…

In this article we survey the development of generic and coarse computability and the main results on how classical asymptotic density interacts with the theory of computability.

In 2013 Bettin and Conrey have introduced a cotangent sum $c \colon \mathbb{Q}_{>0}\to \mathbb{R}$, which can be regarded as a variant of the Dedekind sum. They have discovered that the cotangent sum satisfies a kind of reciprocity laws.…

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

A systematic framework for analyzing dynamical attributes of games has not been well-studied except for the special class of potential or near-potential games. In particular, the existing results have shortcomings in determining the…

We present the notion of separable game with respect to a forward directed hypergraph (FDH-graph), which refines and generalizes that of graphical game. First, we show that there exists a minimal FDH-graph with respect to which a game is…

We define a notion of complexity, which quantifies the nonlinearity of the computation of a neural network, as well as a complementary measure of the effective dimension of feature representations. We investigate these observables both for…

The conception of C- and H-representations of any holomorphic function is further extended to the notions, definitions, lemmas and theorems of the complex integration. On this basis and the introduced notion of a H-plane, generalising the…

In this work, we introduce the notion of Gevrey asymptotic expansion and we show how the classical concept of a convergent power series can be generalized to include the case in which the radius of convergence is zero. This technique can be…

We introduce matrix algebra of subsets in metric spaces and we apply it to improve results of Yamauchi and Davila regarding Asymptotic Property C. Here is a representative result: Suppose $X$ is an $\infty$-pseudo-metric space and $n\ge 0$…

We introduce the notion of asymptotic cohomology based on the bounded cohomology and define cohomological asymptotic dimension $\as_{\Z} X$ of metric spaces. We show that it agrees with the asymptotic dimension $\as X$ when the later is…

Once failure is irreversible, continuation payoffs cannot be meaningfully aggregated across strategies that differ in their survival properties. Standard scalar evaluation sidesteps this by arbitrarily completing payoffs beyond termination,…

The decomposition into interaction subspaces is a hierarchical decomposition of the spaces of cylindrical functions of a finite product space, also called factor spaces. It is an important construction in graphical models and a standard way…

Decomposition complexity for metric spaces was recently introduced by Guentner, Tessera, and Yu as a natural generalization of asymptotic dimension. We prove a vanishing result for the continuously controlled algebraic K-theory of bounded…