Related papers: Norm functors and effective zero cycles

We provide several tests to determine whether a game is a potential game or whether it is a zero-sum equivalent game---a game which is strategically equivalent to a zero-sum game in the same way that a potential game is strategically…

We pursue the study of families of functions on the natural numbers, with emphasis here on the bounded families. The situation being more complicated than the unbounded case, we attack the problem by classifying the families according to…

An operator convex function on (0,\infty) which satisfies the symmetry condition k(1/x) = x k(x) can be used to define a type of non-commutative multiplication by a positive definite matrix (or its inverse) using the primitive concepts of…

The completely bounded trace and spectral norms in finite dimensions are shown to be expressible by semidefinite programs. This provides an efficient method by which these norms may be both calculated and verified, and gives alternate…

This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead of defining equivalence transformations directly on programs,…

The K-theory of a functor may be viewed as a relative version of the K-theory of a ring. In the case of a Galois extension of a number field F/L with rings of integers A/B respectively, this K-theory of the "norm functor" is an extension of…

In this paper we develop the theory of topological categories over a base category, that is, a theory of topological functors. Our notion of topological functor is similar to (but not the same) the existing notions in the literature (see…

Let M be a monoidal category endowed with a distinguished class of weak equivalences and with appropriately compatible classifying bundles for monoids and comonoids. We define and study homotopy-invariant notions of normality for maps of…

We introduce a new method to study mixed characteristic deformation of line bundles. In particular, for sufficiently large smooth projective families $f : \mathscr{X} \to \mathscr{S}$ defined over the ring of $N$-integers…

For a class of linear maps on a von Neumann factor, we associate two objects, bounded operators and trace class operators, both of which play the roles of Choi matrices. Each of them is positive if and only if the original map on the factor…

This article examines a family of smooth mappings between Banach spaces and establishes conditions for the existence of their zeros. Applications to fixed-point problems and the Implicit Function Theorem are also discussed.

In contrast to engineering applications, in which the structure of control laws are designed to satisfy prescribed function requirements, in biology it is often necessary to infer gene-circuit function from incomplete data on gene-circuit…

Using tools from computable analysis we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural…

Short cycles connectivity is a generalization of ordinary connectivity. Instead by a path (sequence of edges), two vertices have to be connected by a sequence of short cycles, in which two adjacent cycles have at least one common vertex. If…

The results of the renormalization group are commonly advertised as the existence of power law singularities near critical points. The classic predictions are often violated and logarithmic and exponential corrections are treated on a…

In this paper, we employ the theory of normal families in several complex variables to obtain some uniqueness theorems for entire functions. These results extend the related works of Li and Yi [11], and Lu et al. [18] to the setting of…

For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching. There is extensive literature…

We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

Lenses may be characterised as objects in the category of algebras over a monad, however they are often understood instead as morphisms, which propagate updates between systems. Working internally to a category with pullbacks, we define…

Classically, there are two model category structures on coalgebras in the category of chain complexes over a field. In one, the weak equivalences are maps which induce an isomorphism on homology. In the other, the weak equivalences are maps…