Related papers: On combinatorics of plus-one generated line arrang…
By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…
For a line arrangement in the complex projective plane $\mathbb{P}^2$, we investigate the compactification $\overline{F}$ of the affine Milnor fiber in $\mathbb{P}^3$ and its minimal resolution $\widetilde{F}$. We compute the Chern numbers…
Let P_nk(x) denote the sum of the lowest k+1 terms in the expansion of (1+x)^n. We investigate the irreducibility of P_nk(x) and more general univariate polynomials related to it. Polynomials P_nk(x) naturally arise in Schubert calculus,…
We obtain two combinatorial results: an equality of Weyl groups and an inequality of roots, in the setting of generalised Bott-Samelson resolutions of minuscule Schubert varieties. These results are used in the companion paper [BK19] to…
We introduce and study several random combinatorial billiard trajectories. Such a system, which depends on a fixed parameter $p\in(0,1)$, models a beam of light that travels in a Euclidean space, occasionally randomly reflecting off of a…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
We study Pythagorean hyperplane arrangements, originally defined by Zaslavsky. In this first part of a series on such arrangements, we introduce a new notion of genericity for such arrangements. Using this notion we construct an auxiliary…
The main ideas developed in this habilitation thesis consist in endowing combinatorial objects (words, permutations, trees, Young tableaux, etc.) with operations in order to construct algebraic structures. This process allows, by studying…
We show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane. As a consequence, we find nine new infinite families of cubic partial cubes as well as many sporadic examples.
The work in this article is inspired by a classical problem: the statistical physical properties of a closed polymer loop that is wound around a rod. Historically the preserved topology of this system has been addressed through…
Using the invariant developed in [6], we differentiate four arrangements with the same combinatorial information but in different deformation classes. From these arrangements, we construct four other arrangements such that there is no…
We study polynomial optimization problems whose objective has a composition or tensor train structure. These polynomials can be evaluated as a sequence of maps, giving rise to intermediate variables (``states'') of dimension lower than the…
A simple analytical way of creating superpositions of Bessel-Gaussian light beams with knotted nodal lines is proposed. It is based on the equivalence between the paraxial wave equation and the two-dimensional Schr\"odinger equation for a…
A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained.
We derive explicit formulae for the generating series of mixed Grothendieck dessins d'enfant/monotone/simple Hurwitz numbers, via the semi-infinite wedge formalism. This reveals the strong piecewise polynomiality in the sense of…
The basis of this work is a simple, extended corollary of Wilson's theorem. This corollary generates many more quotients than those already generated by Wilson's theorem, and it was of interest to derive how they relate to each other and…
A product difference equation is proved and used for derivation by elementary methods of four combinatorial identities, eight combinatorial identities involving generalized harmonic numbers and eight combinatorial identities involving…
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…
The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…
High dimensional expanders simultaneously satisfying spectral and combinatorial (coboundary) expansion have recently played a major role in breakthroughs in PCP and coding theory, but the only known construction of such complexes is…