Related papers: Deletion theorem and combinatorics of hyperplane a…
We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…
Only few categories of free arrangements are known in which Terao's conjecture holds. One of such categories consists of $3$-arrangements with unbalanced Ziegler restrictions. In this paper, we generalize this result to arbitrary…
The main purpose of this paper is to provide combinatorial constraints on the constructability of free and nearly free arrangements of smooth plane conics admitting certain ${\rm ADE}$ singularites.
Let $B$ be an arrangement of linear complex hyperplanes in $C^d$. Then a classical result by Orlik \& Solomon asserts that the cohomology algebra of the complement can be constructed from the combinatorial data that are given by the…
Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d…
A hyperplane arrangement $\cA$ is said to be free if the corresponding Jacobian ideal $J_\cA$ is Cohen-Macaulay. If $\cA$ is free then $J_\cA$ is unmixed (i.e. equidimensional). Freeness is an important property, yet its presence is not…
We will prove the freeness of multi-Coxeter arrangements by constructing a basis of the module of vector fields which contact to each reflecting hyperplanes with some multiplicities using K. Saito's theory of primitive derivation.
We consider the vanishing ideal of an arrangement of linear subspaces in a vector space and investigate when this ideal can be generated by products of linear forms. We introduce a combinatorial construction (blocker duality) which yields…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
We introduce an algorithm that exploits a combinatorial symmetry of an arrangement in order to produce a geometric reflection between two disconnected components of its moduli space. We apply this method to disqualify three real examples…
We show that the hyperplane arrangement of a coconvex set in a finite root system is free if and only if it is free in corank 4. As a consequence, we show that the inversion arrangement of a Weyl group element w is free if and only if w…
We show that there are only finitely many combinatorial types of free real line arrangements with only double, triple and quadruple intersection points, and we enlist all admissible weak-combinatorics of them. Then we classify all real…
We prove that a group obtained as a quotient of the free product of finitely many cubulable groups by a finite set of relators satisfying the classical $C'(1/6)$--small cancellation condition is cubulable. This yields a new large class of…
It was proved by Sela and by the authors that every formula in the theory of a free group $F$ is equivalent to a boolean combination of $\exists\forall$-formulas. We also proved that the elementary theory of a free group is decidable (there…
Let L be a nonunimodular definite lattice. Using a theorem of Elkies we show that whether L embeds in the standard definite lattice of the same rank is completely determined by a collection of lattice correction terms, one for each…
Some recent papers formulated sufficient conditions for the decomposition of matrix variances. A statement was that if we have one or two observables, then the decomposition is possible. In this paper we consider an arbitrary finite set of…
A combinatorial formula is derived which expresses free cumulants in terms of classical comulants. As a corollary, we give a combinatorial interpretation of free cumulants of classical distributions, notably Gaussian and Poisson…
A clutter consists of a finite set and a collection of pairwise incomparable subsets. Clutters are natural generalisations of matroids, and they have similar operations of deletion and contraction. We introduce a notion of connectivity for…
M. Saito recently proved that the jumping numbers of a hyperplane arrangement depend only on the combinatorics of the arrangement. However, a formula in terms of the combinatorial data was still missing. In this note, we give a formula and…
In the present paper we develop a small cancellation theory for associative algebras with a basis of invertible elements. Namely, we study quotients of a group algebra of a free group and introduce three axioms for the corresponding…