Related papers: Accurate Arrangements
In recent papers we have refined a conjecture of Lehrer and Solomon expressing the character of a finite Coxeter group $W$ acting on the $p$th graded component of its Orlik-Solomon algebra as a sum of characters induced from linear…
We extend the relation between random matrices and free probability theory from the level of expectations to the level of all correlation functions (which are classical cumulants of traces of products of the matrices). We introduce the…
Fast algorithms for submodular maximization problems have a vast potential use in applicative settings, such as machine learning, social networks, and economics. Though fast algorithms were known for some special cases, only recently…
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…
Consider the free group algebra $K\left[F\right]$, where $F$ is a free group and $K$ a field. A well-order $\prec$ on $F$ is called an exposure order if words are greater than their proper prefixes. We show that every one-sided ideal $I$ in…
Between 1994 and 1998, the work of M. Brou\'e, G. Malle, and R. Rouquier generalized in a natural way the definition of the Hecke algebra associated to a finite Coxeter group, for the case of an arbitrary complex reflection group.…
We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…
This survey is based on a series of lectures given by the authors at the working seminar "Convexit\'e et Probabilit\'es" at UPMC Jussieu, Paris, during the spring 2013. It is devoted to maximal inequalities associated to symmetric convex…
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…
We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of d-regular graphs. For independent sets, this theorem is a strengthening of the results of Kahn, Galvin and Tetali, and Zhao showing…
The study of classes of models of a finite diagram was initiated by S. Shelah in 1969. A diagram D is a set of types over the empty set, and the class of models of the diagram D consists of the models of T which omit all the types not in D.…
A classical argument was introduced by Khintchine in 1926 in order to exhibit the existence of totally irrational singular linear forms in two variables. This argument was subsequently revisited and extended by many authors. For instance,…
Let $A$ be a free hyperplane arrangement. In 1989, Ziegler showed that the restriction $A''$ of $A$ to any hyperplane endowed with the natural multiplicity is then a free multiarrangement. We initiate a study of the stronger freeness…
In Chapter 1 we give the basic background and notations. We also give a new characterization of the Conrad property for orderings. In Chapter 2, we use the new characterization of the Conradian property to give a classification of groups…
For any left orderable group G, we recall from work of McCleary that isolated points in the space of left orderings correspond to basic elements in the free lattice ordered group over G. We then establish a new connection between the…
Given a rank 3 real arrangement $\mathcal A$ of $n$ lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for $n$ sufficiently large, the number of simple intersection points of $\mathcal…
We present a combinatorial structure of generators of $D(\mathcal{A}).$ This structure permits us to detect the relationship between the combinatorial determined property and the singularity of vector field. Consequently, by using only…
A preferential arrangement of a set is a total ordering of the elements of that set with ties allowed. A barred preferential arrangement is one in which the tied blocks of elements are ordered not only amongst themselves but also with…
In this expository note, I showcase the relevance of Coxeter groups to quiver representations. I discuss (1) real and imaginary roots, (2) reflection functors, and (3) torsion free classes and c-sortable elements. The first two topics are…
We first develop some criteria for a general divisor to be strongly Euler-homogeneous in terms of the Fitting ideals of certain modules. We also study new variants of Saito-holonomicity, generalizing Koszul-free type properties and…