Results 71 to 80 of about 33,078 (239)
Isoperimetric problems for a nonlocal perimeter of Minkowski type
We prove a quantitative version of the isoperimetric inequality for a non local perimeter of Minkowski type. We also apply this result to study isoperimetric problems with repulsive interaction terms, under convexity constraints.
Cesaroni, Annalisa, Novaga, Matteo
core +1 more source
Dimer models and conformal structures
Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source
Uniqueness of Solutions to a Nonlinear Elliptic Hessian Equation
Through an Alexandrov-Fenchel inequality, we establish the general Brunn-Minkowski inequality. Then we obtain the uniqueness of solutions to a nonlinear elliptic Hessian equation on Sn.
Siyuan Li
doaj +1 more source
Quantitative stability for the Brunn–Minkowski inequality [PDF]
We prove a quantitative stability result for the Brunn-Minkowski inequality: if $|A|=|B|=1$, $t \in [ ,1- ]$ with $ >0$, and $|tA+(1-t)B|^{1/n}\leq 1+ $ for some small $ $, then, up to a translation, both $A$ and $B$ are quantitatively close (in terms of $ $) to a convex set $K$.
Figalli, Alessio, Jerison, David S.
openaire +3 more sources
Deadbeat Robust Model Predictive Control: Robustness Without Computing Robust Invariant Sets
ABSTRACT Deadbeat Robust Model Predictive Control (DRMPC) is introduced as a new approach of Robust Model Predictive Control (RMPC) for linear systems with additive disturbances. Its main idea is to completely extinguish the effect of the disturbances in the predictions within a small number of time steps, called the deadbeat horizon.
Georg Schildbach
wiley +1 more source
Benchmarking Contact Detection Algorithms Used in Polyhedral Particle System
ABSTRACT A critical assessment of contact detection algorithms routinely used for simulating convex polyhedra in the Discrete Element Method is presented herein. Specifically, we focus on accuracy and computational efficiency and discuss the advantages and limitations of four different algorithms: the coupled Gilbert–Johnson–Keerthi – Expanding ...
Yuval Keissar +2 more
wiley +1 more source
The General Minkowski Inequality for Mixed Volume
Mixed volume is an important notion in convex geometry, which is the extension of volume and surface area. The Minkowski inequality for mixed volume plays a vital role in convex geometry.
Yusha Lv
doaj +1 more source
Dual Orlicz geominimal surface area
The L p $L_{p}$ -geominimal surface area was introduced by Lutwak in 1996, which extended the important concept of the geominimal surface area. Recently, Wang and Qi defined the p-dual geominimal surface area, which belongs to the dual Brunn-Minkowski ...
Tongyi Ma, Weidong Wang
doaj +1 more source
Some new refinements of the Young, Hölder, and Minkowski inequalities
We prove and discuss some new refined Hölder inequalities for any p > 1 $p>1$ and also a reversed version for 0 < p < 1 $0 ...
Ludmila Nikolova +2 more
doaj +1 more source
New sharp Gagliardo-Nirenberg-Sobolev inequalities and an improved Borell-Brascamp-Lieb inequality [PDF]
We propose a new Borell-Brascamp-Lieb inequality which leads to novel sharp Euclidean inequalities such as Gagliardo-Nirenberg-Sobolev inequalities in R^n and in the half-space R^n\_+.
Bolley, François +4 more
core +2 more sources

