Related papers: Simplex slicing: an asymptotically-sharp lower bou…
We develop minimal slicing via capillary hypersurfaces to understand positive scalar curvature metric on manifolds with boundary. The method provides rigidity statements once the regularity of minimizers of capillary area functional holds.…
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…
This work presents several new results concerning the analysis of the convergence of binary, univariate, and linear subdivision schemes, all related to the {\it contractivity factor} of a convergent scheme. First, we prove that a convergent…
We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a contineus region ($\impre$ model) or a…
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
For arbitrary planar convex domain, we compute the behavior of Christoffel function up to a constant factor using comparison with other simple reference domains. The lower bound is obtained by constructing an appropriate ellipse contained…
We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…
We prove lower bounds for the fraction of edges of an $r$-graph which can be covered by the union of $k$ 1-factors. The special case $r=3$ yields some known results for cubic graphs. Furthermore, we introduce the concept of…
Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…
In this paper we consider an inverse problem of determining a minimal surface embedded in a Riemannian manifold. We show under a topological condition that if $\Sigma$ is a $2$-dimensional embedded minimal surface, then the knowledge of the…
In this paper we summarize some known facts on slice topology in the quaternionic case, and we deepen some of them by proving new results and discussing some examples. We then show, following [18], how this setting allows us to generalize…
We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…
We present some old and recent regularity results concerning minimal and almost minimal sets in domains of the Euclidean space. We concentrate on a sliding variant of Almgren's notion of minimality, which is well suited in the context of…
A difference basis with respect to $n$ is a subset $A \subseteq \mathbb{Z}$ such that $A - A \supseteq \{1, \ldots, n\}$. R\'{e}dei and R\'{e}nyi showed that the minimum size of a difference basis with respect to $n$ is $(c+o(1))\sqrt{n}$…
We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…
We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…
In this paper we show that every area minimizing cone C^{n-1} in R^n can be approximated by entirely smooth area minimizing hypersurfaces. This extensively uses hyperbolic unfoldings of such hypersurfaces and the resulting potential theory…
In this paper we formulate and solve extremal problems in the d-dimensional Euclidean space and further in hypergraphs, originating from problems in stoichiometry and elementary linear algebra. The notion of affine simplex is the bridge…
Finite element approximations of minimal surface are not always precise. They can even sometimes completely collapse. In this paper, we provide a simple and inexpensive method, in terms of computational cost, to improve finite element…
The main contribution of this note is to establish a framework to extend results of tensor functions over specific field to general field. As a consequence of this framework, we extend the existing work to more general settings: \emph{(1)}…