In this paper we extend the notion of rearrangement of nonnegative functions to the setting of Carnot groups. We define rearrangement with respect to a given family of anisotropic balls Br, or equivalently with respect to a gauge ||x||, and prove basic regularity properties of this construction. If u is a bounded nonnegative real function with compact support, we denote by u★ its rearrangement. Then, the radial function u★ is of bounded variation. In addition, if u is continuous then u★ is continuous, and if u belongs to the horizontal Sobolev space Wh1,p, then Dhu★(x)/|Dh(||x||)|is in Lp. Moreover, we found a generalization of the inequality of Pólya and Szegö
here p ≥ 1.
In computer networks, toughness is an important parameter which is used to measure the vulnerability of the network. Zhou et al. obtains a toughness condition for a graph to be fractional (k, m)-deleted and presents an example to show the sharpness of the toughness bound. In this paper, we remark that the previous example does not work and inspired by this fact, we present a new toughness condition for fractional (k, m)-deleted graphs improving the existing one. Finally, we state an open problem.
Let H be a hypergraph with n vertices. Suppose that d1, d2,..., dn are degrees of the vertices of H. The t-th graph entropy based on degrees of H is defined as
where t is a real number and the logarithm is taken to the base two. In this paper we obtain upper and lower bounds of Idt(H) for t=1, when H is among all uniform supertrees, unicyclic uniform hypergraphs and bicyclic uniform hypergraphs, respectively.