Related papers: Jumping numbers of hyperplane arrangements

For a reduced hyperplane arrangement we prove the analytic Twisted Logarithmic Comparison Theorem, subject to mild combinatorial arithmetic conditions on the weights defining the twist. This gives a quasi-isomorphism between the twisted…

The set of homogeneous polynomials of degree $D$ is a topological space that contains the subspace $Hyp(D)$ constituted only by hyperbolic polynomials. In 2002, V. I. Arnold conjectured that the number of connected components of $Hyp (D)$…

We compute the multiplier ideals of hyperplane arrangements via the interpretation of these ideals in terms of spaces of arcs, due to Ein, Lazarsfeld and the author.

We give a combinatorial characterization of isotropic subspaces in the Orlik- Solomon algebra of a hyperplane arrangement in terms of decorations of its intersection lattice. We then use this characterization to prove a result that relates…

The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…

An embedding of the complete bipartite graph $K_{3,3}$ in $\mathbb{P}^2$ gives rise to both a line arrangement and a bar-and-joint framework. For a generic placement of the six vertices, the graded Betti numbers of the logarithmic module of…

In this manuscript we shall give an explicit formula for the jumping numbers of a simple complete ideal in a two-dimensional regular local ring. In particular, we obtain a formula for the jumping numbers of an analytically irreducible plane…

We consider arrangements of n hyperplanes of codimension one in a real projective space of dimension d. Let us denote by F the maximal possible number f of connected components of the complement in the projective space of dimension d to the…

The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…

In this article we explore some of the combinatorial consequences of recent results relating the isospectral commuting variety and the Hilbert scheme of points in the plane.

The multiplicative Newton-like method developed by the author et al. is extended to the situation where the dynamics is restricted to the orthogonal group. A general framework is constructed without specifying the cost function. Though the…

We study the hyperplane arrangements associated, via the minimal model programme, to symplectic quotient singularities. We show that this hyperplane arrangement equals the arrangement of CM-hyperplanes coming from the representation theory…

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…

We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

This paper aims to undertake an exploration of the behavior of the moduli space of line arrangements while establishing its combinatorial interplay with the incidence structure of the arrangement. In the first part, we investigate…

We show that the notion of MAT-freeness for hyperplane arrangements depends on the underlying field. In particular, MAT-freeness is not combinatorial.

This note is mostly an expository survey, centered on the topology of complements of hyperplane arrangements, their Milnor fibrations, and their boundary structures. An important tool in this study is provided by the degree 1 resonance and…

In the category of free arrangements, inductively and recursively free arrangements are important. In particular, in the former, Terao's open problem asking whether freeness depends only on combinatorics is true. A long standing problem…

Let A be an arrangement of complex hyperplanes. The fundamental group of the complement of A is determined by a braid monodromy homomorphism from a finitely generated free group to the pure braid group. Using the Gassner representation of…