Related papers: An enriched degree of the Wronski
We characterize the monomial complete intersections in three variables satisfying the Weak Lefschetz Property (WLP), as a function of the characteristic of the base field. Our result presents a surprising, and still combinatorially obscure,…
We study arrangements of $m$ hyperplanes in the $n$-dimensional real projective space, with a special focus on $m=n+3$ and $n=3$ or $n=4$.
In his PhD Thesis, E.R. Scheinerman conjectured that planar graphs are intersection graphs of line segments in the plane. This conjecture was proved with two different approaches by J. Chalopin and the author, and by the author, L.…
For a set $A$ of points in the plane, not all collinear, we denote by ${\rm tr}(A)$ the number of triangles in any triangulation of $A$; that is, ${\rm tr}(A) = 2i+b-2$ where $b$ and $i$ are the numbers of points of $A$ in the boundary and…
In a generalized Airy matrix model, a power $p$ replaces the cubic term of the Airy model introduced by Kontsevich. The parameter $p$ corresponds to Witten's spin index in the theory of intersection numbers of moduli space of curves. A…
Given a planar graph $G$, we consider drawings of $G$ in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding $\pi$ of the vertex set of $G$ into…
For prime degree hypersurfaces of dimension at least 3, Mori asked if every smooth proper limit is still a hypersurface. Interestingly in dimensions 1 and 2, this is not the case. For example, Griffin constructed explicit families of…
The Gromov--Wasserstein problem is a non-convex optimization problem over the polytope of transportation plans between two probability measures supported on two spaces, each equipped with a cost function evaluating similarities between…
We pose and solve the equivalence problem for subspaces of ${\mathcal P}_n$, the $(n+1)$ dimensional vector space of univariate polynomials of degree $\leq n$. The group of interest is ${\rm SL}_2$ acting by projective transformations on…
In his beautiful paper [1], Ben Andrews obtained the complete classification of the solutions of the planar isotropic $L_p$ Minkowski problem. In this paper, by generalizing Ben Andrews's result we obtain the complete classification of the…
The pole placement problem belongs to the classical problems of linear systems theory. It is often assumed that the ground field is the real numbers R or the complex numbers C. The major result over the complex numbers derived in 1981 by…
The present paper opens a new branch in the theory of variational problems with branching extremals, the investigation of one-dimensional minimal fillings of finite pseudo-metric spaces. On the one hand, this problem is a one-dimensional…
The causal set program as well as the Wolfram physics project leave open the problem of how a graph that is a (3+1)-dimensional Minkowski-spacetime according to its simple geodesic distances, could be generated solely from simple…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…
Let $G=(V, E)$ be a finite connected graph, where $V$ denotes the set of vertices and $E$ denotes the set of edges. We revisit the following Chern-Simons Higgs model, \begin{equation*} \Delta u=\lambda…
The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…
A generalization of the Kontsevich Airy-model allows one to compute the intersection numbers of the moduli space of p-spin curves. These models are deduced from averages of characteristic polynomials over Gaussian ensembles of random…
We give new tools for homotopy Brouwer theory. In particular, we describe a canonical reducing set (the set of "walls") which splits the plane into maximal translation areas and irreducible areas. We then focus on Brouwer mapping classes…
We classify the solutions to an overdetermined elliptic problem in the plane in the finite connectivity case. This is achieved by establishing a one-to-one correspondence between the solutions to this problem and a certain type of minimal…