Related papers: Restriction Estimates for space curves with respec…
We prove sharp $L^p-L^q$ estimates for averaging operators along general polynomial curves in two and three dimensions. These operators are translation-invariant, given by convolution with the so-called affine arclength measure of the curve…
We derive optimal estimates for the Bergman kernel and the Bergman metric for certain model domains in $\mathbb{C}^2$ near boundary points that are of infinite type. Being unbounded models, these domains obey certain geometric constraints…
A uniform bound of intersection multiplicities of curves and divisors on abelian varieties is proved by algebraic geometric methods. It extends and improves a result obtained by A. Buium with a different method based on Kolchin's…
This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive improved upper and lower bounds based on the entropy of a…
In covariance matrix estimation, one of the challenges lies in finding a suitable model and an efficient estimation method. Two commonly used modelling approaches in the literature involve imposing linear restrictions on the covariance…
We investigate combinatorial bounds for the total Tjurina numbers of plane curve arrangements. Focusing on arrangements of lines and conics in $\mathbb{P}^2$ that admit only ordinary quasi-homogeneous singularities, we derive new structural…
For marketing or power grid management purposes, many studies based on the analysis of the total electricity consumption curves of groups of customers are now carried out by electricity companies. Aggregated total or mean load curves are…
A coordinate-free proof of the Maximum Principle is provided in the specific case of an optimal control problem with fixed time. Our treatment heavily relies on a special notion of variation of curves that consist of a concatenation of…
We study half-space linear kinetic equations with general boundary conditions that consist of both given incoming data and various type of reflections, extending our previous work [LLS14] on half-space equations with incoming boundary…
We study the problem of estimating a mean pattern from a set of similar curves in the setting where the variability in the data is due to random geometric deformations and additive noise. We propose an estimator based on the notion of…
Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We…
This paper concerns with mesh restrictions that are needed to satisfy several important mathematical properties -- maximum principles, comparison principles, and the non-negative constraint -- for a general linear second-order elliptic…
In this paper, we propose a method to obtain a constrained approximation of a rational B\'{e}zier curve by a polynomial B\'{e}zier curve. This problem is reformulated as an approximation problem between two polynomial B\'{e}zier curves…
A constrained multivariate linear model is a multivariate linear model with the columns of its coefficient matrix constrained to lie in a known subspace. This class of models includes those typically used to study growth curves and…
This paper is devoted to the complete classification of space curves under affine transformations in the view of Cartan's theorem. Spivak has introduced the method but has not found the invariants. Furthermore, for the first time, we…
In this paper, we generalize the results presented in [5] for the case of real algebraic space curves. More precisely, given an algebraic space curve C (parametrically or implicitly defined), we show how to compute the generalized…
It is crucial for robots to be aware of the presence of constraints in order to acquire safe policies. However, explicitly specifying all constraints in an environment can be a challenging task. State-of-the-art constraint inference…
In this paper, we study when we might expect the optimization curve induced by gradient descent to be \emph{convex} -- precluding, for example, an initial plateau followed by a sharp decrease, making it difficult to decide when optimization…
We prove a Diophantine approximation inequality for closed subschemes on surfaces which can be viewed as a joint generalization of recent inequalities of Ru-Vojta and Heier-Levin in this context. As applications, we study various…
We propose here a number of approaches to implement constraint propagation for arithmetic constraints on integer intervals. To this end we introduce integer interval arithmetic. Each approach is explained using appropriate proof rules that…