Related papers: On Gronwall conjecture
We prove that a d-web near a point in n-space, where n is greater than 2 and d is greater than 2n-1, is equivalent to an algebraic web, if it has maximal rank or, more generally, if it has (2d - 3n + 1) abelian relations the 1-jets of which…
The well-known Steinberg's conjecture asserts that any planar graph without 4- and 5-cycles is 3 colorable. In this note we have given a short algorithmic proof of this conjecture based on the spiral chains of planar graphs proposed in the…
We prove the Categorified Wrapping Number Conjecture for large classes of annular links, including alternating annular links and tangle closures exhibiting plumbed link phenomena. We do so by characterizing when a resolution is sufficient…
The chromatic number of an planar graph is not greater than four and this is known by the famous four color theorem and is equal to two when the planar graph is bipartite. When the planar graph is even-triangulated or all cycles are greater…
We investigate data-enriched models, like Petri nets with data, where executability of a transition is conditioned by a relation between data values involved. Decidability status of various decision problems in such models may depend on the…
Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…
For connected reductive linear algebraic structure groups it is proven that every web is holonomically isolated. The possible tuples of parallel transports in a web form a Lie subgroup of the corresponding power of the structure group. This…
In this paper we show that two seemingly unrelated problems in economics, the hypothesis of integrability and the hypothesis of additive separability are linked by the absence of curvature of connections on webs naturally associated with…
We discuss the curvilinear web $\boldsymbol{\mathcal W}_{0,n+3}$ on the moduli space $\mathcal M_{0,n+3}$ of projective configurations of $n+3$ points on $\mathbf P^1$ defined by the $n+3$ forgetful maps $\mathcal M_{0,n+3}\rightarrow…
In this paper we prove the equivalence of two conjectures on linear systems through fat points on a generic K3 surface. The first conjecture is exactly as Segre conjecture on the projective plane. Whereas the second characterizes such…
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…
It implicitly follows from the work of [Colbourn, El-Mallah: On two dual classes of planar graphs. Discrete Mathematics 80(1): 21-40 (1990)] that every planar partial 3-tree is a subgraph of a planar 3-tree. This fact has already enabled to…
A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a thrackle drawing of a graph on the plane cannot have more edges than vertices. We prove the Conjecture for…
In one of their seminal articles on allowable sequences, Goodman and Pollack gave combinatorial generalizations for three problems in discrete geometry, one of which being the Dirac conjecture. According to this conjecture, any set of $n$…
We investigate several properties of Kronecker (direct, tensor) products of graphs that are planar and $3$-connected (polyhedral, $3$-polytopal). This class of graphs was recently characterised and constructed by the second author [15]. Our…
We construct flat 3-webs via semi-simple geometric Frobenius manifolds of dimension three and give geometric interpretation of the Chern connection of the web. These webs turned out to be biholomorphic to the characteristic webs on the…
It has been conjectured by Rovelli that there is a correspondence between the space of link classes of a Riemannian 3-manifold and the space of 3-geometries (on the same manifold). An exact statement of his conjecture will be established…
A long-standing Conjecture of S. Negami states that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It is known that the Conjecture is equivalent to the fact that \emph{the graph $K_{1,2, 2, 2}$…
Riffaut (2019) conjectured that a singular modulus of degree $h\ge 3$ cannot be a root of a trinomial with rational coefficients. We show that this conjecture follows from the GRH, and obtain partial unconditional results.
There is a natural construction which associates to a finitely generated, countable, discrete group $G$ and a 3-cocycle $\omega$ of $G$ an inclusion of II$_1$ factors, the so-called diagonal subfactors (with cocycle). In the case when the…