On the multidimensional extension of countermonotonicity and its applications

In a 2-dimensional space, Fréchet–Hoeffding upper and lower bounds define comonotonicity and countermonotonicity, respectively. Similarly, in the multidimensional case, comonotonicity can be defined using the Fréchet–Hoeffding upper bound. However, since the multidimensional Fréchet–Hoeffding lower bound is not a distribution function, there is no obvious extension of countermonotonicity in multidimensions. This paper investigates in depth a new multidimensional extension of countermonotonicity. We first provide an equivalent condition for countermonotonicity in 2-dimension, and extend the definition of countermonotonicity into multidimensions. In order to justify such extensions, we show that newly defined countermonotonic copulas constitute a minimal class of copulas. Two applications will be provided. First, we will study the relationships between multidimensional countermonotonicity and such well-known multivariate concordance measures as Kendall’s tau or Spearman’s rho. Second, we will give a financial interpretation of multidimensional countermonotonicity via the existing herd behavior index.     

Nonlinear force density method for the form-finding of minimal surface membrane structures

We develop an alternative approach for the form-finding of the minimal surface membranes (including cable membranes) using discrete models and nonlinear force density method. Two directed weighted graphs with 3 and 4-sided regional cycles, corresponding to triangular and quadrilateral finite element meshes are introduced as computational models for the form-finding problem. The triangular graph model is closely related to the triangular computational models available in the literature whilst the quadrilateral graph uses a novel averaging approach for the form-finding of membrane structures within the context of nonlinear force density method. The viability of the mentioned discrete models for form-finding are studied through two solution methods including a fixed-point iteration method and the Newton–Raphson method with backtracking. We suggest a hybrid version of these methods as an effective solution strategy. Examples of the formation of certain well-known minimal surfaces are presented whilst the results obtained are compared and contrasted with analytical solutions in order to verify the accuracy and viability of the suggested methods.     

Hilbert function spaces and the Nevanlinna-Pick problem on the polydisc

In [4], Agler and McCarthy (2005) used Hilbert function spaces to study the uniqueness properties of the Nevanlinna-Pick problem on the bidisc. In this work we give a geometric procedure for constructing a Nevanlinna-Pick problem on Dn with a specified set of uniqueness. On the way to establishing this procedure, we prove a result about Hilbert function spaces and partially answer a question posed by Agler and McCarthy.     

A vertex incremental approach for maintaining chordality

For a chordal graph G=(V,E), we study the problem of whether a new vertex u∉V and a given set of edges between u and vertices in V can be added to G so that the resulting graph remains chordal. We show how to resolve this efficiently, and at the same time, if the answer is no, specify a maximal subset of the proposed edges that can be added along with u, or conversely, a minimal set of extra edges that can be added in addition to the given set, so that the resulting graph is chordal. In order to do this, we give a new characterization of chordal graphs and, for each potential new edge uv, a characterization of the set of edges incident to u that also must be added to G along with uv. We propose a data structure that can compute and add each such set in O(n) time. Based on these results, we present an algorithm that computes both a minimal triangulation and a maximal chordal subgraph of an arbitrary input graph in O(nm) time, using a totally new vertex incremental approach. In contrast to previous algorithms, our process is on-line in that each new vertex is added without reconsidering any choice made at previous steps, and without requiring any knowledge of the vertices that might be added subsequently.     

Hamiltonian torus actions on symplectic orbifolds and toric varieties

In the first part of the paper, we build a foundation for further work on Hamiltonian actions on symplectic orbifolds. Most importantly, we prove the orbifold versions of the abelian connectedness and convexity theorems. In the second half, we prove that compact symplectic orbifolds with completely integrable torus actions are classified by convex simple rational polytopes with a positive integer attached to each open facet and that all such orbifolds are algebraic toric varieties.

     

On the Milnor K-theory of the function fields of quasihomogeneous cones

Let V be a quasihomogeneous normal variety. The aim of this paper is to describe the Milnor K-theory of the function field of V in terms of the second residue homomorphisms associated with subvarieties and resolution data of V.Supported by KBN, 2 P301 010 06.     

Computational efficiency analysis of Wu et al.’s fast modular multi-exponentiation algorithm

Very recently, for speeding up the computation of modular multi-exponentiation, Wu et al. presented a fast algorithm combining the complement recoding method and the minimal weight binary signed-digit representation technique. They claimed that the proposed algorithm reduced the number of modular multiplications from 1.503k to 1.306k on average, where the value k is the maximum bit-length of two exponents. However, in this paper, we show that their claim is unwarranted. We analyze the computational efficiency of Wu et al.’s algorithm by modeling it as a Markov chain. Our main result is that Wu et al.’s algorithm requires 1.471k modular multiplications on average.     

On open-loop and feedback attainability of a closed set for nonlinear control systems

In this note, we investigate the existence of controls which allow to reach a given closed set K through trajectories of a nonlinear control system. In the case where the set is sufficiently regular we give a condition allowing to find a feedback control law which ensures the existence of trajectories to reach the set. We also consider the case where all the trajectories reach K. When K is not necessarily attainable but only viable, we build a set-valued feedback for which the set is invariant. Our approach concerns continuous dynamics, possibly not C¹, so our methods do not come from geometric control theory. Furthermore, we do not require any regularity of the set K in order to obtain our results, except when we want to establish the existence of a feedback control law to achieve our goals.     

Spectral Geometry of Closed Minimal Real Hypersurfaces in CP~(n+1) and QP~(n+1)

ＳｐｅｃｔｒａｌＧｅｏｍｅｔｒｙｏｆＣｌｏｓｅｄＭｉｎｉｍａｌＲｅａｌＨｙｐｅｒｓｕｒｆａｃｅｓｉｎＣＰｎ＋１ａｎｄＱＰｎ＋１＊）ＱｕＣｈｅｎｇｑｉｎ（瞿成勤）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮａｎｊｉｎｇＵｎｉｖｅｒｓｉｔｙ，Ｎａ...