TATakuro Abe

Takuro Abe

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Takuro Abe has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Totally free arrangements of hyperplanes

    by Takuro Abe, Hiroaki Terao, Masahiko Yoshinaga

    A central arrangement $\A$ of hyperplanes in an $\ell$-dimensional vector space $V$ is said to be {\it totally free} if a multiarrangement $(\A, m)$ is free for any multiplicity $ m : \A\to \Z_{> 0}$. It has been known that $\A$ is totally free whenever $\ell \le 2$. In this article, we will prove that there does not exist any totally free arrangement other than the obvious ones, that is, a product of one-dimensional arrangements and two-dimensional ones.

  • Open Access

    A generalized logarithmic module and duality of Coxeter multiarrangements

    by Takuro Abe

    We introduce a new definition of a generalized logarithmic module of multiarrangements by uniting those of the logarithmic derivation and the differential modules. This module is realized as a logarithmic derivation module of an arrangement of hyperplanes with a multiplicity consisting of both positive and negative integers. We consider several properties of this module including Saito's criterion and reflexivity. As applications, we prove a shift isomorphism and duality of some Coxeter multiarrangements by using the primitive derivation.

  • Open Access

    Splitting criterion for reflexive sheaves

    by Takuro Abe, Masahiko Yoshinaga

    We give a criterion for a reflexive sheaf to split into a direct sum of line bundles.


  • Open Access

    The Euler multiplicity and addition-deletion theorems for multiarrangements

    by Takuro Abe, Hiroaki Terao, Max Wakefield

    The addition-deletion theorems for hyperplane arrangements, which were originally shown in [H. Terao, Arrangements of hyperplanes and their freeness I, II. J. Fac. Sci. Univ. Tokyo Sect. IA Math. 27 (1980), 293--320], provide useful ways to construct examples of free arrangements. In this article, we prove addition-deletion theorems for multiarrangements. A key to the generalization is the definition of a new multiplicity, called the Euler multiplicity, of a restricted multiarrangement. We compute the Euler multiplicities in many cases. Then we apply the addition-deletion theorems to various arrangements including supersolvable arrangements and the Coxeter arrangement of type $A_{3}$ to construct free and non-free multiarrangements.

  • Open Access

    Coxeter multiarrangements with quasi-constant multiplicities

    by Takuro Abe, Masahiko Yoshinaga

    We study structures of derivation modules of Coxeter multiarrangements with quasi-constant multiplicities by using the primitive derivation. As an application, we show that the characteristic polynomial of a Coxeter multiarrangement with quasi-constant multiplicity is combinatorially computable.

  • Open Access

    The characteristic polynomial of a multiarrangement

    by Takuro Abe, Hiroaki Terao, Max Wakefield

    Given a multiarrangement of hyperplanes we define a series by sums of the Hilbert series of the derivation modules of the multiarrangement. This series turns out to be a polynomial. Using this polynomial we define the characteristic polynomial of a multiarrangement which generalizes the characteristic polynomial of an arragnement. The characteristic polynomial of an arrangement is a combinatorial invariant, but this generalized characteristic polynomial is not. However, when the multiarrangement is free, we are able to prove the factorization theorem for the characteristic polynomial. The main result is a formula that relates `global' data to `local' data of a multiarrangement given by the coefficients of the respective characteristic polynomials. This result gives a new necessary condition for a multiarrangement to be free. Consequently it provides a simple method to show that a given multiarrangement is not free.