相关论文: Weak approximation for linear systems of quadrics
We have derived that on certain Banach spaces having a graph structure $G$, the iterations for asymptotically $G$-nonexpansive map will converge weakly towards a fixed point. This result unifies and extends several theorems on fixed points…
We give a necessary and sufficient condition for gluings of hyperconvex metric spaces along weakly externally hyperconvex subsets in order that the resulting space be hyperconvex. This leads to a full characterization of gluings of two…
Let $H$ be a Hilbert space. We investigate the properties of weak limit points of iterates of random projections onto $K\geq 2$ closed convex sets in $H$ and the parallel properties of weak limit points of residuals of random greedy…
In this paper, we provide a new scheme for approximating the weakly efficient solution set for a class of vector optimization problems with rational objectives over a feasible set defined by finitely many polynomial inequalities. More…
We show that the weak limit of a quasiminimizing sequence is a quasiminimal set. This generalizes the notion of weak limit of a minimizing sequences introduced by De Lellis, De Philippis, De Rosa, Ghiraldin and Maggi. This result is also…
We show that for every nontrivial potential space $L^{1}_{K}(\mathbb{R}^{n})$, there exists an approach region for which the associated maximal function is of weak-type, but the boundedness for the completed region is false, which is in…
Quantum statistical models (i.e., families of normalized density matrices) and quantum measurements (i.e., positive operator-valued measures) can be regarded as linear maps: the former, mapping the space of effects to the space of…
Given a finite set $X$ of points in $R^n$ and a family $F$ of sets generated by the pairs of points of $X$, we determine volumetric and structural conditions for the sets that allow us to guarantee the existence of a positive-fraction…
The problem of characterizing weak limits of sequences of solutions for a non-linear diffusion equation of $p$-laplacian type is addressed. It is formulated in terms of certain moments of underlying Young measures associated with main…
A map $\varphi:K\to R^2$ of a graph $K$ is approximable by embeddings, if for each $\varepsilon>0$ there is an $\varepsilon$-close to $\varphi$ embedding $f:K\to R^2$. Analogous notions were studied in computer science under the names of…
We prove the Hasse principle and weak approximation for varieties defined over number fields by the nonsingular intersection of pairs of quadratic forms in 8 variables. The argument develops work of Colliot-Thelene, Sansuc and…
We characterize the number of points for which there exist non-empty Terracini sets of points in $\mathbb{P}^n$. Then we study minimally Terracini finite sets of points in $\mathbb{P}^n$ and we obtain a complete description in the case of…
For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then…
We introduce a notion of quasilinear parabolic equations over metric measure spaces. Under sharp structural conditions, we prove that local weak solutions are locally bounded and satisfy the parabolic Harnack inequality. Applications…
In this article, we establish radial symmetry for positive weak solutions of a class of mixed local-nonlocal equations with possibly singular nonlinearity via the moving plane method. Furthermore, we provide a quantitative version of…
Given a finite point set $P\subset\mathbb{R}^d$, we call a multiset $A$ a one-sided weak $\varepsilon$-approximant for $P$ (with respect to convex sets), if $|P\cap C|/|P|-|A\cap C|/|A|\leq\varepsilon$ for every convex set $C$. We show…
We study approximation of embeddings between finite dimensional L_p spaces in the quantum model of computation. For the quantum query complexity of this problem matching (up to logarithmic factors) upper and lower bounds are obtained. The…
We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…
Algorithms often carry out equally many computations for "easy" and "hard" problem instances. In particular, algorithms for finding nearest neighbors typically have the same running time regardless of the particular problem instance. In…
The existence of a positive entire weak solution to a singular quasi-linear elliptic system with convection terms is established, chiefly through perturbation techniques, fixed point arguments, and a priori estimates. Some regularity…