Skip to content

Author

Alper Ferudun

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#edge computing Open access Sep 2026

Finite Bipartite Graphs as Induced Subgraphs of Subfactor Principal Graphs

Every finite bipartite simple graph occurs as a vertex-induced unrooted subgraph of the principal graph of an irreducible finite-depth inclusion of hyperfinite type II1 factors. For part sizes m and n, an explicit neighborhood-multiplicity parameter q gives index q3^n, with q at most m+1, and depth at most four. The se...

Alper Ferudun · 0 citations
#edge computing Open access Sep 2026

Finite Bipartite Graphs as Induced Subgraphs of Subfactor Principal Graphs

Every finite bipartite simple graph occurs as a vertex-induced unrooted subgraph of the principal graph of an irreducible finite-depth inclusion of hyperfinite type II1 factors. For part sizes m and n, an explicit neighborhood-multiplicity parameter q gives index q3^n, with q at most m+1, and depth at most four. The se...

Alper Ferudun · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.