相关论文: Asymptotic dimension, decomposition complexity, an…
We introduce the notion of a complex cell, a complexification of the cells/cylinders used in real tame geometry. For $\delta\in(0,1)$ and a complex cell $\mathcal{C}$ we define its holomorphic extension…
Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…
A new, extended nonlinear framework of the ordinary real analysis incorporating a novel concept of {\em duality structure} and its applications into various nonlinear dynamical problems is presented. The duality structure is an asymptotic…
Cylindrical algebraic decomposition is a classical construction in real algebraic geometry. Although there are many algorithms to compute a cylindrical algebraic decomposition, their practical performance is still very limited. In this…
Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and nonstrategic components. In this paper we study the issue of decomposing games that are strategically equivalent from a…
Gravitational waves with a space-translation Killing field are considered. In this case, the 4-dimensional Einstein vacuum equations are equivalent to the 3-dimensional Einstein equations with certain matter sources. This interplay between…
This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with linear dimension and…
We introduce a geometric property complementary-finite asymptotic dimension (coas- dim). Similar with asymptotic dimension, we prove the corresponding coarse invariant theorem, union theorem and Hurewicz-type theorem.
In the 1980s, category theorists introduced the Lawvere-Tierney $(\leq_{\mathrm{LT}})$ order in the Effective Topos, known to effectively embed the Turing degrees. Understanding its structure is a longstanding open problem in the area. In…
We develop the theory of CW(A)-complexes, which generalizes the classical theory of CW-complexes, keeping the geometric intuition of J.H.C. Whitehead's original theory. We obtain this way generalizations of classical results, such as…
To understand the complexity of the dynamic of learning in differential games, we decompose the game into components where the dynamic is well understood. One of the possible tools is Helmholtz's theorem, which can decompose a vector field…
M. Goresky and R. MacPherson intersection homology is also defined from the singular chain complex of a filtered space by H. King, with a key formula to make selections among singular simplexes. This formula needs a notion of dimension for…
We prove an Asymptotic Implicit Function Theorem in the setting of Gevrey asymptotics with respect to a parameter. The unique implicitly defined solution admits a Gevrey asymptotic expansion and furthermore it is the Borel resummation of…
In this paper we try to find a computational interpretation for a strong form of extensionality, which we call "converse extensionality". Converse extensionality principles, which arise as the Dialectica interpretation of the axiom of…
Attribute-driven software architecture design aims to provide decision support by taking into account the quality attributes of softwares. A central question in this process is: What architecture design best fulfills the desirable software…
In this paper the complexity of provability of polarized additive, multiplicative, and exponential formulas in the (initial) Cockett-Seely polarized game logic is discussed. The complexity is ultimately based on the complexity of finding a…
There are several classical characterisations of the valuative dimension of a commutative ring. Constructive versions of this dimension have been given and proven to be equivalent to the classical notion within classical mathematics, and…
We introduce and investigate a range of general notions of a game. Our principal notion is based on a set of agents modifying a relational structure in a discrete evolution sequence. We also introduce and study a variety of ways to model…
It is well-known that a paracompact space $X$ is of covering dimension at most $n$ if and only if any map $f\colon X\to K$ from $X$ to a simplicial complex $K$ can be pushed into its $n$-skeleton $K^{(n)}$. We use the same idea to…
We introduce and study a dimensional-like characteristic of an uniformly almost periodic function, which we call the Diophantine dimension. By definition, it is the exponent in the asymptotic behavior of the inclusio length. Diophantine…