Related papers: Failures of weak approximation in families

Decision-theoretic troubleshooting is one of the areas to which Bayesian networks can be applied. Given a probabilistic model of a malfunctioning man-made device, the task is to construct a repair strategy with minimal expected cost. The…

We prove the existence of weak solutions for the one obstacle problem associated with a class of quasilinear wave equations in one space dimension, extending previous results obtained in the linear case, and we also address the two…

We prove existence of weak solutions to a diffuse interface model describing the flow of a fluid through a deformable porous medium consisting of two phases. The system non-linearly couples Biot's equations for poroelasticity, including…

We study the local-global principle for zero-cycles of degree 1 on certain varieties fibered over the projective space. Among other applications, we prove that the Brauer-Manin obstruction is the only obstruction to the Hasse principle and…

The paper is devoted to the problem when a map from some closed connected manifold to an aspherical closed manifold approximately fibers, i.e., is homotopic to Manifold Approximate Fibration. We define obstructions in algebraic K-theory.…

We survey results on the hardness of approximating combinatorial optimization problems.

We construct families of locally recoverable codes with availability $t\geq 2$ using fiber products of curves, determine the exact minimum distance of many families, and prove a general theorem for minimum distance of such codes. The paper…

We identify a sufficient condition, treewidth-pliability, that gives a polynomial-time algorithm for an arbitrarily good approximation of the optimal value in a large class of Max-2-CSPs parameterised by the class of allowed constraint…

Let X be a homogeneous space of a connected linear algebraic group G' over a number field k, containing a k-point x. Assume that the stabilizer of x in G' is connected. Using the notion of a quasi-trivial group, recently introduced by…

Let $f : X \to S$ be a family of smooth projective algebraic varieties over a smooth connected quasi-projective base $S$, and let $\mathbb{V} = R^{2k} f_{*} \mathbb{Z}(k)$ be the integral variation of Hodge structure coming from degree $2k$…

Nous montrons comment associer \`a une gerbe d\'efinie sur un corps de nombres une obstruction de Brauer-Manin mesurant, comme dans le cas des vari\'et\'es, le d\'efaut d'existence d'une section globale. Ceci nous conduit \`a une…

Inspired by the work of Ellenberg, Elsholtz, Hall, and Kowalski, we investigate how the property of the generic fiber of a one-parameter family of abelian varieties being geometrically simple extends to other fibers. In \cite{EEHK09}, the…

We investigate the existence and multiplicity of weak solutions for a nonlinear Kirchhoff type quasilinear elliptic system on the whole space $\mathbb{R}^N$. We assume that the nonlinear term satisfies the locally super-$(m_1,m_2)$…

Let $K$ be a global field of positive characteristic. We prove that the Brauer-Manin obstructions to the Hasse principle, to weak approximation and to strong approximation are the only ones for homogeneous spaces of reductive groups with…

We introduce a variant of the $k$-nearest neighbor classifier in which $k$ is chosen adaptively for each query, rather than supplied as a parameter. The choice of $k$ depends on properties of each neighborhood, and therefore may…

We construct a family of fibered threefolds $X_m \to (S , \Delta)$ such that $X_m$ has no \'etale cover that dominates a variety of general type but it dominates the orbifold $(S,\Delta)$ of general type. Following Campana, the threefolds…

We prove a result on linear forms related to Peres-Schlag's theorem on badly approximable numbers with respect to lacunary sequences.

Orderability, weak orderability and the existence of continuous weak selections on filter spaces (i.e., spaces with a single non-isolated point) and their products are discussed. We prove that a closed continuous image X of a suborderable…

We prove that determining the weak saturation number of a host graph $F$ with respect to a pattern graph $H$ is already a computationally hard problem when $H$ is the triangle. As our main tool we establish a connection between weak…

We present a class of linear programming approximations for constrained optimization problems. In the case of mixed-integer polynomial optimization problems, if the intersection graph of the constraints has bounded tree-width our…