◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Péter Vrana

41 papers hereh-index 16709 citations45 works total

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

author position
  • sole author10
  • first author7
  • middle author10
  • last author13

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

fields
  • quant-ph23
  • math-ph5
  • math.CO4
  • cs.CC2
  • cs.IT2
  • cond-mat.mes-hall1
same name
  • Péter Vrana — 4 papers, h 1
  • Péter Vrana — 2 papers

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20082026
most citedThree fermions with six single particle states can be entangled in two inequivalent ways

64 citations · 436 across the 35 of their papers we have counts for

collaborators
Showing math.COShow all

4 papers · 1 filter

math.CO2019

The asymptotic induced matching number of hypergraphs: balanced binary strings

Srinivasan Arunachalam, Péter Vrana, Jeroen Zuiddam

We compute the asymptotic induced matching number of the k-partite k-uniform hypergraphs whose edges are the k-bit strings of Hamming weight k/2, for any large enough even…

math.CO2019

Probabilistic refinement of the asymptotic spectrum of graphs

Péter Vrana

The asymptotic spectrum of graphs, introduced by Zuiddam (arXiv:1807.00169, 2018), is the space of graph parameters that are additive under disjoint union, multiplicative under the…

math.CO2017★ 5 cited

Universal points in the asymptotic spectrum of tensors

Matthias Christandl, Péter Vrana, Jeroen Zuiddam

The asymptotic restriction problem for tensors is to decide, given tensors s and t, whether the nth tensor power of s can be obtained from the (n+o(n))th tensor power of t…

math.CO2016★ 14 cited

Asymptotic tensor rank of graph tensors: beyond matrix multiplication

Matthias Christandl, Péter Vrana, Jeroen Zuiddam

We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family of tensors defined by the complete graph on k vertices. For k≥4, we show…

◍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.