Related papers: Rational Points on the Intersection of Three Quadr…

After a brief introduction to the classical theory of binary quadratic forms we use these results for proving (most of) the claims made by P\'epin in a series of articles on unsolvable quartic diophantine equations, and for constructing…

Here is a square problem: in a unit square, is there a point with four rational distances to the vertices? A probability argument suggests a negative answer. This paper proves several special cases of the square problem: if the point sits…

We consider various problems related to finding points in $\Q^{2}$ and in $\Q^{3}$ which lie at rational distance from the vertices of some specified geometric object, for example, a square or rectangle in $\Q^{2}$, and a cube or…

Quadratic points of a surface in the projective 3-space are the points which can be exceptionally well approximated by a quadric. They are also singularities of a 3-web in the elliptic part and of a line field in the hyperbolic part of the…

We derive streamlined mean field variational Bayes algorithms for fitting linear mixed models with crossed random effects. In the most general situation, where the dimensions of the crossed groups are arbitrarily large, streamlining is…

We study Brauer-Manin obstructions to the Hasse principle and to weak approximation with special regard to effectivity questions.

Let $X$ be a smooth projective algebraic variety over a number field $k$ and $P$ in $X(k)$. In 2007, the second author conjectured that, in a precise sense, if rational points on $X$ are dense enough, then the best rational approximations…

Let $\mathbb{F}$ be a finite field and $C,D$ smooth, geometrically irreducible proper curves over $\mathbb{F}$ and set $K = \mathbb{F}(D)$. We consider Brauer-Manin and abelian descent obstructions to the existence of rational points and to…

We study the integral Brauer--Manin obstruction for affine diagonal cubic surfaces, which we employ to construct the first counterexamples to the integral Hasse principle in this setting. We then count in three natural ways how such…

We investigate the number of curves having a rational point of almost minimal height in the family of quadratic twists of a given elliptic curve. This problem takes its origin in the work of Hooley, who asked this question in the setting of…

We give a tight bound for the triple intersection numbers of Paley graphs. In particular, we show that any three vertices have a common neighbor in Paley graphs of order larger than 25.

In this note, we give short proofs of three theorems about intersection problems. The first one is a determination of the maximum size of a nontrivial $k$-uniform, $d$-wise intersecting family for $n\ge \left(1+\frac{d}{2}\right)(k-d+2)$,…

We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we will consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schr\"oder and Grand Schr\"oder…

We study randomized sketching methods for approximately solving least-squares problem with a general convex constraint. The quality of a least-squares approximation can be assessed in different ways: either in terms of the value of the…

The problem on the minimal number (with respect to deformation) of intersection points of two closed curves on a surface is solved. Following the Nielsen approach, we define classes of intersection points and essential classes of…

We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…

In this paper, we construct an algorithm for minimising piecewise smooth functions for which derivative information is not available. The algorithm constructs a pair of quadratic functions, one on each side of the point with smallest known…

Let $K$ be a field of char $K\neq 2$. For $a\in K$, we give an explicit answer to the field isomorphism problem of the simplest quartic polynomial $X^4-aX^3-6X^2+aX+1$ over $K$ as the special case of the field intersection problem via…

We establish thresholds for the feasibility of random multi-graph alignment in two models. In the Gaussian model, we demonstrate an "all-or-nothing" phenomenon: above a critical threshold, exact alignment is achievable with high…

We sharpen to nearly optimal the known asymptotic and explicit bounds for the number of $\mathbb{F}_q$-rational points on a geometrically irreducible hypersurface over a (large) finite field. The proof involves a Bertini-type probabilistic…