Existence and characterization of regions minimizing perimeter under a volume constraint inside Euclidean cones

We study the problem of existence of regions separating a given amount of volume with the least possible perimeter inside a Euclidean cone. Our main result shows that nonexistence for a given volume implies that the isoperimetric profile of the cone coincides with the one of the half-space. This allows us to give some criteria ensuring existence of isoperimetric regions: for instance, local convexity of the cone at some boundary point.

We also characterize which are the stable regions in a convex cone, i.e., second order minima of perimeter under a volume constraint. From this it follows that the isoperimetric regions in a convex cone are the euclidean balls centered at the vertex intersected with the cone.

     

直径不超过4的树的割宽

§ 1　IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th…     

凸度量空间中单值和集值映象的公共不动点定理

§ 1.　Introduction　　Anecessaryandsufficientconditionandasufficientconditiontoensurethataset valuedmappingandasingle valuedmappinginacompletemetricspaceandacompleteconvexmetricspacehavingacommonfixedpointarerespectivelygivenin [1 ] .Meanwhilethemainresultsin[2 ]— [5]areimprovedandextendedin [1 ] .Inthispaper ,theexistenceatcommonfixedpointsoftwoset valuedmappingandasing valuedmappingwerestudied ,andthecorrespond ingresultsin [1 ]— [5]wereextendedandimproved .Let(X ,d)beanon emptymetricspa…     

关于解椭圆型问题的多子域D-N交替算法

构造一个求解椭圆型边值问题的多子域D—N交替算法，导出对应的容度方程和等价的迭代法，证明算法的收敛性。     

The equivalence between the convergence of Ishikawa and Mann iterations with errors for strongly successively pseudocontractive mappings without Lipschitzian assumption

In this paper we prove some new equivalences between convergence of the Ishikawa and Mann iteration sequences with errors in two schemes by Xu [Y.G. Xu, Ishikawa and Mann iteration process with errors for nonlinear strongly accretive operator equations, J. Math. Anal. Appl. 224 (1998) 91-101] and Liu [L.S. Liu, Ishikawa and Mann iterative process with errors for nonlinear strongly accretive mappings in Banach spaces, J. Math. Anal. Appl. 194 (1995) 114-125], respectively, for strongly successively pseudocontractive mappings. Our main results improve and extend the corresponding results of the all references listed in this article.     

Regularity of Harmonic Functions in Cheeger-Type Sobolev Spaces

We give a geometric approach to the study of the regularity of harmonic functions in Cheeger-type Sobolev spaces, and prove the Hölder continuity of such functions. In the proof, we give a definition of an upper curvature bound of the unit sphere of a Banach space, which seems to be of independent interest.     

α-FUZZY PAIRWISE RETRACT OF L-VALUED PAIRWISE STRATIFICATION SPACES

The notion of a fuzzy retract was introduced by Rodabaugh (1981). The notion of a fuzzy pairwise retract was introduced in 2001. Some weak forms and some strong forms of α-continuous mappings were introduced in 1988 and 1997. The authors extend some of these forms to the L-fuzzy bitopological setting and construct various α-fuzzy pairwise retracts. The concept of weakly induced spaces in the case L = [0,1] was introduced by Martin (1980). Liu and Luo (1987) generalized this notion to the case that L is an arbitrary F-lattice and introduced the notion of induced L-fts. Several results are obtained, especially, for L-valued pairwise stratification spaces.     

ON DIRICHLET TYPE SPACES AND α-BLOCH SPACES IN THE UNIT BALL OF Cn

In this paper, the authors study the inclusion relations between Dirichlet type spaces DT and α-Bloch spacesβα by means of higher radial derivative. The strictness and the best possibility of the inclusion relations are shown with constructive methods.Furthermore, they sharpen one of the results when T = n, which proves that a conjecture in [7] is true.     

Amine‐blocked polyisocyanates. I. Synthesis of novel N‐methylaniline‐blocked polyisocyanates and deblocking studies using hot‐stage fourier transform infrared spectroscopy

A series of substituted N‐methylaniline‐blocked polyisocyanates based on 4,4′‐methylenebis(phenyl isocyanate) and poly(tetrahydrofuran) were prepared and characterized thoroughly with FTIR, ¹H NMR, and ¹³C NMR spectroscopy methods. Compared with unsubstituted N‐methylaniline, a blocking agent with an electron‐releasing substituent at the para position took a shorter time, whereas those with an electron‐releasing substituent at the ortho position or an electron‐withdrawing substituent at the ortho and para positions took longer times for the blocking reaction. The thermal dissociation reactions of blocked polyisocyanates were carried out with an FTIR spectrophotometer attached to hot‐stage accessories under dynamic and isothermal conditions. The dynamic method was used to determine the deblocking temperature, and the isothermal method was used to calculate the deblocking kinetics and activation parameters. The cure times of blocked polyisocyanates with hydroxyl‐terminated polybutadiene were also determined. The deblocking temperatures, the results of cure‐time studies, and the kinetic parameters revealed that the thermal dissociation of the N‐methylaniline‐blocked polyisocyanates was retarded by electron‐donating substituents and facilitated by electron‐withdrawing substituents. The action of N‐methylanilines as blocking agents for isocyanate was explained by the formation of a four‐center, intramolecularly hydrogen‐bonded ring structure during the thermal dissociation of the blocked polyisocyanates. The formation of such a hydrogen‐bonded ring structure was confirmed and supported by variable‐temperature ¹H NMR studies and entropy parameters, respectively. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 1557–1570, 2007     

Pseudoaffinity, de Boor algorithm, and blossoms

In order to ensure existence of a de Boor algorithm (hence of a B-spline basis) in a given spline space with (n+1)-dimensional sections, it is important to be able to generate each spline by restriction to the diagonal of a symmetric function of n variables supposed to be pseudoaffine w.r. to each variable. We proved that a way to obtain these three properties (symmetry, n-pseudoaffinity, diagonal property) is to suppose the existence of blossoms on the set of admissible n-tuples, given that blossoms are defined in a geometric way by means of intersections of osculating flats. In the present paper, we examine the converse: do symmetry, n-pseudoaffinity, and diagonal property imply existence of blossoms?