Related papers: Simplex slicing: an asymptotically-sharp lower bou…
In this paper, we study the differential inclusion associated to the minimal surface system for two-dimensional graphs in $\mathbb{R}^{2 + n}$. We prove regularity of $W^{1,2}$ solutions and a compactness result for approximate solutions of…
We show that a set of $n$ algebraic plane curves of constant maximum degree can be cut into $O(n^{3/2}\operatorname{polylog} n)$ Jordan arcs, so that each pair of arcs intersect at most once, i.e., they form a collection of pseudo-segments.…
Given a rectangle $R$ with area $A$ and a set of areas $L=\{A_1,...,A_n\}$ with $\sum_{i=1}^n A_i = A$, we consider the problem of partitioning $R$ into $n$ sub-regions $R_1,...,R_n$ with areas $A_1,...,A_n$ in a way that the total…
We study the minimization of convex, variational integrals of linear growth among all functions in the Sobolev space $W^{1,1}$ with prescribed boundary values (or its equivalent formulation as a boundary value problem for a degenerately…
The Fourier-based analysis customarily employed to analyze the dynamics of a simple pendulum is here revisited to propose an elementary iterative scheme aimed at generating a sequence of analytical approximants of the exact law of motion.…
We consider the Schr\"{o}dinger equation $(i\partial_t+\Delta)u=0$ on an $n$-dimensional simplex with Dirichlet boundary conditions. We use a commutator argument along with integration by parts to obtain an observability asymptotic for any…
We give a level one result for the "symmetry integral", say $I_f(N,h)$, of essentially bounded $f:\N \to \R$; i.e., we get a kind of "square-root cancellation" \thinspace bound for the mean-square (in $N<x\le 2N$) of the "symmetry"…
This paper classifies spherical objects in various geometric settings in dimensions two and three, including both minimal and partial crepant resolutions of Kleinian singularities, as well as arbitrary flopping 3-fold contractions with only…
We study the min-max optimization problem where each function contributing to the max operation is strongly-convex and smooth with bounded gradient in the search domain. By smoothing the max operator, we show the ability to achieve an…
We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…
We consider polygonal tilings of certain regions and use these to give intuitive definitions of tiling-based perimeter and area. We apply these definitions to rhombic tilings of Elnitsky polygons, computing sharp bounds and average values…
We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the known…
A novel algorithm is proposed for quantitative comparisons between compact surfaces embedded in the three-dimensional Euclidian space. The key idea is to identify those objects with the associated surface measures and compute a weak…
Let $$ F(x, y) = \prod\limits_{k = 0}^{n - 1}(\delta_kx - \gamma_ky) $$ be a binary form of degree $n \geq 1$, with complex coefficients, written as a product of $n$ linear forms in $\mathbb C[x, y]$. Let $$ h_F = \prod\limits_{k = 0}^{n -…
We provide a characterization of the radii minimal projections of polytopes onto $j$-dimensional subspaces in Euclidean space $\E^n$. Applied on simplices this characterization allows to reduce the computation of an outer radius to a…
Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…
We give a partial negative answer to a question left open in a previous work by Brasco and the first and third-named authors concerning the sharp constant in the fractional Hardy inequality on convex sets. Our approach has a geometrical…
We prove some uniqueness results for conics of minimal area that enclose a compact, full-dimensional subset of the elliptic plane. The minimal enclosing conic is unique if its center or axes are prescribed. Moreover, we provide sufficient…
Assume that f is a strict convex function with a unique minimum in R^n. We divide the vector of n-variables to d groups of vector subvariables with d at least two. We assume that we can find the partial minimum of f with respect to each…
The Johnson-Lindenstrauss (JL) Lemma introduced the concept of dimension reduction via a random linear map, which has become a fundamental technique in many computational settings. For a set of $n$ points in $\mathbb{R}^d$ and any fixed…