Related papers: A remark on staircase laminates in restricted sets

Regularity theorems \`a la Avellaneda-Lin are an indispensable part of the modern quantitative theory of stochastic homogenization. While interior regularity results for random elliptic operators have been available for a while, on general…

In this paper, we formulate newly a hierarchical convex optimization for multiclass SVM achieving maximum pairwise margins with least empirical hinge-loss. This optimization problem is a most faithful as well as robust multiclass extension…

Low-rank approximation of a matrix by means of random sampling has been consistently efficient in its empirical studies by many scientists who applied it with various sparse and structured multipliers, but adequate formal support for this…

This article presents an improvement and extension of the heuristic first presented by Hougardy, Lutz, and Zelke in 2010 for realizing triangulated orientable surfaces with few vertices by a simplex-wise linear embedding. The improvement…

This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…

We introduce a new method to approximate integrals $\int_{\mathbb{R}^d} f(\boldsymbol{x}) \, \mathrm{d} \boldsymbol{x}$ which simply scales lattice rules from the unit cube $[0,1]^d$ to properly sized boxes on $\mathbb{R}^d$, hereby…

We extend the notion of regularized integrals introduced by Li-Zhou that aims to assign finite values to divergent integrals on configuration spaces of Riemann surfaces. We then give cohomological formulations for the extended notion using…

We prove upper bounds on the order of convergence of lattice based algorithms for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study…

We construct a family of planar self-affine carpets with overlaps using lower triangular matrices in a way that generalizes the original Gatzouras--Lalley carpets defined by diagonal matrices. Assuming the rectangular open set condition,…

In the first part of this paper, we establish a conditional optimality result for an adaptive mixed finite element method for the stationary Stokes problem discretized by the standard Taylor-Hood elements, under the assumption of the…

P. Buser and P. Sarnak showed in 1994 that the maximum, over the moduli space of Riemann surfaces of genus s, of the least conformal length of a nonseparating loop, is logarithmic in s. We present an application of (polynomially) dense…

Szemer\'edi's regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lov\'asz and Szegedy [L. Lov\'asz and B. Szegedy: Szemer\'edi's Lemma for the analyst, Geometric…

This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…

Proctor's work on staircase plane partitions yields an enumeration of lozenge tilings of a halved hexagon on the triangular lattice. Rohatgi recently extended this tiling enumeration to a halved hexagon with a triangle removed from the…

The classical theory of regularity of embeddings of compact convex sets was developed in the 1970s, exclusively in the real case, and even there it does not appear to have been stated in its simplest form. We begin by revisiting this…

Convergence of projection-based methods for nonconvex set feasibility problems has been established for sets with ever weaker regularity assumptions. What has not kept pace with these developments is analogous results for convergence of…

A compactness theorem is proved for a family of K\"{a}hler surfaces with constant scalar curvature and volume bounded from below, diameter bounded from above, Ricci curvature bounded and the signature bounded from below. Furthermore, a…

The theory of matrix splitting is a useful tool for finding solution of rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit theory of weak regular splittings for rectangular…

In this article a topology optimization method is developed, which is aware of material uncertainties. The uncertainties are handled in a worst-case sense, i.e. the worst possible material distribution over a given uncertainty set is taken…

Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we…