相关论文: Abelian Equations and Rank Problems for Planar Web…

We prove that the Strong Maximal Rank Conjecture holds for quadrics in $\mathbb{P}^3$ and we prove the existence of a component of the expected dimension in $\mathbb{P}^4$, as well as in a wide range of parameters $(g,d)$ in $\mathbb{P}^r$…

We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…

By the Grunbaum-Aksenov Theorem (extending Grotzsch's Theorem) every planar graph with at most three triangles is 3-colorable. However, there are infinitely many planar 4-critical graphs with exactly four triangles. We describe all such…

The WorldWide Web is one of the most important communication systems we use in our everyday life. Despite its central role, the growth and the development of the WWW is not controlled by any central authority. This situation has created a…

We provide sharp lower bounds for the multiplicity of a local holomorphic foliation defined in a complex surface in terms of data associated to a germ of invariant curve. Then we apply our methods to invariant curves whose branches are…

Motivated by questions in theoretical computer science and quantum information theory, we study the classical problem of determining linear spaces of matrices of bounded rank. Spaces of bounded rank three were classified in 1983, and it has…

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

The irreducible representations of symmetric groups can be realized as certain graded pieces of invariant rings, equivalently as global sections of line bundles on partial flag varieties. There are various ways to choose useful bases of…

Let $G$ be a planar graph without 4-cycles and 5-cycles and with maximum degree $\Delta\ge 32$. We prove that $\chi_{\ell}(G^2)\le \Delta+3$. For arbitrarily large maximum degree $\Delta$, there exist planar graphs $G_{\Delta}$ of girth 6…

We prove a theorem giving the asymptotic number of binary quartic forms having bounded invariants; this extends, to the quartic case, the classical results of Gauss and Davenport in the quadratic and cubic cases, respectively. Our…

We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard,…

We show that the linear map defined by multiplication with a general bi-homogeneous form between two bi-graduated pieces of the first cohomology of a nonsingular quadric in the projective space is of maximal rank. This is the first non…

A graph $G$ is {\em $k$-choosable} if for every assignment of a set $S(v)$ of $k$ colors to every vertex $v$ of $G$, there is a proper coloring of $G$ that assigns to each vertex $v$ a color from $S(v)$. We consider the complexity of…

Given a bipartite graph $G=(V_b,V_r,E)$, the $2$-Level Quasi-Planarity problem asks for the existence of a drawing of $G$ in the plane such that the vertices in $V_b$ and in $V_r$ lie along two parallel lines $\ell_b$ and $\ell_r$,…

Two characteristic-dependent linear rank inequalities are given for eight variables. Specifically, the first inequality holds for all finite fields whose characteristic is not three and does not in general hold over characteristic three.…

Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three. In this paper we affirmatively answer this question for the…

A graph is apex if it can be made planar by deleting a vertex, that is, $\exists v$ such that $G-v$ is planar. We define the related notions of edge apex, $\exists e$ such that $G-e$ is planar, and contraction apex, $\exists e$ such that…

In this text, we investigate webs which can be associated to cluster algebras from the point of view of the abelian functional equations these webs carry, focusing on the polylogarithmic ones. We introduce a general notion of webs whose…

The objects of our study are webs in the geometry of volume-preserving diffeomorphisms. We introduce two local invariants of divergence-free webs: a differential one, directly related to the curvature of the natural connection of a…

In this paper we study the problem of augmenting a planar graph such that it becomes 3-regular and remains planar. We show that it is NP-hard to decide whether such an augmentation exists. On the other hand, we give an efficient algorithm…