378 research outputs found
Four problems regarding representable functors
Let , be two rings, an -coring and the
category of left -comodules. The category of all representable functors is shown to be equivalent to the opposite of the
category . For an -bimodule we give
necessary and sufficient conditions for the induction functor to be: a representable functor, an
equivalence of categories, a separable or a Frobenius functor. The latter
results generalize and unify the classical theorems of Morita for categories of
modules over rings and the more recent theorems obtained by Brezinski,
Caenepeel et al. for categories of comodules over corings.Comment: 16 pages, the second versio
Sound and complete axiomatizations of coalgebraic language equivalence
Coalgebras provide a uniform framework to study dynamical systems, including
several types of automata. In this paper, we make use of the coalgebraic view
on systems to investigate, in a uniform way, under which conditions calculi
that are sound and complete with respect to behavioral equivalence can be
extended to a coarser coalgebraic language equivalence, which arises from a
generalised powerset construction that determinises coalgebras. We show that
soundness and completeness are established by proving that expressions modulo
axioms of a calculus form the rational fixpoint of the given type functor. Our
main result is that the rational fixpoint of the functor , where is a
monad describing the branching of the systems (e.g. non-determinism, weights,
probability etc.), has as a quotient the rational fixpoint of the
"determinised" type functor , a lifting of to the category of
-algebras. We apply our framework to the concrete example of weighted
automata, for which we present a new sound and complete calculus for weighted
language equivalence. As a special case, we obtain non-deterministic automata,
where we recover Rabinovich's sound and complete calculus for language
equivalence.Comment: Corrected version of published journal articl
The universality of the shift of the Chern-Simons parameter for a general class of BRS invariant regularizations
We consider a biparametric family of BRS invariant regularization methods of
SU(N) Chern-Simons theory (the parameters defining the family taking arbitrary
values in \RR^2) and show that the shift of the
Chern-Simons parameter occurs for arbitrary values of the family defining
parameters. This supports irrefutably the conjecture that the shift of is
universal for BRS invariant regulators.Comment: phyzzx, 7 pages (no figures
Categorification of persistent homology
We redevelop persistent homology (topological persistence) from a categorical
point of view. The main objects of study are diagrams, indexed by the poset of
real numbers, in some target category. The set of such diagrams has an
interleaving distance, which we show generalizes the previously-studied
bottleneck distance. To illustrate the utility of this approach, we greatly
generalize previous stability results for persistence, extended persistence,
and kernel, image and cokernel persistence. We give a natural construction of a
category of interleavings of these diagrams, and show that if the target
category is abelian, so is this category of interleavings.Comment: 27 pages, v3: minor changes, to appear in Discrete & Computational
Geometr
The chameleon groups of Richard J. Thompson: automorphisms and dynamics
The automorphism groups of several of Thompson's countable groups of
piecewise linear homeomorphisms of the line and circle are computed and it is
shown that the outer automorphism groups of these groups are relatively small.
These results can be interpreted as stability results for certain structures of
PL functions on the circle. Machinery is developed to relate the structures on
the circle to corresponding structures on the line
Characterizing Van Kampen Squares via Descent Data
Categories in which cocones satisfy certain exactness conditions w.r.t.
pullbacks are subject to current research activities in theoretical computer
science. Usually, exactness is expressed in terms of properties of the pullback
functor associated with the cocone. Even in the case of non-exactness,
researchers in model semantics and rewriting theory inquire an elementary
characterization of the image of this functor. In this paper we will
investigate this question in the special case where the cocone is a cospan,
i.e. part of a Van Kampen square. The use of Descent Data as the dominant
categorical tool yields two main results: A simple condition which
characterizes the reachable part of the above mentioned functor in terms of
liftings of involved equivalence relations and (as a consequence) a necessary
and sufficient condition for a pushout to be a Van Kampen square formulated in
a purely algebraic manner.Comment: In Proceedings ACCAT 2012, arXiv:1208.430
The effect of discrete vs. continuous-valued ratings on reputation and ranking systems
When users rate objects, a sophisticated algorithm that takes into account
ability or reputation may produce a fairer or more accurate aggregation of
ratings than the straightforward arithmetic average. Recently a number of
authors have proposed different co-determination algorithms where estimates of
user and object reputation are refined iteratively together, permitting
accurate measures of both to be derived directly from the rating data. However,
simulations demonstrating these methods' efficacy assumed a continuum of rating
values, consistent with typical physical modelling practice, whereas in most
actual rating systems only a limited range of discrete values (such as a 5-star
system) is employed. We perform a comparative test of several co-determination
algorithms with different scales of discrete ratings and show that this
seemingly minor modification in fact has a significant impact on algorithms'
performance. Paradoxically, where rating resolution is low, increased noise in
users' ratings may even improve the overall performance of the system.Comment: 6 pages, 2 figure
The Intrinsic Fundamental Group of a Linear Category
We provide an intrinsic definition of the fundamental group of a linear
category over a ring as the automorphism group of the fibre functor on Galois
coverings. If the universal covering exists, we prove that this group is
isomorphic to the Galois group of the universal covering. The grading deduced
from a Galois covering enables us to describe the canonical monomorphism from
its automorphism group to the first Hochschild-Mitchell cohomology vector
space.Comment: Final version, to appear in Algebras and Representation Theor
On the Quantization of the Chern-Simons Fields Theory on Curved Space-Times: the Coulomb Gauge Approach
We consider here the Chern-Simons field theory with gauge group SU(N) in the
presence of a gravitational background that describes a two-dimensional
expanding ``universe". Two special cases are treated here in detail: the
spatially flat {\it Robertson-Walker} space-time and the conformally static
space-times having a general closed and orientable Riemann surface as spatial
section. The propagator and the vertices are explicitely computed at the lowest
order in perturbation theory imposing the Coulomb gauge fixing.Comment: 15 pp., Preprint LMU-TPW 93-5, (Plain TeX + Harvmac
Faces of matrix models
Partition functions of eigenvalue matrix models possess a number of very
different descriptions: as matrix integrals, as solutions to linear and
non-linear equations, as tau-functions of integrable hierarchies and as
special-geometry prepotentials, as result of the action of W-operators and of
various recursions on elementary input data, as gluing of certain elementary
building blocks. All this explains the central role of such matrix models in
modern mathematical physics: they provide the basic "special functions" to
express the answers and relations between them, and they serve as a dream model
of what one should try to achieve in any other field.Comment: 10 page
- …