相关论文: The $L_p$ Gauss image problem

Necessary and sufficient conditions of uniform consistency are explored. A hypothesis is simple. Nonparametric sets of alternatives are bounded convex sets in $\mathbb{L}_p$, $p >1$ with "small" balls deleted. The "small" balls have the…

The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…

Given a graph $G$, the general position problem is to find a largest set $S$ of vertices of $G$ such that no three vertices of $S$ lie on a common geodesic. Such a set is called a ${\rm gp}$-$set$ of $G$ and its cardinality is the ${\rm…

We introduce an iterative scheme for discrete convex minimization problems of $p$-Laplace type such as variational graph $p$-Laplace problems and $\ell^p$ regression. In each iteration, the scheme solves only a weighted least-squares…

We study the $L_p$-discrepancy of random point sets in high dimensions, with emphasis on small values of $p$. Although the classical $L_p$-discrepancy suffers from the curse of dimensionality for all $p \in (1,\infty)$, the gap between…

In this paper, we review some results over the last 10-15 years on elliptic and parabolic equations with discontinuous coefficients. We begin with an approach given by N. V. Krylov to parabolic equations in the whole space with VMO$_x$…

In this article we dwell into the class of so called ill posed Linear Inverse Problems (LIP) in machine learning, which has become almost a classic in recent times. The fundamental task in an LIP is to recover the entire signal / data from…

In a non supervised Bayesian estimation approach for inverse problems in imaging systems, one tries to estimate jointly the unknown image pixels $\fb$ and the hyperparameters $\thetab$. This is, in general, done through the joint posterior…

The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…

In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and the goal is to find a pair of points, each from each subset,…

We consider the discrepancy of the integer lattice with respect to the collection of all translated copies of a dilated convex body having a finite number of flat, possibly non-smooth, points in its boundary. We estimate the $L^{p}$ norm of…

The generalized Busemann-Petty problem asks whether origin-symmetric convex bodies with lower-dimensional smaller sections necessarily have smaller volume. We study the weighted version of this problem corresponding to the physical…

We consider a compound testing problem within the Gaussian sequence model in which the null and alternative are specified by a pair of closed, convex cones. Such cone testing problem arise in various applications, including detection of…

We consider the reduction of problems on general noncommutative $L_p$-spaces to the corresponding ones on those associated with finite von Neumann algebras. The main tool is a unpublished result of the first named author which approximates…

We extend the $L^p$ theory of sparse graph limits, which was introduced in a companion paper, by analyzing different notions of convergence. Under suitable restrictions on node weights, we prove the equivalence of metric convergence,…

This article belongs to the area of geometric tomography, which is the study of geometric properties of solids based on data about their sections and projections. We describe a new direction in geometric tomography where different…

We prove a geometric linearisation result for minimisers of optimal transport problems where the cost-function is strongly p-convex and of p-growth. Initial and target measures are allowed to be rough, but are assumed to be close to…

We consider the problem of learning the underlying graph of a sparse Ising model with $p$ nodes from $n$ i.i.d. samples. The most recent and best performing approaches combine an empirical loss (the logistic regression loss or the…

This paper investigates the generalized convexity properties of the Lambert $W$ function, defined as the solution to $W(z)e^{W(z)}=z$. Focusing on $H_{p,q}$-convexity and concavity with respect to H\"older means, we derive necessary and…

Let E/Q be an elliptic curve and p be a prime number, and let G be the Galois group of the extension of Q obtained by adjoining the coordinates of the p-torsion points on E. We determine all cases when the Galois cohomology group H^1(G,…