Searcharxiv⌕ Search

arXiv subjects

Takuro Abe

Publications and source records attributed to Takuro Abe.

64 records · Page 4Linked to original sources

Equivariant multiplicities of Coxeter arrangements and invariant bases

Let $\A$ be an irreducible Coxeter arrangement and $W$ be its Coxeter group. Then $W$ naturally acts on $\A$. A multiplicity $\bfm : \A\rightarrow \Z$ is said to be equivariant when $\bfm$ is constant on each $W$-orbit of $\A$. In this article, we prove that the multi-derivation module $D(\A, \bfm)$ is a free module whenever $\bfm$ is equivariant by explicitly constructing a basis, which generalizes the main theorem of \cite{T02}. The main tool is a primitive derivation and its covariant derivative. Moreover, we show that the $W$-invariant part $D(\A, \bfm)^{W}$ for any multiplicity $\bfm$ is a free module over the $W$-invariant subring.

math.CO↗

Exponents of 2-multiarrangements and freeness of 3-arrangements

We give the upper bound of differences of exponents for balanced 2-multiarrangements in terms of the cardinality of hyperplanes. Also, we give a shift isomorphism of 2-multiarrangements like Coxeter arrangements when the difference of exponents is maximum. As an application, a sufficient numerical and combinatorial condition for 3-arrangements to be free is given.

math.AC↗

Primitive filtrations of the modules of invariant logarithmic forms of Coxeter arrangements

We define {\bf primitive derivations} for Coxeter arrangements which may not be irreducible. Using those derivations, we introduce the {\bf primitive filtrations} of the module of invariant logarithmic differential forms for an arbitrary Coxeter arrangement with an arbitrary multiplicity. In particular, when the Coxeter arrangement is irreducible with a constant multiplicity, the primitive filtration has already been studied, which generalizes the Hodge filtration introduced by K. Saito.

math.CO↗

A primitive derivation and logarithmic differential forms of Coxeter arrangements

Let $W$ be a finite irreducible real reflection group, which is a Coxeter group. We explicitly construct a basis for the module of differential 1-forms with logarithmic poles along the Coxeter arrangement by using a primitive derivation. As a consequence, we extend the Hodge filtration, indexed by nonnegative integers, into a filtration indexed by all integers. This filtration coincides with the filtration by the order of poles. The results are translated into the derivation case.

math.CO↗

Totally free arrangements of hyperplanes

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.

math.AC↗

A generalized logarithmic module and duality of Coxeter multiarrangements

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.

math.AC↗

The Euler multiplicity and addition-deletion theorems for multiarrangements

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.

math.CV↗

Coxeter multiarrangements with quasi-constant multiplicities

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.

math.CO↗

The characteristic polynomial of a multiarrangement

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.

math.AC↗

Splitting criterion for reflexive sheaves

The purpose of this paper is to study the structure of reflexive sheaves over projective spaces through hyperplane sections. We give a criterion for a reflexive sheaf to split into a direct sum of line bundles. An application to the theory of free hyperplane arrangements is also given.

math.AG↗