Search arXivSearch

arXiv · 2512.05302

On Matsushita $π_1^2$ discrete fundamental groups

Abstract

The Matsushita fundamental groups of a graph $X$, denoted $π_1^r(X)$, are certain discrete versions of the fundamental group for topological spaces. For $r=2$, these groups have a nice combinatorial description, due to Sankar. In this paper we prove two results about $π_1^2$. First, we prove a Seifert-van Kampen-type theorem. Similar results have previously been obtained by Barcelo, et al. (and strengthened by Kapulkin and Mavinkurve) for a different notion of discrete fundamental group. Second, we prove that an arbitrary group $G$ can be realized as $π_1^2(X)$ for some graph $X$. Our construction works equally well for the aforementioned alternate discrete fundamental group $A_1(X)$, and our second result thus also provides an entirely different method of proof for a theorem of Kapulkin and Mavinkurve.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mike Krebs, Alan Pan, Anand Prakash. 2026-01-06. On Matsushita $π_1^2$ discrete fundamental groups. https://arxiv.org/abs/2512.05302

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO