Results 171 to 180 of about 1,372 (214)

Towards Nonlinearity: The <i>p</i>-Regularity Theory. [PDF]

open access: yesEntropy (Basel)
Bednarczuk E   +4 more
europepmc   +1 more source

A free boundary approach to shape optimization problems. [PDF]

open access: yesPhilos Trans A Math Phys Eng Sci, 2015
Bucur D, Velichkov B.
europepmc   +1 more source

On tiny-probability lattice enumeration. [PDF]

open access: yesJpn J Ind Appl Math
Aono Y, Nguyen PQ.
europepmc   +1 more source

Isoperimetric weights and generalized uncertainty inequalities in metric measure spaces [PDF]

open access: yesJournal of Functional Analysis, 2016
We extend the recent L1 uncertainty inequalities obtained in [13] to the metric setting. For this purpose we introduce a new class of weights, named isoperimetric weights, for which the growth of the measure of their level sets μ can be controlled by rI ...
Joaquim Martin, Mario Milman
exaly   +2 more sources

Sobolev and isoperimetric inequalities with monomial weights

open access: yesJournal of Differential Equations, 2013
We consider the monomial weight |x1|A1⋯|xn|An in Rn, where Ai⩾0 is a real number for each i=1,…,n, and establish Sobolev, isoperimetric, Morrey, and Trudinger inequalities involving this weight.
Xavier Cabré, Xavier Ros-Oton
exaly   +2 more sources

Uncertainty Inequalities on Groups and Homogeneous Spaces via Isoperimetric Inequalities [PDF]

open access: yesJournal of Geometric Analysis, 2014
We prove a new family of L^p uncertainty inequalities on fairly general groups and homogeneous spaces, both in the smooth and in the discrete setting. The novelty of our technique consists in the observation that the L^1 endpoint can be proved by means ...
Gian Maria Dall'Ara, Dario Trevisan
exaly   +2 more sources

Isoperimetric Inequalities and Eigenvalues

SIAM Journal on Discrete Mathematics, 1997
Summary: An upper bound is given on the minimum distance between \(i\) subsets of same size of a regular graph in terms of the \(i\)th largest eigenvalue in absolute value. This yields a bound on the diameter in terms of the \(i\)th largest eigenvalue for any integer \(i\). Our bounds are shown to be asymptotically tight for explicit families of graphs
openaire   +2 more sources

Home - About - Disclaimer - Privacy