相关论文: Asymptotic dimension, decomposition complexity, an…

I survey methods from differential geometry, algebraic geometry and representation theory relevant for the permanent v. determinant problem from computer science, an algebraic analog of the P v. NP problem.

The notion of a derived A-infinity algebra, considered by Sagave, is a generalization of the classical notion of A-infinity algebra, relevant to the case where one works over a commutative ring rather than a field. We initiate a study of…

Abductive reasoning is a non-monotonic formalism stemming from the work of Peirce. It describes the process of deriving the most plausible explanations of known facts. Considering the positive version asking for sets of variables as…

We present an overview of a theory of complex dimensions of self-similar fractal strings, and compare this theory to the theory of varieties over a finite field from the geometric and the dynamical point of view. Then we combine the several…

This paper introduces a geometric framework for analyzing power relations in games, independent of their strategic form. We define a canonical preference space where each player's relational stance is a normalized vector. This model…

A $C^*$-algebra $A$ is said to have the homotopy lifting property if for all $C^*$-algebras $B$ and $E$, for every surjective $^*$-homomorphism $\pi \colon E \rightarrow B$ and for every $^*$-homomorphism $\phi \colon A \rightarrow E$, any…

We study selective and game-theoretic versions of properties like the ccc, weak Lindel\"ofness and separability, giving various characterizations of them and exploring connections between these properties and some classical cardinal…

We treat the classical notion of convexity in the context of hard real analysis. Definitions of the concept are given in terms of defining functions and quadratic forms, and characterizations are provided of different concrete notions of…

The Hardy-Morrey spaces related to Laplace-Bessel differential equations are introduced in terms of maximal functions. The atomic decomposition theory which has the same cancellation properties of the…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

Here we present a decomposition technique for a class of differential games. The technique consists in a decomposition of the target set which produces, for geometrical reasons, a decomposition in the dimensionality of the problem. Using…

We develop a dynamical version of some of the theory surrounding the Toms-Winter conjecture for simple separable nuclear C*-algebras and study its connections to the C*-algebra side via the crossed product. We introduce an analogue of…

A basic problem in quantizing a field in curved space is the decomposition of the classical modes in positive and negative frequency. The decomposition is equivalent to a choice of a complex structure in the space of classical solutions. In…

In this paper we build off of Takahashi and White's $\mathcal{P}_C$-projective dimension and $\mathcal{I}_C$-injective dimension to define these dimensions for when $C$ is a semidaulizing complex. We develop the framework for these…

Decomposition and abstraction is an essential component of computational thinking, yet it is not always emphasized in introductory programming courses. In addition, as generative AI further reduces the focus on syntax and increases the…

A solution concept on a class of transferable utility coalitional games is a multifunction satisfying given criteria of economic rationality. Every solution associates a set of payoff allocations with a coalitional game. This general…

We define the notion of localizable property for a dynamical system. Then we survey three properties of complexity and relate how they are known to be typical among differentiable dynamical systems. These notions are the fast growth of the…

We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…

We show that coarse property C is preserved by finite coarse direct products. We also show that the coarse analog of Dydak's countable asymptotic dimension is equivalent to the coarse version of straight finite decomposition complexity and…

Value methods for solving stochastic games with partial observability model the uncertainty about states of the game as a probability distribution over possible states. The dimension of this belief space is the number of states. For many…