Related papers: On Gronwall conjecture
A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same queue are nested. The \emph{queue number} of a graph is the…
The L'vov-Kaplansky conjecture states that the image of a multilinear noncommutative polynomial $f$ in the matrix algebra $M_n(K)$ is a vector space for every $n \in {\mathbb N}$. We prove this conjecture for the case where $f$ has degree…
Plane triangulations with all vertices of degree $3$ or $6$ are enumerated. A plane triangulation is said to be akempic if it has a $4$-colouring such that no two adjacent triangles have the same three colours and this colouring is not…
We use the Brill-Noether theory to prove the Green conjecture for exceptional curves on K3 surfaces. Such curves count among the few ones having Clifford dimension at least three. We obtain our result by adopting an infinitesimal approach…
The purpose of this paper is to construct a crepant resolution of quotient singularities by finite subgroups of SL(3,C) of monomial type, and prove that the Euler number of the resolution is equal to the number of conjugacy classes. This…
This is the fifth in a series of papers where we prove a conjecture of Deser and Schwimmer regarding the algebraic structure of ``global conformal invariants''; these are defined to be conformally invariant integrals of geometric scalars.…
We prove that the gonality among the smooth curves in a complete linear system on a $K3$ surface is constant except for the Donagi-Morrison example. This was proved by Ciliberto and Pareschi under the additional condition that the linear…
The 1-2-3 Conjecture, posed by Karo\'{n}ski, {\L}uczak and Thomason, asked whether every connected graph $G$ different from $K_2$ can be 3-edge-weighted so that every two adjacent vertices of $G$ get distinct sums of incident weights. The…
Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very…
We complete the explicit study of a three-fold divisorial contraction whose exceptional divisor contracts to a point, by treating the case where the point downstairs is a singularity of index $n \ge 2$. We prove that if this singularity is…
The main result of this paper is the proof for elliptic modular threefolds of conjectures on the existence and structure of a filtration on the Chow groups of smooth projective varieties. In the form we prove them these conjectures were…
Let $G$ be a tripartite graph with $N$ vertices in each vertex class. If each vertex is adjacent to at least $(2/3)N$ vertices in each of the other classes, then either $G$ contains a subgraph that consists of $N$ vertex-disjoint triangles…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
We consider a subclass of the Cowen-Douglas class in which the problem of deciding whether two operators are similar becomes more manageable. A similarity criterion for Cowen-Douglas operators is known to be dependent on the trace of the…
We define in a global manner the notion of a connective structure for a gerbe on a space X. When the gerbe is endowed with trivializing data with respect to an open cover of X, we describe this connective structure in two separate ways,…
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
We describe the set of points of the trianguline variety over a given local Galois representation. Global analogues describing companion points in eigenvariety by [Bre14] and [HN17], can be thought of as a rational analogue to the weight…
For finite sets A and B in the plane, we write A+B to denote the set of sums of the elements of A and B. In addition, we write tr(A) to denote the common number of triangles in any triangulation of the convex hull of A using the points of A…
The main change with respect to the previous version is a change of terminology : we call "ordinary" the webs previously called "regular". A holomorphic $d$-web of codimension one in dimension $n$ is "ordinary", if it satisfies to some…
A link L in the 3-sphere is called Brunnian if every proper sublink of L is trivial. In a previous paper, the first author proved that the restriction to Brunnian links of any Goussarov-Vassiliev finite type invariant of (n+1)-component…