On the extremal sets of extremal quasiconformal mappings

The properties of the extremal sets of extremal quasiconformal mappings are discussed. It is proved that if an extremal Beltrami coefficient μ(z) is not uniquely extremal, then there exists an extremal Beltrami coefficient v(z) in its equivalent class and a compact subset E Δ with positive measure such that the essential upper bound of v(z) on E is less than the norm of [μ].     

Capturing the multivariate extremal index: bounds and interconnections

The multivariate extremal index function is a direction specific extension of the well-known univariate extremal index. Since statistical inference on this function is difficult it is desirable to have a broad characterization of its attributes. We extend the set of common properties of the multivariate extremal index function and derive sharp bounds for the entire function given only marginal dependence. Our results correspond to certain restrictions on the two dependence functions defining the multivariate extremal index, which are opposed to Smith and Weissman’s (1996) conjecture on arbitrary dependence functions. We show further how another popular dependence measure, the extremal coefficient, is closely related to the multivariate extremal index. Thus, given the value of the former it turns out that the above bounds may be improved substantially. Conversely, we specify improved bounds for the extremal coefficient itself that capitalize on marginal dependence, thereby approximating two views of dependence that have frequently been treated separately. Our results are completed with example processes.      

New Extremal Type I Codes of Lengths 40, 42, and 44

It is known that it is possible to construct a generator matrix for a self-dual code of length 2n+2 from a generator matrix of a self-dual code of length 2n. With the aid of a computer, we construct new extremal Type I codes of lengths 40, 42, and 44 from extremal self-dual codes of lengths 38, 40, and 42 respectively. Among them are seven extremal Type I codes of length 44 whose weight enumerator is 1+224y ⁸+872y ¹⁰+·. A Type I code of length 44 with this weight enumerator was not known to exist previously.     

Nontrivial Critical Networks. Singularities of Lagrangians and a Criterion for Criticality

We single out the class of so-called quasiregular Lagrangians, which have singularities on the zero section of the cotangent bundle to the manifold on which extremal networks are considered. A criterion for a network to be extremal is proved for such Lagrangians: the Euler--Lagrange equations must be satisfied on each edge, and some matching conditions must be valid at the vertices.     

k＜1时Cartan-Hartogs域上的极值问题

本文讨论两种类型的极值问题,其中一种类型的极值问题可以认为是复平面上经典的Schwarz引理在高维的一个推广;另一种类型的极值是某空间上的度量,可以用来考虑域的双全纯等价分类问题．在本文中,k＜1时Cartan-Hartogs域与单位超球间的极值与极值映照被得到。     

关于极面的ADJOINT收缩

高维代数簇的半线收缩已具有很多研究。将它们推广到极面收缩对高维簇的双有理分类理论是很有意义的。设X是非奇异的n维射影簇,L是X上的ample除子,f:X→Y是以Kx(n-3)L为支撑除子的极面收缩映射。当f不是双有理映射,Belktrametti等人系统的研究了f的结构。本文主要研究f是双有理映射时的情形。一个完整的结构定理被给出。     

环流形上的极值度量——存在性和K-稳定性

本文主要研究环流形上的极值度量的存在性和K-稳定性.本文将Donaldson关于环流形上有关常数量曲率度量的稳定性概念的约化推广到一般的极值度量的情形.通过这个约化,本文证明环流形上极值度量的存在性可以推出流形对于环形变的相对K-稳定性.在不知道是否存在极值度量的情形下,本文还给出环流形相对K-稳定的一个充分性条件.对环曲面的情形,基于Arrezo-Pacard-Singer的工作,本文证明任意一个环曲面上存在含有极值度量的Ka¨hler类,并给出一些环曲面上有不存在极值度量的K¨ahler类的例子.关于一般的环流形上的极值度量的存在性,本文用变分方法研究其弱解,证明在能量泛函逆紧性假设下,存在弱极小化子.     

Some results on extremal vectors and invariant subspaces

In 1996 P. Enflo introduced the concept of extremal vectors and their connection to the Invariant Subspace Problem. The study of backward minimal vectors gives a new method of finding invariant subspaces which is more constructive than the previously known methods. In this article we study the properties and behaviour of extremal vectors, give some new formulas related to backward minimal vectors and improve results from papers by Ansari and Enflo (1998) and Enflo (1998).

     

第四类超Cartan域上的极值问题

讨论了第四类超Cartan域Y_(Ⅳ)(N;n;k)上的极值问题,得到了第四类超Car- tan域与单位超球间的极值和极值映照.     

Disjoint unions of complete minors

Given integers r and s, and n large compared to r and s, we determine the maximum size of a graph of order n having no minor isomorphic to sK_r, the union of s disjoint copies of K_r.The extremal function depends on the relative sizes of r and s. If s is small compared to r the extremal function is essentially independent of s. On the other hand, if s is large compared to r, there is a unique extremal graph ; this assertion is a generalization of the case r=3 which is a classical result of Erd?s and Pósa.     

Weight Enumerators of Double Circulant Codes and New Extremal Self-Dual Codes

In this paper it is shown that the weight enumerator of a bordered double circulant self-dual code can be obtained from those of a pure double circulant self-dual code and its shadow through a relationship between bordered and pure double circulant codes. As applications, a restriction on the weight enumerators of some extremal double circulant codes is determined and a uniqueness proof of extremal double circulant self-dual codes of length 46 is given. New extremal singly-even [44,22,8] double circulant codes are constructed. These codes have weight enumerators for which extremal codes were not previously known to exist.     

Extremal Valued Fields

It is shown that every finite-dimensional skew field whose center is an extremal valued field is defect free. We construct an example of an algebraically complete valued field such that a finite-dimensional skew field over it has a non-trivial defect, that is, there exist algebraically complete valued fields that are not extremal.     

Extremal Projector and Dynamical Twist

We describe a relation between the dynamical twist J() and the extremal projector for simple Lie algebras. This correspondence finds two obvious applications: first, the solution of the Arnaudon–Buffenoir–Ragoucy–Roche equation can be obtained from the known multiplicative expression for the extremal projector; second, the structure constants are determined by the matrix coefficients of the dynamical twist.     

Remark on a 5-Design Related to a Putative Extremal Doubly-Even Self-Dual [96, 48, 20] Code

In this note, it is shown that if there is a self-orthogonal 5-(96,20,816) design, then the rows of its block-point incidence matrix generate an extremal doubly-even self-dual code of length 96. In other words, a putative extremal doubly-even self-dual code of length 96 is generated by the codewords of minimum weight.Communicated by: J. D. KeyDedicated to Professor Hadi Kharaghani on His 60th Birthday     

Inequalities for the Extremal Coefficients of Multivariate Extreme Value Distributions

The extremal coefficients are the natural dependence measures for multivariate extreme value distributions. For an m-variate distribution 2^m distinct extremal coefficients of different orders exist; they are closely linked and therefore a complete set of 2^m coefficients cannot take any arbitrary values. We give a full characterization of all the sets of extremal coefficients. To this end, we introduce a simple class of extreme value distributions that allows for a 1-1 mapping to the complete sets of extremal coefficients. We construct bounds that higher order extremal coefficients need to satisfy to be consistent with lower order extremal coefficients. These bounds are useful as lower order extremal coefficients are the most easily inferred from data.     

On characterizations of unique extremality

In this paper, we make some further considerations of the characteristic conditions of (infinitesimally) unique extremality for Beltrami coefficients obtained by Bozin et al., and find some sufficient conditions simpler in form for a Beltrami coefficient μ with nonconstant absolute value to be (infinitesimally) uniquely extremal.     

NEW SPECTRAL CHARACTERIZATIONS OF EXTREMAL HYPERSURFACES

Let M be a closed extremal hypersurface in Sn+1 with the same mean curva-ture of the Willmore torus Wm,n?m. We proved that if Specp(M)=Specp(Wm,n?m) for p=0, 1, 2, then M is Wm,m.     

AN EXTREMAL APPROACH TO BIRKHOFF QUADRATURE FORMULAS

1. Introduction and Main ResultsIn tfor paPer we shaJl use the ddstions and notations of [3l. Let E = (e'k)7t' kt. be anincidence matrir with entries consisting of zeros and ones and satisfying lEl:= Z.,* ei* = n + 1(here we allow a zero row ). Furthermore, in wha follOws we assume that(A) E satisfies the P6lya condition(B) all sequences of E in the interior rows, 0 < i < m + 1, are even.Let Sm denote the set of poiats X = (xo, z1 l "') xm, x.+1) fOr whichand Sm its clOusure. If some O…     

Self-Orthogonal 3-(56,12,65) Designs and Extremal Doubly-Even Self-Dual Codes of Length 56

In this paper, we show that the code generated by the rows of a block-point incidence matrix of a self-orthogonal 3-(56,12,65) design is a doubly-even self-dual code of length 56. As a consequence, it is shown that an extremal doubly-even self-dual code of length 56 is generated by the codewords of minimum weight. We also demonstrate that there are more than one thousand inequivalent extremal doubly-even self-dual [56,28,12] codes. This result shows that there are more than one thousand non-isomorphic self-orthogonal 3-(56,12,65) designs. AMS Classification: 94B05, 05B05