Related papers: MAT-Freeness is not combinatorial
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…
The purpose of this paper is to give new examples of families of free singularities. We first show that a generic equidimensional subspace arrangement is free. Furthermore, we show that a product of two reduced Cohen-Macaulay subspaces is…
We exhibit a particular free subarrangement of a certain restriction of the Weyl arrangement of type $E_7$ and use it to give an affirmative answer to a recent conjecture by T.~Abe on the nature of additionally free and stair-free…
In this paper, we present a combinatorial characterization of the hyperplanes associated with non-singular hermitian varieties ${H}\left(s, q^2\right)$ in the projective space $\mathrm{PG}\left(s,q^2\right)$ where $s\geq3$ and $q>2$. By…
Holm introduced $m$-free $\ell$-arrangements which is a generalization of free arrangements, while he asked whether all $\ell$-arrangements are $m$-free for $m$ large enough. Recently Abe and the author verified that this question is in the…
Models allowing for random heterogeneity, such as mixed logit and latent class, are generally observed to obtain superior model fit and yield detailed insights into unobserved preference heterogeneity. Using theoretical arguments and two…
The problem of a nonrelativistic particle with an internal color degree of freedom, with and without spin, moving in a free random gauge background is discussed. Freeness is a concept developed recently in the mathematical literature…
Free noncommutative fields constitute a natural and interesting example of constrained theories with higher derivatives. The quantization methods involving constraints in the higher derivative formalism can be nicely applied to these…
We show that the free spectrahedron determined by universal anticommuting self-adjoint unitaries is not equal to the minimal matrix convex set over the ball in dimension three or higher. This example, as well as other matrix convex sets…
Extending earlier work by Sommers and Tymoczko, in 2016 Abe, Barakat, Cuntz, Hoge, and Terao established that each arrangement of ideal type $\mathcal{A}_\mathcal{I}$ stemming from an ideal $\mathcal{I}$ in the set of positive roots of a…
Let M be a B-probability space. Assume that B itself is a D-probability space; then M can be viewed as a D-probability space as well. Let X be in M. We characterize freeness of X from B with amalgamation over D in terms of a certain…
We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…
We introduce an embedding of the free magma on a set A into the direct product of the free magma on a singleton set and the free semigroup on A. This embedding is then used to prove several theorems related to algebraic independence of…
It is well known that there is no basis of the field for real numbers regarded as a vector space over any proper subfield that is closed under multiplication. Mabry has extended this result to bases of arbitrary proper field extensions. The…
We study the nonresonance phenomenon for complex rank-one local systems on complements of hyperplane arrangements. We refine the method of Cohen, Dimca, and Orlik and obtain a combinatorial sufficient condition for nonresonance. As an…
The concepts of independence and totalness of subspaces are introduced in the context of quasi-probability distributions in phase space, for quantum systems with finite-dimensional Hilbert space. It is shown that due to the…
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…
We define an independence system associated with simple graphs. We prove that the independence system is a matroid for certain families of graphs, including trees, with bases as minimal resolving sets. Consequently, the greedy algorithm on…
We consider logarithmic vector fields parametrized by finite collections of weighted hyperplanes. For a finite collection of weighted hyperplanes in a two-dimensional vector space, it is known that the set of such vector fields is a free…
We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…