Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2408.03431

Compactifications of phylogenetic systems and species of electrical networks

Satyan L. Devadoss·Stefan Forcey
View original source ↗Read source document ↗Export metadata ↓

Abstract

We describe new spaces and maps. Our graphical map is a visual and numerical correspondence between spaces of circular electrical networks and circular planar split systems. When restricted to the planar circular electrical case, this graphical map finds the split system uniquely associated with the Kalmanson resistance distance of the dual network, matching the induced split system familiar from phylogenetics. This correspondence is extended to compactifications of the respective spaces, taking cactus networks to the cactus split systems defined herein. The graphical map preserves both network components and cactus structure, allowing an elegant enumeration of induced phylogenetic split systems via combinatorial species. We introduce the global spaces of circular planar electrical networks and circular split systems. These new spaces are also CW complexes, but the 0-cells of each are counted by the Bell numbers as opposed to the Catalan numbers. As species, the two sorts of global cacti are seen to be compositions in complementary ways.

Explore related subjects

math.COq-bio.PE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Satyan L. Devadoss, Stefan Forcey. 2025-05-29. Compactifications of phylogenetic systems and species of electrical networks. https://arxiv.org/abs/2408.03431

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗