output
20042025
most citedEfficient Distributed Quantum Computing

217 citations

Showing 2022Show all

11 papers · 1 filter

math.CO2022★ 6 cited

Invertibility of digraphs and tournaments

Noga Alon, Emil Powierski, Michael Savery +2

For an oriented graph and a set , the inversion of in is the digraph obtained by reversing the orientations of the edges of with both endpoints in…

math.NT2022

Abelian varieties over finite fields and their groups of rational points

Stefano Marseglia, Caleb Springer

We study the groups of rational points of abelian varieties defined over a finite field whose endomorphism rings are commutative, or, equivalently, whose isogeny cl…

cond-mat.str-el2022★ 20 cited

Bulk-boundary correspondence and singularity-filling in long-range free-fermion chains

Nick G. Jones, Ryan Thorngren, Ruben Verresen

The bulk-boundary correspondence relates topologically-protected edge modes to bulk topological invariants, and is well-understood for short-range free-fermion chains. Although cas…

math.CO2022

Shotgun assembly of random graphs

Tom Johnston, Gal Kronenberg, Alexander Roberts +1

In the graph shotgun assembly problem, we are given the balls of radius around each vertex of a graph and asked to reconstruct the graph. We study the shotgun assembly of the E…

cs.CC2022

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs

Matthew Johnson, Barnaby Martin, Siani Smith +3

We show that Edge Multiway Cut (also called Multiterminal Cut) and Node Multiway Cut are NP-complete on graphs of maximum degree (also known as subcubic graphs). This improves…

math.CO2022★ 4 cited

The rainbow saturation number is linear

Natalie Behague, Tom Johnston, Shoham Letzter +2

Given a graph , we say that an edge-coloured graph is -rainbow saturated if it does not contain a rainbow copy of , but the addition of any non-edge in any colour crea…