相关论文: Sur la conjecture abc, version corps de fonctions …

A function $f$ defined on $[0, 1]^d$ is called strongly chargeable if there is a continuous vector-field $v$ such that $f(x_1, \dots,x_d)$ equals the flux of $v$ through the rectangle $[0, x_1] \times \cdots \times [0, x_d]$ for all $(x_1,…

In the present paper, we focus on a weighted version of the Bounded Negativity Conjecture which predicts that for every smooth projective surface in characteristic zero the self-intersection numbers of reduced and irreducible curves are…

We construct a stratification of the punctual Hilbert scheme of points on a non-reduced and nodal plane curve, $x^uy^v=0$. Each stratum is indexed by a new combinatorial object we define: a weak diagonal partition. The approach is based on…

In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A \subset V(G) is chosen independently at random, with density p, and new vertices are subsequently infected if they have at least r infected…

We show that the strategy of point counting in o-minimal structures can be applied to various problems on unlikely intersections that go beyond the conjectures of Manin-Mumford and Andr\'e-Oort. We verify the so-called Zilber-Pink…

Let $C$ be an irreducible projective plane curve in the complex projective space ${\mathbb{P}}^2$. The classification of such curves, up to the action of the automorphism group $PGL(3,{\mathbb{C}})$ on ${\mathbb{P}}^2$, is a very difficult…

We construct divergence-free Sobolev vector fields in C([0,1];W^{1,r}(T^d;R^d)) with r < d and d >=2 which simultaneously admit any finite number of distinct positive solutions to the continuity equation. We then show that the vector fields…

Let $X/C$ be a general product of elliptic curves. Our goal is to establish the Hodge-D-conjecture for $X$. We accomplish this when $\dim X \leq 5$. For $\dim X \geq 6$, we reduce the conjecture to a matrix rank condition that is amenable…

We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…

A directed graph (digraph) $ D $ is $ k $-linked if $ |D| \geq 2k $, and for any $ 2k $ distinct vertices $ x_1, \ldots, x_k, y_1, \ldots, y_k $ of $ D $, there exist vertex-disjoint paths $ P_1, \ldots, P_k $ such that $ P_i $ is a path…

In this paper we consider the cop number of graphs with no, or few, short cycles. We show that when $G$ is graph of girth $g$ and the minimum degree $\delta \geq 2$, then $c(G) = O(n\log(n)(\delta-1)^{-\lfloor \frac{g+1}{4} \rfloor})$ as a…

Let H = (H,V) be a hypergraph with edge set H and vertex set V. Then hypergraph H is invertible iff there exists a permutation pi of V such that for all E belongs to H(edges) intersection of(pi(E) and E)=0. H is invertibility critical if H…

The Caccetta-H\"aggkvist conjecture implies that for every integer $k\ge 1$, if $G$ is a bipartite digraph, with $n$ vertices in each part, and every vertex has out-degree more than $n/(k+1)$, then $G$ has a directed cycle of length at most…

Let $\mathcal{P}$ be a set of $n$ points in the Euclidean plane. We prove that, for any $\epsilon > 0$, either a single line or circle contains $n/2$ points of $\mathcal{P}$, or the number of distinct perpendicular bisectors determined by…

We show that a transitively reduced digraph has a confluent upward drawing if and only if its reachability relation has order dimension at most two. In this case, we construct a confluent upward drawing with $O(n^2)$ features, in an $O(n)…

We study closed sets $F \subset {\mathbb R}^d$ whose distance function $d_F:= {\rm dist}\,(\cdot,F)$ is DC (i.e., is the difference of two convex functions on ${\mathbb R}^d$). Our main result asserts that if $F \subset {\mathbb R}^2$ is a…

We prove that for every integer $t\geq 1$, the class of intersection graphs of curves in the plane each of which crosses a fixed curve in at least one and at most $t$ points is $\chi$-bounded. This is essentially the strongest…

We study the triple convolution sum of the divisor function given by $$\sum_{n\leq x} d(n)d(n-h)d(n+h)$$ for $h\neq 0$ and $d(n)$ denotes the number of positive divisors of $n$. Based on algebraic and geometric considerations, Browning…

The competition graph of a directed acyclic graph D is the undirected graph on the same vertex set as D in which two distinct vertices are adjacent if they have a common out-neighbor in D. The competition number of an undirected graph G is…

Let K be a complete discretely valued field with residue field k. If char(K) = 0, char(k) = 2 and the 2-rank of k is d, we prove that there exists an integer N depending on d such that the u-invariant of any function field in one variable…