Related papers: Effective obstruction to lifting Tate classes from…
Questions related to Brauer-Manin obstructions to the Hasse principle and weak approximation for homogeneous spaces of tori over a number field are well-studied, generally using arithmetic duality theorems, starting with works of Sansuc and…
We propose a unifying setting for dealing with monodromically atypical intersections that goes beyond the usual Zilber-Pink conjecture. In particular we obtain a new proof of finiteness of the maximal atypical orbit closures in each stratum…
We study the good reduction modulo p of K3 surfaces with complex multiplication. If a K3 surface with complex multiplication has good reduction, we calculate the Picard number and the height of the formal Brauer group of the reduction.…
We prove $p$-adic versions of a classical result in arithmetic geometry stating that an irreducible subvariety of an abelian variety with dense torsion has to be the translate of a subgroup by a torsion point. We do so in the context of…
The Frank-Wolfe algorithm achieves a convergence rate of $\mathcal{O}(1/T)$ for smooth convex optimization over compact convex domains, accelerating to $\mathcal{O}(1/T^2)$ when both the objective and the feasible set are strongly convex.…
Using the Kuga-Satake correspondence we provide an effective algorithm for the computation of the Picard and Brauer groups of K3 surfaces of degree 2 over number fields.
We present a new, far simpler family of counter-examples to Kushnirenko's Conjecture. Along the way, we illustrate a computer-assisted approach to finding sparse polynomial systems with maximally many real roots, thus shedding light on the…
We develop an obstruction theory for Hirsch extensions of cbba's with twisted coefficients. This leads to a variety of applications, including a structural theorem for minimal cbba's, a construction of relative minimal models with twisted…
We prove exponential contraction of renormalization along hybrid classes of infinitely renormalizable unimodal maps (with arbitrary combinatorics), in any even degree $d$. We then conclude that orbits of renormalization are asymptotic to…
We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…
Shape inference is classically ill-posed, because it involves a map from the (2D) image domain to the (3D) world. Standard approaches regularize this problem by either assuming a prior on lighting and rendering or restricting the domain,…
Let g be a positive integer congruent to 1 modulo 4 and K be an arbitrary number field. We construct infinitely many explicit one-parameter algebraic families of degree 4 del Pezzo surfaces and of genus g hyperelliptic curves such that each…
We consider strongly-convex-strongly-concave saddle-point problems with general non-bilinear objective and different condition numbers with respect to the primal and the dual variables. First, we consider such problems with smooth composite…
We produce explicit elliptic curves over \Bbb F_p(t) whose Mordell-Weil groups have arbitrarily large rank. Our method is to prove the conjecture of Birch and Swinnerton-Dyer for these curves (or rather the Tate conjecture for related…
We use techniques from algebraic and extremal combinatorics to derive upper bounds on the number of independent sets in several (hyper)graphs arising from finite geometry. In this way, we obtain asymptotically sharp upper bounds for partial…
Let $E$ be an elliptic curve with good ordinary reduction at an odd prime $p$. Assuming that Greenberg's $\mu=0$ conjecture holds, we show that the $\lambda$-invariants of the Mazur--Tate elements attached to $E$ either stabilise to the…
Conditional on the Lefschetz standard conjecture in degree 2, we prove that the index of a Brauer class on a smooth projective variety divides a fixed power of its period, uniformly in smooth families. In the other direction, we reinterpret…
We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…
In this paper, we propose novel algorithms for inferring the Maximum a Posteriori (MAP) solution of discrete pairwise random field models under multiple constraints. We show how this constrained discrete optimization problem can be…
Given a family of abelian covers of $\mathbb{P}^1$ and a prime $p$ of good reduction, by considering the associated Deligne--Mostow Shimura variety, we obtain lower bounds for the Ekedahl-Oort type, and the Newton polygon, at $p$ of the…