Related papers: On the Blaschke conjecture for 3-webs
Every $n$-vertex planar triangle-free graph with maximum degree at most $3$ has an independent set of size at least $\frac{3}{8}n$. This was first conjectured by Albertson, Bollob\'as and Tucker, and was later proved by Heckman and Thomas.…
A triple system is cancellative if no three of its distinct edges satisfy $A \cup B=A \cup C$. It is tripartite if it has a vertex partition into three parts such that every edge has exactly one point in each part. It is easy to see that…
We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…
We present a proof of the Harbourne-Hirschowitz conjecture for linear systems with base points of multiplicity seven or less. This proof uses a well-known degeneration of the projective plane, as well as a combinatorial technique that…
It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordan (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give…
We prove a conjecture of Przytycki which asserts that the $n$-quandle of a link $L$ in the 3-sphere is finite if and only if the fundamental group of the $n$-fold cyclic branched cover of the 3-sphere, branched over $L$, is finite.
Yasutaka Nakanishi formulated the following conjecture in 1981: every link is 3-move equivalent to a trivial link. While the conjecture was proved for several specific cases, it remained an open question for over twenty years. In 2002,…
For Tur\'an's (3, 4)-conjecture, in the case of n = 3k+1 vertices, (.5)6^{k-1} non-isomorphic complexes are constructed that attain the conjecture. In the case of n = 3k+2 vertices, 6^{k-1} non-isomorphic complexes are constructed that…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
We propose a simple geometrical construction of topological invariants of 3-strand Brownian braids viewed as world lines of 3 particles performing independent Brownian motions in the complex plane z. Our construction is based on the…
This paper proves that convex Brunnian links exist for every dimension $n \geq 3$ by constructing explicit examples. These examples are three-component links which are higher-dimensional generalizations of the Borromean rings.
Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…
Using the band representation of the 3-strand braid group, it is shown that the genus of 3-braid links can be read off their skein polynomial. Some applications are given, in particular a simple proof of Morton's conjectured inequality and…
In this paper, we study the variety $Jor_{3}$ of three-dimensional Jordan algebras over the field of real numbers. We establish the list of $26$ non-isomorphic Jordan algebras and describe the irreducible components of $Jor_{3}$ proving…
We show that every $3$-dimensional convex body can be covered by $14$ smaller homothetic copies. The previous result was $16$ copies established by Papadoperakis in 1999, while a conjecture by Hadwiger is $8$. We modify Papadoperakis's…
We show that the isomorphism of 3-connected planar graphs can be decided in deterministic log-space. This improves the previously known bound UL$\cap$coUL of Thierauf and Wagner.
A well known Conjecture due to Beloshapka asserts that all totally nondegenerate polynomial models with the length $l\geq 3$ of their Levi-Tanaka algebra are {\em rigid}, that is, any point preserving automorphism of them is completely…
Multi-way tables with specified marginals arise in a variety of applications in statistics and operations research. We provide a comprehensive complexity classification of three fundamental computational problems on tables: existence,…
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…
In this paper we prove a conjecture on the dimension of linear systems, with base points of multiplicity 2 and 3, on an Hirzebruck surface.