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

For a curve over a global field we consider for which integers d the d-primary part of the Brauer group can obstruct the existence of rational points. We give examples showing it is possible that there is a d-primary obstruction for…

In this article we treat a notion of continuity for a multi-valued function $F$ and we compute the descriptive set-theoretic complexity of the set of all $x$ for which $F$ is continuous at $x$. We give conditions under which the latter set…

Let $C$ be a smooth irreducible projective curve of genus $g$ and $L$ a line bundle of degree $d$ generated by a linear subspace $V$ of $H^0(L)$ of dimension $n+1$. We prove a conjecture of D. C. Butler on the semistability of the kernel of…

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…

Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…

The Nagata Conjecture is one of the most intriguing open problems in the area of curves in the plane. It is easily stated. Namely, it predicts that the smallest degree d of a plane curve passing through r $\ge$ 10 general points in the…

In this paper, we study the properties of weak approximation with Brauer-Manin obstruction and the Hasse principle with Brauer-Manin obstruction for surfaces with respect to field extensions of number fields. We assume a conjecture of M.…

A solution to a problem of Erd\H{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d > a/b$, then $G$ is not necessarily $(c:d)$-choosable. Applying probabilistic methods, an upper bound for the…

Let C be a locally planar curve. Its versal deformation admits a stratification by the genera of the fibres. The strata are singular; we show that their multiplicities at the central point are determined by the Euler numbers of the Hilbert…

Consider a smooth, geometrically irreducible, projective curve of genus $g \ge 2$ defined over a number field of degree $d \ge 1$. It has at most finitely many rational points by the Mordell Conjecture, a theorem of Faltings. We show that…

Given n general points p_1, p_2,..., p_n in P^r, it is natural to ask when there exists a curve C \subset P^r, of degree d and genus g, passing through p_1, p_2,..., p_n. In this paper, we give a complete answer to this question for curves…

Consider a graph $G=(V,E)$ without isolated edges and with maximum degree $\Delta$. Given a colouring $c:E\to\{1,2,\ldots,k\}$, the weighted degree of a vertex $v\in V$ is the sum of its incident colours, i.e., $\sum_{e\ni v}c(e)$. For any…

Let $A$ and $B$ be sets of vertices in a graph $G$. Menger's theorem states that for every positive integer $k$, either there exists a collection of $k$ vertex-disjoint paths between $A$ and $B$, or $A$ can be separated from $B$ by a set of…

In his Ph.D. thesis, Farber proved that every strongly chordal graph can be represented as intersection graph of subtrees of a weighted tree, and these subtrees are ``compatible''. Moreover, this is an equivalent characterization of…

Let $d>1$ be an integer and $K_0$ a perfect field such that $char(K_0)$ does not divide $d$. Let $n>d$ be an integer that is prime to $d$. Let $f(x)\in K_0[x]$ be a degree $n$ monic polynomial without repeated roots, and $\mathcal{C}_{f,d}$…

Let $Q^d$ be the $d$-dimensional binary hypercube. We form a random subgraph $Q^d_p\subseteq Q^d$ by retaining each edge of $Q^d$ independently with probability $p$. We show that, for every constant $\varepsilon>0$, there exists a constant…

Let $X\subset\mathbb P^4$ be a very general hypersurface of degree $d\ge6$. Griffiths and Harris conjectured in 1985 that the degree of every curve $C\subset X$ is divisible by $d$. Despite substantial progress by Koll\'ar in 1991, this…

A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \leq \frac{g}{g-2}(n-2)$. We show that a connected simple plane…

We establish mild conditions under which a possibly irregular, sparse graph $G$ has "many" strong orientations. Given a graph $G$ on $n$ vertices, orient each edge in either direction with probability $1/2$ independently. We show that if…

In the Disjoint Paths problem, one is given a graph with a set of $k$ vertex pairs $(s_i,t_i)$ and the task is to connect each $s_i$ to $t_i$ with a path, so that the $k$ paths are pairwise disjoint. In the optimization variant, Max…