相关论文: Abelian Equations and Rank Problems for Planar Web…

The Gronwall conjecture states that a planar 3-web of foliations which admits more than one distinct linearizations is locally equivalent to an algebraic web. We propose an analogue of the Gronwall conjecture for the 3-web of foliations by…

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…

We solve the equivalence problem for vacuum PP-wave spacetimes by employing the Karlhede algorithm. Our main result is a suite of Cartan invariants that allows for the complete invariant classification of the vacuum pp-waves. In particular,…

We study non-flat planar 3-webs with infinitesimal symmetries. Using multi-dimensional Schwarzian derivative we give a criterion for linearization of such webs and present a projective classification thereof. Using this classification we…

It is shown that a relativistic (i.e. a Poincar{\' e} invariant) theory of extended objects (called p-branes) is not necessarily invariant under reparametrizations of corresponding $p$-dimensional worldsheets (including worldlines for $p =…

The authors found necessary and sufficient conditions for Samuelson's web to be of maximum rank.

The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…

We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…

A graph is $1$-$planar$ if it can be drawn in the plane so that each edge is crossed by at most one other edge. Moreover, a 1-planar graph $G$ is $optimal$ if it satisfies $|E(G)|=4|V(G)|-8$. J. Fujisawa et al. [16] first considered…

We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…

The present paper is the first one in the sequence of papers about a simple class of {\em framed $4$-graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em…

This paper presents new results for the (partial) maximum a posteriori (MAP) problem in Bayesian networks, which is the problem of querying the most probable state configuration of some of the network variables given evidence. First, it is…

We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in…

A well studied problem in algebraic complexity theory is the determination of the complexity of problems relying on evaluations of bilinear maps. One measure of the complexity of a bilinear map (or 3-tensor) is the optimal number of…

A genus one curve C of degree 5 is defined by the 4 x 4 Pfaffians of a 5 x 5 alternating matrix of linear forms on P^4. We prove a result characterising the covariants for these models in terms of their restrictions to the family of curves…

A genus one curve of degree 5 is defined by the 4 x 4 Pfaffians of a 5 x 5 alternating matrix of linear forms on P^4. We describe a general method for investigating the invariant theory of such models. We use it to explain how we found our…

In this paper, we first extend the celebrated PageRank modification to a higher-order Markov chain. Although this system has attractive theoretical properties, it is computationally intractable for many interesting problems. We next study a…

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. stated the Linear Arboricity Conjecture (LAC), that the linear arboricity of any simple graph of maximum…

Thomassen showed that planar graphs are 5-list-colourable, and that planar graphs of girth at least five are 3-list-colourable. An easy degeneracy argument shows that planar graphs of girth at least four are 4-list-colourable. In 2022,…

This paper studies the choosability of signed planar graphs. We prove that every signed planar graph is 5-choosable and that there is a signed planar graph which is not 4-choosable while the unsigned graph is 4-choosable. For each $k \in…