arXiv subjects

Ken Nakashima

Publications and source records attributed to Ken Nakashima.

7 recordsLinked to original sources

arXiv2023

Refinement of Interval Approximations for Fully Commutative Quivers

A fundamental challenge in multiparameter persistent homology is the absence of a complete and discrete invariant. To address this issue, we propose an enhanced framework that realizes a holistic understanding of a fully commutative quiver's representation via synthesizing interpretations obtained from intervals. Additionally, it provides a mechanism to tune the balance between approximation resolution and computational complexity. This framework is evaluated on commutative ladders of both finite-type and infinite-type. For the former, we discover an efficient method for the indecomposable decomposition leveraging solely one-parameter persistent homology. For the latter, we introduce a new invariant that reveals persistence in the second parameter by connecting two standard persistence diagrams using interval approximations. We subsequently present several models for constructing commutative ladder filtrations, offering fresh insights into random filtrations and demonstrating our toolkit's effectiveness in analyzing the topology of materials.

math.AT↗

arXiv2023

On Approximation of $2$D Persistence Modules by Interval-decomposables

In this work, we propose a new invariant for $2$D persistence modules called the compressed multiplicity and show that it generalizes the notions of the dimension vector and the rank invariant. In addition, for a $2$D persistence module $M$, we propose an "interval-decomposable replacement" $δ^{\ast}(M)$ (in the split Grothendieck group of the category of persistence modules), which is expressed by a pair of interval-decomposable modules, that is, its positive and negative parts. We show that $M$ is interval-decomposable if and only if $δ^{\ast}(M)$ is equal to $M$ in the split Grothendieck group. Furthermore, even for modules $M$ not necessarily interval-decomposable, $δ^{\ast}(M)$ preserves the dimension vector and the rank invariant of $M$. In addition, we provide an algorithm to compute $δ^{\ast}(M)$ (a high-level algorithm in the general case, and a detailed algorithm for the size $2\times n$ case).

math.RT↗

arXiv2023

Approximation by interval-decomposables and interval resolutions of persistence modules

In topological data analysis, two-parameter persistence can be studied using the representation theory of the 2d commutative grid, the tensor product of two Dynkin quivers of type A. In a previous work, we defined interval approximations using restrictions to essential vertices of intervals together with Mobius inversion. In this work, we consider homological approximations using interval resolutions, and show that the interval resolution global dimension is finite for finite posets and that it is equal to the maximum of the interval dimensions of the Auslander-Reiten translates of the interval representations. In fact, for the latter equality, we obtained a general formula in the setting of finite-dimensional algebras and resolutions relative to a generator-cogenerator. Furthermore, in the commutative ladder case, by a suitable modification of our interval approximation, we provide a formula linking the two conceptions of approximation.

math.RT↗

arXiv2021

On Interval Decomposability of 2D Persistence Modules

In the persistent homology of filtrations, the indecomposable decompositions provide the persistence diagrams. However, in almost all cases of multidimensional persistence, the classification of all indecomposable modules is known to be a wild problem. One direction is to consider the subclass of interval-decomposable persistence modules, which are direct sums of interval representations. We introduce the definition of pre-interval representations, a more natural algebraic definition, and study the relationships between pre-interval, interval, and indecomposable thin representations. We show that over the ``equioriented'' commutative $2$D grid, these concepts are equivalent. Moreover, we provide a criterion for determining whether or not an $n$D persistence module is interval/pre-interval/thin-decomposable without having to explicitly compute decompositions. For $2$D persistence modules, we provide an algorithm together with a worst-case complexity analysis that uses the total number of intervals in an equioriented commutative $2$D grid. We also propose several heuristics to speed up the computation.

math.RT↗

arXiv2020

Lengths of maximal green sequences for tame path algebras

In this paper, we study the maximal length of maximal green sequences for quivers of type $\widetilde{\mathbf{D}}$ and $\widetilde{\mathbf{E}}$ by using the theory of tilting mutation. We show that the maximal length does not depend on the choice of the orientation, and determine it explicitly. Moreover, we give a program which counts all maximal green sequences by length for a given Dynkin/extended Dynkin quiver.

math.RT↗

arXiv2020

Simplicial complexes and tilting theory for Brauer tree algebras

We study 2-term tilting complexes of Brauer tree algebras in terms of simplicial complexes. We show the symmetry and convexity of the simplicial complexes as lattice polytopes. Via a geometric interpretation of derived equivalences, we show that the $f$-vector of simplicial complexes of Brauer tree algebras only depends the number of the edges of the Brauer trees and hence it is a derived invariant. In particular, this result implies that the number of 2-term tilting complexes, which is in bijection with support $τ$-tilting modules, is a derived invariant. Moreover, we apply our result to the enumeration problem of Coxeter-biCatalan combinatorics.

math.RT↗

arXiv2017

Decomposition theory of modules: the case of Kronecker algebra

Let $A$ be a finite-dimensional algebra over an algebraically closed field $\Bbbk$. For any finite-dimensional $A$-module $M$ we give a general formula that computes the indecomposable decomposition of $M$ without decomposing it, for which we use the knowledge of AR-quivers that are already computed in many cases. The proof of the formula here is much simpler than that in a prior literature by Dowbor and Mróz. As an example we apply this formula to the Kronecker algebra $A$ and give an explicit formula to compute the indecomposable decomposition of $M$, which enables us to make a computer program.

math.RT↗