◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Naryshkin

13 papers hereh-index 6103 citations17 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3
  • first author4
  • middle author3
  • last author3

Across the 13 of 13 papers where every author was matched, so the position is known.

fields
  • math.DS6
  • math.OA4
  • math.AP1
  • math.GR1
  • math.LO1

identity via Semantic Scholar / OpenAlex

activity
20182025
most citedElementary amenability and almost finiteness

2 citations · 5 across the 12 of their papers we have counts for

collaborators
Showing 2025 · math.LOShow all

1 paper · 2 filters

math.LO2025

Hyper-u-amenablity and Hyperfiniteness of Treeable Equivalence Relations

Petr Naryshkin, Andrea Vaccaro

We introduce the notions of u-amenability and hyper-u-amenability for countable Borel equivalence relations, strong forms of amenability that are implied by hyperfiniteness. We sho…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.