Related papers: Tame arrangements
We study a generalized version of Terao's famous addition theorem for free arrangements to the category of those with projective dimension one. Namely, we give a criterion to determine the algebraic structure of logarithmic derivation…
We introduce toric arrangements, essentially finite families of codimension 1 subtori of a torus or of their cosets, as a periodic generalization of hyperplane arrangements, compute cohomology of the complement of such an arrangement and…
We give an explicit presentation for the integral cohomology ring of the complement of any arrangement of level sets of characters in a complex torus (alias "toric arrangement"). Our description parallels the one given by Orlik and Solomon…
We introduce the class of MAT-free hyperplane arrangements which is based on the Multiple Addition Theorem by Abe, Barakat, Cuntz, Hoge, and Terao. We also investigate the closely related class of MAT2-free arrangements based on a recent…
We define a combinatorial object that can be associated with any conic-line arrangement with ordinary singularities, which we call the combinatorial Poincar\'e polynomial. We prove a Terao-type factorization statement on the splitting of…
We prove the addition-deletion theorems for the Solomon-Terao polynomials, which have two important specializations. Namely, one is to the characteristic polynomials of hyperplane arangements, and the other to the Poincar\`{e} polynomials…
We construct an effective algorithmic method to compute the homological monodromy of a complex polynomial which is tame. As an application we show the existence of conjugated polynomials in a number field which are not topologically…
Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and…
Rosay and Rudin introduced the notion of Tame discrete subsets of the affine complex space and investigated their properties. We generalize this theory to the case of a complex linear algebraic group with trivial character group.
We explore a natural extension of braid arrangements in the context of determinantal arrangements. We show that these determinantal arrangements are free divisors. Additionally, we prove that free determinantal arrangements defined by the…
The relation space of a hyperplane arrangement is the vector space of all linear dependencies among the defining forms of the hyperplanes in the arrangement. In this paper, we study the relationship between the relation space and the…
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…
The order of the Milnor fiber monodromy operator of a central hyperplane arrangement is shown to be combinatorially determined. In particular, a necessary and sufficient condition for the triviality of this monodromy operator is given. It…
In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial,…
In 2002, Terao showed that every reflection multi-arrangement of a real reflection group with constant multiplicity is free by providing a basis of the module of derivations. We first generalize Terao's result to multi-arrangements stemming…
The symmetric decreasing rearrangement of functions on $\mathbb{R}^n$ features in several seminal inequalities, such as the P\'olya-Szeg\H{o} inequality. The latter was shown by the authors to hold for all smoothing rearrangements, a class…
We introduce a new method of constructing complete sequences of key polynomials for simple extensions of tame fields. In our approach the key polynomials are taken to be the minimal polynomials over the base field of suitably constructed…
We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…
We give several versions of local and global inverse mapping theorem for tame non necessarily smooth, mappings. Here tame mapping means a mapping which is subanalytic or, more generally, definable in some o-minimal structure. Our sufficient…
We introduce and study a class of algebraic stacks with finite inertia in positive and mixed characteristic, which we call tame algebraic stacks. They include tame Deligne-Mumford stacks, and are arguably better behaved than general…