Related papers: Optimal quantitative weak approximation for projec…
In this paper we study spherical equidistribution on the space of (translates of) adelic lattices, which we apply to understand the fine-scale statistics of the directions in the set of shifted primitive lattice points. We also apply our…
This work concerns the local convergence theory of Newton and quasi-Newton methods for convex-composite optimization: minimize f(x):=h(c(x)), where h is an infinite-valued proper convex function and c is C^2-smooth. We focus on the case…
We introduce new discrete best approximation problems, formulated and solved in the framework of tropical algebra, which deals with semirings and semifields with idempotent addition. Given a set of samples, each consisting of the input and…
We study solutions of a homogeneous quadratic equation $q(x_0,\dots, x_n)=0$, defined over a field $K$, where the $x_i$ are themselves homogeneous polynomials of some degree $d$ in $r+1$ variables. Equivalently, we are looking at rational…
We study the functional codes $C_2(X)$ defined on projective varieties $X$, in the case where $X\subset \mathbb{P}^3$ is a 1-degenerate quadric or a non-degenerate quadric (hyperbolic or elliptic). We find the minimum distance of these…
We consider the potential density of rational points on an algebraic variety defined over a number field $K$, i.e., the property that the set of rational points of $X$ becomes Zariski dense after a finite field extension of $K$. For a…
Let $k$ be a positive integer and let $X_k$ be the cubic hypersurface defined by the equation $x^3-(y_1^2+\cdots+y_{4k}^2)z=0$. In this paper, we give an asymptotic formula for the counting function of semi-integral points on $X_k$. We also…
We investigate the large-distance asymptotics of optimal Hardy weights on $\mathbb Z^d$, $d\geq 3$, via the super solution construction. For the free discrete Laplacian, the Hardy weight asymptotic is the familiar…
Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…
The paper covers a formulation of the inverse quadratic programming problem in terms of unconstrained optimization where it is required to find the unknown parameters (the matrix of the quadratic form and the vector of the quasi-linear part…
We compute the Hausdorff dimension of sets of very well approximable vectors on rational quadrics. We use ubiquitous systems and the geometry of locally symmetric spaces. As a byproduct we obtain the Hausdorff dimension of the set of rays…
In this paper, we derive new asymptotic expansions for the solutions of higher order elliptic equations in the presence of small inclusions. As a byproduct, we derive a topological derivative based algorithm for the reconstruction of…
Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…
In this paper, we study a nonsmooth/nonconvex multiobjective optimization problem with uncertain constraints in arbitrary Asplund spaces. We first provide necessary optimality condition in a fuzzy form for approximate weakly robust…
It is proved that a smooth rational surface in projective four-space, which is ruled by cubics or quartics has degree at most 12. It is also proved that a smooth rational surface in projective four-space which is the image of Fn by a linear…
Dimensionality reduction on quadratic manifolds augments linear approximations with quadratic correction terms. Previous works rely on linear approximations given by projections onto the first few leading principal components of the…
Let a,b,c,d be nonzero rational numbers whose product is a square, and let V be the diagonal quartic surface in PP^3 defined by ax^4+by^4+cz^4+dw^4=0. We prove that if V contains a rational point that does not lie on any of the 48 lines on…
In this paper, the performance of quadratic residue (QR) codes of lengths within 100 is given and analyzed when the hard decoding, soft decoding, and linear programming decoding algorithms are utilized. We develop a simple method to…
Let $n$ be a positive multiple of $4$. We establish an asymptotic formula for the number of rational points of bounded height on singular cubic hypersurfaces $S_n$ defined by $$ x^3=(y_1^2 + \cdots + y_n^2)z . $$ This result is new in two…
A fundamental problem arising in many areas of machine learning is the evaluation of the likelihood of a given observation under different nominal distributions. Frequently, these nominal distributions are themselves estimated from data,…