Related papers: A linear condition for non-very generic discrimina…
The Szemer\'edi-Trotter theorem gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particular it says that $n$ lines and $n$ points determine $O(n^{4/3})$ incidences. Let us suppose that an…
Starting from the classic contraction mapping principle, we establish a general, flexible, variational setting that turns out to be applicable to many situations of existence in Differential Equations. We show its potentiality with some…
A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…
In this paper we formulate and prove necessary and sufficient geometric conditions for existence of generic tensegrities in the plane for arbitrary graphs. The conditions are written in terms of "meet-join" relations for the configuration…
A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are…
Linear systems governed by continuous-time difference equations cover a wide class of linear systems. From the Lyapunov-Krasovskii approach, we investigate stability for such a class of systems. Sufficient conditions, and in some particular…
A linearly constrained framework in $\mathbb{R}^d$ is a point configuration together with a system of constraints which fixes the distances between some pairs of points and additionally restricts some of the points to lie in given affine…
A plane configuration {v_1,...,v_m} of vectors in {\mathbb R}^2 is said to be balanced if for any index i, the set of the det(v_i,v_j) for j\neq i is symmetric around the origin. A plane configuration is said to be uniform if every pair of…
The space of degree d single-variable monic and centered complex polynomial vector fields can be decomposed into loci in which the vector fields have the same topological structure. We analyze the geometric structure of these loci and…
We extend the facial weak order from finite Coxeter groups to central hyperplane arrangements. The facial weak order extends the poset of regions of a hyperplane arrangement to all its faces. We provide four non-trivially equivalent…
In this article there are two main results. The first result gives a formula, in terms of a log resolution, for the graded pieces of the Hodge filtration on the cohomology of a unitary local system of rank one on the complement of an…
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…
One of the common obstacles for learning causal models from data is that high-order conditional independence (CI) relationships between random variables are difficult to estimate. Since CI tests with conditioning sets of low order can be…
The purpose of this note is to study containment relations and asymptotic invariants for ideals of fixed codimension skeletons (simplicial ideals) determined by arrangements of $n + 1$ general hyperplanes in the $n-$dimensional projective…
While hidden class models of various types arise in many statistical applications, it is often difficult to establish the identifiability of their parameters. Focusing on models in which there is some structure of independence of some of…
We produce a one-parameter family of hyperplane arrangements that are counterexamples to the conjecture of Saito that the complexified complement of a free arrangement is $K(\pi,1)$. These arrangements are the restriction of a one-parameter…
We construct bundles $E_k(\A,\F) \to M$ over the complement $M$ of a complex hyperplane arrangement \A, depending on an integer $k \geq 1$ and a set $\F=\{f_1, \ldots, f_\mu\}$ of continuous functions $f_i \colon M \to \C$ whose differences…
We prove Terao conjecture saying that the freeness is determined by the combinatorics for arrangements of 13 lines in the complex projective plane and that the property of being nearly free is combinatorial for line arrangements of up to 12…
We prove that under certain combinatorial conditions, the realization spaces of line arrangements on the complex projective plane are connected. We also give several examples of arrangements with eight, nine and ten lines which have…
We describe a basic correspondence between linear algebraic structures within vector embeddings in artificial neural networks and conditional independence constraints on the probability distributions modeled by these networks. Our framework…