Related papers: Efficiency and complexity of hyperplane arrangemen…
One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…
The largest possible average diameter of a bounded cell of a simple hyperplane arrangement is conjectured to be not greater than the dimension. We prove that this conjecture holds in dimension 2, and is asymptotically tight in fixed…
Let $\Lambda$ be a finite-dimensional associative algebra over a field. A semibrick pair is a finite set of $\Lambda$-modules for which certain Hom- and Ext-sets vanish. A semibrick pair is completable if it can be enlarged so that a…
It is known that there exist hyperplane arrangements with same underlying matroid that admit non-homotopy equivalent complement manifolds. In this work we show that, in any rank, complex central hyperplane arrangements with up to 7…
We survey interactions between the topology and the combinatorics of complex hyperplane arrangements. Without claiming to be exhaustive, we examine in this setting combinatorial aspects of fundamental groups, associated graded Lie algebras,…
We describe a new relation between the topology of hyperplane arrangements, Milnor fibers and global polar curves, via the affine Lefschetz theory developped by A. N\'emethi. In particular, we improve some results due to Orlik and Terao…
We define and study exact, efficient representations of realization spaces of a natural class of underconstrained 2D Euclidean Distance Constraint Systems(EDCS) or Frameworks based on 1-dof Henneberg-I graphs. Each representation…
We formulate necessary and sufficient conditions for a unit vector n to generate a plane or axial symmetry of a constitutive tensor. For the elasticity tensor, these conditions consist of two polynomial equations of degree lower than four…
This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…
Given a fibration over the circle, we relate the eigenspace decomposition of the algebraic monodromy, the homological finiteness properties of the fiber, and the formality properties of the total space. In the process, we prove a more…
Multilayer networks preserve full information about the different interactions among the constituents of a complex system, and have recently proven quite useful in modelling transportation networks, social circles, and the human brain. A…
For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$. Determining or estimating $\textrm{ex}(n,F)$ is a classical and central problem…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
We study topological aspects of supersolvable abelian arrangements, toric arrangements in particular. The complement of such an arrangement sits atop a tower of fiber bundles, and we investigate the relationship between these bundles and…
We will consider some characterizations of freeness of a hyperplane arrangement, in terms of the following properties: locally freeness, factorization of characteristic polynomial and freeness of restricted multiarrangement. In the case of…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
Let $f,g_1,\dots,g_m$ be polynomials of degree at most $d$ with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Assume that $f$ is non-negative on a basic semi-algebraic set $S$ defined by polynomial inequalities $g_j(x)\ge…
A venerable problem in combinatorics and geometry asks whether a given incidence relation may be realized by a configuration of points and lines. The classic version of this would ask for algebraic lines over some field or possibly real…
We consider spline functions over simplicial meshes in $\RR^n$. We assume that the spline pieces join together with some finite order of smoothness but the pieces themselves are infinitely smooth. Such splines can have extra orders of…
Each complex hyperplane arrangement gives rise to a Milnor fibration of its complement. Although the Betti numbers of the Milnor fiber $F$ can be expressed in terms of the jump loci for rank 1 local systems on the complement, explicit…