相关论文: Abelian Equations and Rank Problems for Planar Web…
In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…
We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…
Identifying the rank of species in a social or ecological network is a difficult task, since the rank of each species is invariably determined by complex interactions stipulated with other species. Simply put, the rank of a species is a…
Based on observations in the web-graph, the power-law hypothesis states that PageRank has a power-law distribution with the same exponent as the in-degree. While this hypothesis has been analytically verified for many random graph models,…
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…
A planar graph is essentially $4$-connected if it is 3-connected and every of its 3-separators is the neighborhood of a single vertex. Jackson and Wormald proved that every essentially 4-connected planar graph $G$ on $n$ vertices contains a…
We consider the problem of list edge coloring for planar graphs. Edge coloring is the problem of coloring the edges while ensuring that two edges that are incident receive different colors. A graph is k-edge-choosable if for any assignment…
We consider infinite programming problems with constraint sets defined by systems of infinite number of inequalities and equations given by continuously differentiable functions defined on Banach spaces. In the approach proposed here we…
In this article, we discuss new models for static nonlinear deformations via scale-invariant conformal energy functionals based on the linear distortion. In particular, we give examples to show that, despite equicontinuity estimates giving…
An abelian variety defined over an algebraically closed field k of positive characteristic is supersingular if it is isogenous to a product of supersingular elliptic curves and is superspecial if it is isomorphic to a product of…
Almost $4$-connectivity is a weakening of $4$-connectivity which allows for vertices of degree three. In this paper we prove the following theorem. Let $G$ be an almost $4$-connected triangle-free planar graph, and let $H$ be an almost…
This paper proves that if $G$ is a planar graph without 4-cycles and $l$-cycles for some $l\in\{5, 6, 7\}$, then there exists a matching $M$ such that $AT(G-M)\leq 3$. This implies that every planar graph without 4-cycles and $l$-cycles for…
Although there is no doubt that multi-parameter persistent homology is a useful tool to analyse multi-variate data, efficient ways to compute these modules are still lacking in the available topological data analysis toolboxes. Other issues…
Recently, fundamental conditions on the sampling patterns have been obtained for finite completability of low-rank matrices or tensors given the corresponding ranks. In this paper, we consider the scenario where the rank is not given and we…
Webs and Springer fibers are separately important objects in representation theory: webs give a diagrammatic calculus for tensor invariants of $\mathfrak{sl}_k$, and the cohomology group of Springer fibers can be used to construct the…
Transformation invariances are present in many real-world problems. For example, image classification is usually invariant to rotation and color transformation: a rotated car in a different color is still identified as a car. Data…
We give a near-linear time 4-coloring algorithm for planar graphs, improving on the previous quadratic time algorithm by Robertson et al. from 1996. Such an algorithm cannot be achieved by the known proofs of the Four Color Theorem (4CT).…
We provide a nontrivial upper bound for the nonnegative rank of rank-three matrices, which allows us to prove that [6(n+1)/7] linear inequalities suffice to describe a convex n-gon up to a linear projection.
A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges. We show that optimal 1-planar graphs can be recognized in linear time. Our…
We prove that if $f:X \rightarrow A$ is a morphism from a smooth projective variety $X$ to an abelian variety $A$ over a number field $K$, and $G$ is a subgroup of automorphisms of $X$ satisfying certain properties, and if a prime $p$…