Related papers: On the Blaschke conjecture for 3-webs

We classify quasilinear systems in Riemann invariants whose characteristic webs are linearizable on every solution. Although the linearizability of an individual web is a rather nontrivial differential constraint, the requirement of…

Karonski, Luczak, and Thomason (2004) conjectured that, for any connected graph G on at least three vertices, there exists an edge weighting from {1,2,3} such that adjacent vertices receive different sums of incident edge weights.…

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…

We find three characterizations for a multidimensional (n+1)-web W possessing a reduct reducible subweb: its closed form equations, the integrability of an invariant distribution associated with W, and the relations between the components…

Using the light ladder basis for Kuperberg's $C_2$ webs, we derive triple clasp formulas for idempotents projecting to the top summand in each tensor product of fundamental representations. We then find explicit formulas for the…

The main goal of this paper is to present an algorithm bounding the dimension of a linear system of curves of given degree (or monomial basis) with multiple points in general position. As a result we prove the Hirschowitz--Harbourne…

The invariants of solvable triangular Lie algebras with one nilindependent diagonal element are studied exhaustively. Bases of the invariant sets of all such algebras are constructed using an original algebraic algorithm based on Cartan's…

For every integer $k \geq 3$ we construct a $k$-gonal curve $C$ along with a very ample divisor of degree $2g + k - 1$ (where $g$ is the genus of $C$) to which the vanishing statement from the Green-Lazarsfeld gonality conjecture does not…

We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD…

We study the problem of finding homomorphisms into odd cycles from planar graphs with high odd-girth. The Jaeger-Zhang conjecture states that every planar graph of odd-girth at least $4k+1$ admits a homomorphism to the odd cycle $C_{2k+1}$.…

We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…

The aim of this paper is to prove Golyshev's conjecture in the cases of Fano threefolds $V_{10}$ and $V_{14}$. This conjecture states modularity of D3 equations for smooth Fano threefolds with Picard group Z. More precisely, we find…

The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…

A path cover is a decomposition of the edges of a graph into edge-disjoint simple paths. Gallai conjectured that every connected $n$-vertex graph has a path cover with at most $\lceil n/2 \rceil$ paths. We prove Gallai's conjecture for…

Let W be a planar 3-web defined on a neighborhood of a point M. We call "symmetry of W around M" any local diffeomorphism which fixes M and maps each foliation of W to a (not necessarily the same) foliation of W. We say that it is a simple…

Listed as No. 53 among the one hundred famous unsolved problems in [J. A. Bondy, U. S. R. Murty, Graph Theory, Springer, Berlin, 2008] is Steinberg's conjecture, which states that every planar graph without 4- and 5-cycles is 3-colorable.…

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 define a sequence of integer-valued invariants $\gamma^k(L)$ for a $3$-component link $L$. We prove that the resulting $\gamma$-invariants are invariant under concordance, and more generally under weak cobordism, and that they lift…

We classify simple flops on smooth threefolds, or equivalently, Gorenstein threefold singularities with irreducible small resolution. There are only six families of such singularities, distinguished by Koll{\'a}r's {\em length} invariant.…

A manifestly relativistic-invariant Lellouch-L\"uscher formalism for the three-particle decays is proposed. Similarly to ref.[1], the formalism is based on the use of the non-relativistic effective Lagrangians. Manifest Lorentz invariance…