Suguru Ishibashi | Searcharxiv

arXiv2024

Betti numbers and torsions in homology groups of double coverings

Papadima and Suciu proved an inequality between the ranks of the cohomology groups of the Aomoto complex with finite field coefficients and the twisted cohomology groups, and conjectured that they are actually equal for certain cases associated with the Milnor fiber of the arrangement. Recently, an arrangement (the icosidodecahedral arrangement) with the following two peculiar properties was found: (i) the strict version of Papadima-Suciu's inequality holds, and (ii) the first integral homology of the Milnor fiber has a non-trivial $2$-torsion. In this paper, we investigate the relationship between these two properties for double covering spaces. We prove that (i) and (ii) are actually equivalent.

math.GT↗

arXiv2023

Characterizing Reaction Route Map of Realistic Molecular Reactions based on Weight Rank Clique Filtration of Persistent Homology

A reaction route map (RRM) constructed using the GRRM program is a collection of elementary reaction pathways, each of which comprises two equilibrium (EQ) geometries and one transition state (TS) geometry connected by an intrinsic reaction coordinate (IRC). An RRM can be mathematically represented by a graph with weights assigned to both vertices, corresponding to EQs, and edges, corresponding to TSs, representing the corresponding energies. In this study, we propose a method to extract topological descriptors of a weighted graph representing an RRM based on persistent homology (PH). The work of Mirth et al. [J. Chem. Phys. 2021, 154, 114114], in which PH analysis was applied to the (3N-6)-dimensional potential energy surface of an N atomic system, is related to the present method, but our method is practically applicable to realistic molecular reactions. Numerical assessments revealed that our method can extract the same information as the method proposed by Mirth et al. for the 0-th and 1-st PHs, except for the death of the 1-st PH. In addition, the information obtained from the 0-th PH corresponds to the analysis using the disconnectivity graph. The results of this study suggest that the descriptors obtained using the proposed method accurately reflect the characteristics of the chemical reactions and/or physicochemical properties of the system.

physics.chem-ph↗

arXiv2023

Finite record sets of chip-firing games

A finite graph with an assignment of non-negative integers to vertices gives chip-firing games. Chip-firing games determine languages (sets of words) called the record sets of legal games. Björner, Lovász and Shor found several properties that are satisfied by record sets. In this paper, we will find two more properties of record sets. Under the assumption that the record set is finite and the game fires only two vertices, these properties characterize the record sets of graphs.

math.CO↗