Results 1 to 10 of about 1,484 (254)
Rearrangement Inequalities [PDF]
In recent years a number of inequalities have appeared which involve rearrangements of vectors in Rn and of measurable functions on a finite measure space. These inequalities are not only interesting in themselves, but also are important in investigations involving rearrangement ...
Peter Day
openalex +3 more sources
On matrix rearrangement inequalities [PDF]
Given two symmetric and positive semidefinite square matrices A , B A, B , is it true that any matrix given as the product of m m copies of A A and n n copies of B B in a particular sequence must be dominated in the spectral norm by the ...
Rima Alaifari +3 more
openalex +3 more sources
Rearrangement Inequalities and the Alternahedron [PDF]
We formulate and prove a rearrangement type inequality and use it to give a description of the face lattice of a certain polytope that is naturally associated to the alternating group An.
James Cruickshank, Seamus B. Kelly
openalex +3 more sources
Rearrangement in variational inequalities [PDF]
The authors establish some isoperimetric inequalities for the solution of an obstacle problem in the case the coincidence set reaches the boundary. An optimal lower bound for the measure of the coincidence set is also obtained. The method of proof is based on the technique of rearrangements developed by \textit{G.
Catherine Bandle, Jacqueline Mossino
openalex +3 more sources
Rearrangement Inequalities on the Lattice Graph [PDF]
AbstractThe Polya–Szegő inequality in states that, given a nonnegative function , its spherically symmetric decreasing rearrangement is ‘smoother’ in the sense of for all . We study analogues on the lattice grid graph . The spiral rearrangement is known to satisfy the Polya–Szegő inequality for , the Wang‐Wang rearrangement satisfies it for and no ...
Shubham Gupta, Stefan Steinerberger
openalex +3 more sources
Some matrix rearrangement inequalities [PDF]
We investigate a rearrangement inequality for pairs of n-square matrices: Let |A\|_p denote the C^p trace norm of an n-square matrix A. Consider the quantity |A+B|_p^p + |A-B|_p^p. Under certain positivity conditions, we show that this is nonincreasing for a natural ``rearrangement'' of the matrices A and B when 1 \le p \le 2.
Eric A. Carlen, Élliott H. Lieb
openalex +4 more sources
Rearrangement and Prekopa-Leindler type inequalities [PDF]
We investigate the interactions of functional rearrangements with Prekopa–Leindler type inequalities. It is shown that certain set theoretic rearrangement inequalities can be lifted to functional analogs, thus demonstrating that several important integral inequalities tighten on functional rearrangement about “isoperimetric” sets with respect to a ...
James Melbourne
openalex +3 more sources
Mixed norms and rearrangements: Sobolev's inequality and Littlewood's inequality [PDF]
Let \(N(f)=N_ 1(f)+...+N_ K(f)\) for a measurable function f over \(R^ K\), where \(N_ k(f)\) is the mixed norm of power (1,...,1,\(\infty,1,...,1)\), \(\infty\) being on the k-th place, \(k=1,2,...,K\), \(K\geq 2\). It is shown that if \(N(f)0\) the set where \(| g| >\lambda\) is essentially a K-cube with edges parallel to the coordinate axes, then ...
John J. F. Fournier
openalex +2 more sources
Multi-vector Stochastic Rearrangement Inequalities [PDF]
Gopal, G.
openalex +2 more sources

