Related papers: Restriction Estimates for space curves with respec…
In motion planning problems for autonomous robots, such as self-driving cars, the robot must ensure that its planned path is not in close proximity to obstacles in the environment. However, the problem of evaluating the proximity is…
In the last decade, various works have used statistics on relations to improve both the theory and practice of conjunctive query execution. Starting with the AGM bound which took advantage of relation sizes, later works incorporated…
We show that a general estimate in the $\dib$-Neumann problem implies a upper bound on the order of contact of a complex curve with the boundary and a lower bound on the rate of the Levi form of a bounded family of weights.
We prove sharp endpoint results for the Fourier restriction operator associated to nondegenerate curves in $\Bbb R^d$, $d\ge 3$, and related estimates for oscillatory integral operators. Moreover, for some larger classes of curves in $\Bbb…
By making use of the classification of real simple Lie algebra, we get the maximum of the squared length of restricted roots case by case, thus we get the upper bounds of sectional curvature for irreducible Riemannian symmetric spaces of…
We prove (adjoint) bilinear restriction estimates for general phases at different scales in the full non-endpoint mixed norm range, and give bounds with a sharp and explicit dependence on the phases. These estimates have applications to…
We review the properties of the constraint equations, from their geometric origin in hypersurface geometry through to their roles in the Cauchy problem and the Hamiltonian formulation of the Einstein equations. We then review properties of…
We prove generalized Virasoro constraints for the relative Gromov-Witten theories of all nonsingular target curves. Descendents of the even cohomology classes are studied first by localization, degeneration, and completed cycle methods.…
In this paper we establish the optimal multilinear restriction estimate for n-1 hypersurfaces with some curvature, where $n$ is the dimension of the underlying space. The result is sharp up to the endpoint and the role of curvature is made…
Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for these constraints. To describe them we introduce integer interval…
In this paper, we present a novel approach to the problem of merging of B\'ezier curves with respect to the $L_2$-norm. We give illustrative examples to show that the solution of the conventional merging problem may not be suitable for…
We prove discrete restriction estimates for a broad class of hypersurfaces and varieties of intermediate codimension. For our result about hypersurfaces, we use Bourgain's arithmetic version of the Tomas--Stein method and Magyar's…
This article is a study guide for ``On restricted projections to planes in $\mathbb R^3$" [arXiv:2207.13844] by Gan, Guo, Guth, Harris, Maldague and Wang. We first present the main problems and preliminaries related to restricted…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
A new method of metric space investigation, based on classification of its finite subspaces, is suggested. It admits to derive information on metric space properties which is encoded in metric. The method describes geometry in terms of only…
We prove a class of modified paraboloid restriction estimates with a loss of angular derivatives for the full set of paraboloid restriction conjecture indices. This result generalizes the paraboloid restriction estimate in radial case from…
A geometric setup for constrained variational calculus is presented. The analysis deals with the study of the extremals of an action functional defined on piecewise differentiable curves, subject to differentiable, non-holonomic…
The adjoint method is an efficient way to numerically compute gradients in optimization problems with constraints, but is only formulated to differentiable cost and constraint functions on real variables. With the introduction of complex…
We develop a method for proving sup-norm and H\"older estimates for $\overline{\partial}$ on wide class of finite type pseudoconvex domains in $\mathbb{C}^n$. A fundamental obstruction to proving sup-norm estimates is the possibility of…
We consider stochastic approximations which arise from such applications as data communications and image processing. We demonstrate why constraints are needed in a stochastic approximation and how a constrained approximation can be…