BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Graph explorer

Completely bounded kernels

We introduce completely bounded kernels taking values in L(A,B) where A and B are C*-algebras. We show that if B is injective such kernels have a Kolmogorov decomposition precisely when they can be scaled to be completely contractive, and that this is automatic when the index set is countable.

6 nodes5 linksoverview previewCompletely bounded kernels
SearchCollections
6 nodes5 links
Completely bounded kernels6 visible / 6 total nodes / 8 links
Co-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipTopic signalTopic signalWCompletely bounded kernelspreprint / 2012ATirthankar BhattacharyyaResearcherAMichael A. DritschelResearcherAChristopher S. ToddResearcherTmath.FA4066 worksTmath.OA1227 works
PaperSignal 105 links

Completely bounded kernels

preprint / 2012

Open

Personal maps

Sign in to save graph views

Saved views keep the query, focus and filters attached to this map.

Sign in

Public snapshots

1 shared view(s)