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

One develops {\em ab initio} the theory of rational/birational maps over reduced, but not necessarily irreducible, projective varieties in arbitrary characteristic. A numerical invariant of a rational map is introduced, called the Jacobian…

The Euler characteristic of the link of a real algebraic variety is an interesting topological invariant in order to discuss local topological properties. We prove in the paper that an invariant stronger than the Euler Characteristic is…

In the present paper we study geometric structures associated with webs of hypersurfaces. We prove that with any geodesic (n+2)-web on an n-dimensional manifold there is naturally associated a unique projective structure and, provided that…

A vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must contain a vertex of a higher rank. In this paper we study a…

We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Both problems are NP-hard. We write both problems as matrix-rank minimization and then relax them using the nuclear…

We prove that every planar graph with maximum degree three has a planar drawing in which the edges are drawn as circular arcs that meet at equal angles around every vertex. Our construction is based on the Koebe-Thurston-Andreev circle…

We show that computing the lexicographically first four-coloring for planar graphs is P^{NP}-hard. This result optimally improves upon a result of Khuller and Vazirani who prove this problem to be NP-hard, and conclude that it is not…

One of the general problems in algebraic geometry is to determine algorithmically whether or not a given geometric object, defined by explicit polynomial equations (e.g. a curve or a surface), satisfies a given property (e.g. has…

The classification of algebraic vector bundles of rank 2 over smooth affine fourfolds is a notoriously difficult problem. Isomorphism classes of such vector bundles are not uniquely determined by their Chern classes, in contrast to the…

We consider the multilinear pagerank problem studied in [Gleich, Lim and Yu, Multilinear Pagerank, 2015], which is a system of quadratic equations with stochasticity and nonnegativity constraints. We use the theory of quadratic vector…

We give a one parameter family of exceptional planar 5-webs. Each web is formed by four pencils of lines and by a foliation defined by the level curves of a function sn_k(x)sn_k(y) where sn_k denotes a Jacobi's elliptic function.

Clique-width is a well-studied graph parameter. For graphs of bounded clique-width, many problems that are NP-hard in general can be polynomial-time solvable. The fact motivates several studies to investigate whether the clique-width of…

Grotzsch proved that every triangle-free planar graph is 3-colorable. Thomassen proved that every planar graph of girth at least five is 3-choosable. As for other surfaces, Thomassen proved that there are only finitely many 4-critical…

In this letter we give fourth-order autonomous recurrence relations with two invariants, whose degree growth is cubic or exponential. These examples contradict the common belief that maps with sufficiently many invariants can have at most…

The first part of this paper studied $\mathrm{GSp}_4$-type abelian varieties and the corresponding compatible systems of $\mathrm{GSp}_4$ representations. Techniques in \cite{BCGP} are applied to show that one can prove the potential…

We study genus $4$ curves over finite fields and two invariants of the $p$-torsion part of their Jacobians: the $a$-number ($a$) and $p$-rank ($f$). We collect and analyze statistical data of curves over $\mathbb{F}_p$ for $p=3,5,7,11$ and…

Consider two conditions on a graph: (1) each 5-cycle is not a subgraph of 5-wheel and does not share exactly one edge with 3-cycle, and (2) each 5-cycle is not adjacent to two 3-cycles and is not adjacent to a 4-cycle with chord. We show…

A rooted phylogenetic network is a directed acyclic graph with a single root, whose sinks correspond to a set of species. As such networks are useful for representing the evolution of species that have undergone reticulate evolution, there…

We show how several results about p-adic lattices generalize easily to lattices over valuation ring of arbitrary rank having only the Henselian property for quadratic polynomial. If 2 is invertible we obtain the uniqueness of the Jordan…

In this article we consider the action of affine group and time rescaling on planar quadratic differential systems. We construct a system of representatives of the orbits of systems with four invariant lines, including the line at infinity…