Related papers: On Gronwall conjecture
We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best…
We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three classes of the 3-net comprises concurrent lines, and irregular…
We show that the "double circle" order type and some of its generalizations have a compatible triangulation with any other order types with the same number of points and number of edges on convex hull, thus proving another special case of…
We propose a log-concavity conjecture for BPS invariants arising in the enumerative geometry of planar curve singularities, identified with the local Euler obstructions of Severi strata in their versal deformations. We further extend this…
We resolve a 25 year old problem by showing that The Paving Conjecture is equivalent to The Paving Conjecture for Triangular Matrices.
Webs are a kind of planar, directed, edge-labeled graph that encode invariant vectors for quantum representations of $\mathfrak{sl}_n$. The theory of webs developed organically for $\mathfrak{sl}_2$, where they are also known as noncrossing…
In this note we sketch a proof of a fundamental conjecture, the codimension-three conjecture, for microdifferential holonomic systems with regular singularities. It states that any regular holonomic E-module extends beyond a…
A \textit{$3$-net} of order $n$ is a finite incidence structure consisting of points and three pairwise disjoint classes of lines, each of size $n$, such that every point incident with two lines from distinct classes is incident with…
This paper is a sequel to [3]. We formulate a natural algebraic geometry conjecture, give some of its number theoretic and analytical consequences, and show that those can be used to get further advances in wave turbulence theory.
An ordinary plane of a finite set of points in real 3-space with no three collinear is a plane intersecting the set in exactly three points. We prove a structure theorem for sets of points spanning few ordinary planes. Our proof relies on…
A convex combination mapping of a planar graph is a plane mapping in which the external vertices are mapped to the corners of a convex polygon and every internal vertex is a proper weighted average of its neighbours. If a planar graph is…
Conventional wisdom holds that any region of 3-space contains infinitely many points, and the Planck length scale determines the uncertainty in every measurement of distance between two separate points. Against such a backdrop, this…
We give counterexamples to the Brown-Colbourn conjecture on reliability polynomials, in both its univariate and multivariate forms. The multivariate Brown-Colbourn conjecture is false already for the complete graph K_4. The univariate…
We give a complete proof of the fact that the trace of the curvature of the connection associated to a planar d-web (d>3) is the sum of the Blaschke curvatures of its sub 3-webs.
Fullerene graphs, i.e., 3-connected planar cubic graphs with pentagonal and hexagonal faces, are conjectured to be Hamiltonian. This is a special case of a conjecture of Barnette and Goodey, stating that 3-connected planar graphs with faces…
The study of comparison theorems in geometry has a rich history. In this paper, we establish a comparison theorem for polyhedra in 3-manifolds with nonnegative scalar curvature, answering affirmatively a dihedral rigidity conjecture by…
We consider compactifications of the space of triples of distinct points in projective $n$-space. One such space is a singular variety of configurations of points and lines; another is the smooth compactification of Fulton and MacPherson;…
In this paper we consider Erd\"os-Mordell inequality and its extension in the plane of triangle to the Erd\"os-Mordell curve. Algebraic equation of this curve is derived, and using modern computer tools in mathematics, we verified one…
Karasev conjectured that for any set of $3k$ lines in general position in the plane, which is partitioned into $3$ color classes of equal size $k$, the set can be partitioned into $k$ colorful 3-subsets such that all the triangles formed by…
In the first partial result toward Steinberg's now-disproved three coloring conjecture, Abbott and Zhou used a counting argument to show that every planar graph without cycles of lengths 4 through 11 is 3-colorable. Implicit in their proof…