Covering numbers for Chevalley groups

LetG be a quasisimple Chevalley group. We give an upper bound for the covering number cn(G) which is linear in the rank ofG, i.e. we give a constantd such that for every noncentral conjugacy classC ofG we haveC ^rd =G, wherer=rankG. Research supported in part by NSERC Canada Grant A7251. Research supported in part by the Hermann Minkowski-Minerva Center for Geometry at Tel Aviv University.     

Exponential operations for intuitionistic fuzzy numbers and interval numbers in multi-attribute decision making

Intuitionistic fuzzy numbers (IFNs) have already been applied to many fields, especially in multi-attribute decision making (MADM). Based on the basic operational laws and information aggregation methods of IFNs, MADM with intuitionistic fuzzy information has become more and more popular. In this paper, we investigate the MADM problems where the attribute values take the form of interval numbers and the weight information on the attributes are expressed as IFNs. We first propose a novel exponential operational law based on IFNs and interval numbers, and then study some of its desirable properties. Based on the exponential operational law, we put forward an intuitionistic fuzzy weighted exponential aggregation operator, and utilize it to develop a MADM method. Finally, we apply our method to solve the decision making problem under uncertainty.     

Cutting and stacking,interval exchanges and geometric models

Every aperiodic measure-preserving transformation can be obtained by a cutting and stacking construction. It follows that all such transformations are infinite interval exchanges. This in turn is used to represent any ergodic measure-preserving flow as aC ^∞-flow on an open 2-manifold. Several additional applications of the basic theorems are also given. Partial support for this work was given by the National Science Foundation under grant number MCS81-07092.     

Covering numbers of manifolds and critical points of a morse function

For a closed connected triangulatedn-manifoldM, we study some numerical invariants (namedcategory andcovering numbers) ofM which are strictly related to the topological structure ofM. We complete the classical results of 3-manifold topology and then we prove some characterization theorems in higher dimensions. Finally some applications are given about the minimal number of critical points (resp. values) of Morse functions defined on a closed connected smoothn-manifold. Work performed under the auspices of the G.N.S.A.G.A. of the C.N.R. and financially supported by the M.P.I. of Italy within the project “Geometria delle Varietà Differenziabili”.     

区间数的绝对值与区间值函数的极限

研究了区间数的绝对值和区间值函数的极限问题.首先,讨论了区间数的H-差的性质,得到了H-差的两个运算法则;然后,给出了区间数的绝对值概念,并讨论了区间数绝对值的性质;最后,借助区间数的H-差和绝对值的概念,建立了区间值函数极限概念的一种新的表达方式,给出了极限存在的充分必要条件,证明了极限值的唯一性及对加法运算和数乘运算的封闭性.     

Extension of VIKOR method for decision making problem with interval numbers

The VIKOR method was developed for multi-criteria optimization of complex systems. It determines the compromise ranking list and the compromise solution obtained with the initial (given) weights. This method focuses on ranking and selecting from a set of alternatives in the presence of conflicting criteria. It introduces the multi-criteria ranking index based on the particular measure of “closeness” to the “ideal” solution. The aim of this paper is to extend the VIKOR method for decision making problems with interval number. The extended VIKOR method’s ranking is obtained through comparison of interval numbers and for doing the comparisons between intervals, we introduce α as optimism level of decision maker. Finally, a numerical example illustrates and clarifies the main results developed in this paper.     

Numerical study of spherical Couette flows for certain zenith-angle-dependent rotations of boundary spheres at low Reynolds numbers

The numerical method with splitting of boundary conditions developed previously by the first and third authors for solving the stationary Dirichlet boundary value problem for the Navier-Stokes equations in spherical layers in the axisymmetric case at low Reynolds numbers and a corresponding software package were used to study viscous incompressible steady flows between two con-centric spheres. Flow regimes depending on the zenith angle ?? of coaxially rotating boundary spheres (admitting discontinuities in their angular velocities) were investigated. The orders of accuracy with respect to the mesh size of the numerical solutions (for velocity, pressure, and stream function in a meridional plane) in the max and L ₂ norms were studied in the case when the velocity boundary data have jump discontinuities and when some procedures are used to smooth the latter. The capabilities of the Richardson extrapolation procedure used to improve the order of accuracy of the method were investigated. Error estimates were obtained. Due to the high accuracy of the numerical solutions, flow features were carefully analyzed that were not studied previously. A number of interesting phenomena in viscous incompressible flows were discovered in the cases under study.     

A novel multivariate grey model for forecasting the sequence of ternary interval numbers

A novel multivariate grey model suitable for the sequence of ternary interval numbers is presented in the paper. New model takes into account the influencing factors on the system behavior characteristic. New parameter setting makes the model directly applicable to the sequence of ternary interval number without the need to convert the sequence into real sequence. A compensation coefficient taken as a ternary interval number is added to the model equation. The accumulation method based on the new information priority is proposed to estimate coefficients. A connotative prediction formula is derived to replace the white response equation of the classical multivariate grey model. The single variable grey model, which takes into account the development trend of system behavior itself, is combined with the novel multivariate grey model based on the degree of grey incidence. Interval forecasts for China's electricity generation and consumer price index show that the new model has good performance.     

Transient landing dynamics analysis for a lunar lander with random and interval fields

This paper presents an objective comparison of random fields and interval fields to propagate spatial uncertainty, based on a finite element model of a lunar lander. The impulse based substructuring method is used to improve the analysis efficiency. The spatially uncertain input parameters are modeled by both random fields and interval fields. The objective of this work is to compare the applicability of both approaches in an early design stage under scarce information regarding the occurring spatial parameter variability. Focus is on the definition of the input side of the problem under this scarce knowledge, as well as the interpretation of the analysis outcome. To obtain an objective comparison between both approaches, the gradients in the interval field are tuned towards the gradients present in the random field. The result shows a very similar dependence and correlation structure between the local properties for both approaches. Furthermore, through the transient dynamic estimation, it is shown that the response ranges that are predicted by the interval field and random field are very close to each other.     

On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results

A vertex k-coloring of graph G is distinguishing if the only automorphism of G that preserves the colors is the identity map. It is proper-distinguishing if the coloring is both proper and distinguishing. The distinguishing number ofG, D(G), is the smallest integer k so that G has a distinguishing k-coloring; the distinguishing chromatic number ofG, χ_D(G), is defined similarly.It has been shown recently that the distinguishing number of a planar graph can be determined efficiently by counting a related parameter-the number of inequivalent distinguishing colorings of the graph. In this paper, we demonstrate that the same technique can be used to compute the distinguishing number and the distinguishing chromatic number of an interval graph. We make use of PQ-trees, a classic data structure that has been used to recognize and test the isomorphism of interval graphs; our algorithms run in O(n³log³n) time for graphs with n vertices. We also prove a number of results regarding the computational complexity of determining a graph’s distinguishing chromatic number.     

On the CLT for rotations and BV functions

Let $x?x+\alpha$ be a rotation on the circle and let φ be a step function. Denote by ${\phi }_n(x)$ the ergodic sums ${\sum }_{j=0}^{n?1}\phi (x+j\alpha )$. For α in a class containing the rotations with bounded partial quotients and under a Diophantine condition on the discontinuities of φ, we show that ${\phi }_n/{6{\phi }_{n}6}_2$ is asymptotically Gaussian for n in a set of density 1.     

Covering for category and trigonometric thin sets

In this work we consider several combinatorial principles satisfied for cardinals smaller than , the covering number of the ideal of first category sets on real line. Using these principles we prove that there exist N-sets (similarly N-sets, A-sets) which cannot be covered by fewer than pD-sets (A-sets, N-sets, respectively). This improves the results of our previous paper (1997).

     

Covering and radius-covering arrays: Constructions and classification

The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering arrays (equivalently, surjective codes with a radius) has been determined precisely only in special cases. In this paper, explicit constructions for numerous best known covering arrays (upper bounds) are found by a combination of combinatorial and computational methods. For radius-covering arrays, explicit constructions from covering codes are developed. Lower bounds are improved upon using connections to orthogonal arrays, partition matrices, and covering codes, and in specific cases by computation. Consequently for some parameter sets the minimum size of a covering array is determined precisely. For some of these, a complete classification of all inequivalent covering arrays is determined, again using computational techniques. Existence tables for up to 10 columns, up to 8 symbols, and all possible strengths are presented to report the best current lower and upper bounds, and classifications of inequivalent arrays.     

Analysis of the set of trajectories of nonlinear dynamics: Stability under interval initial conditions

For the set of equations of perturbed motion whose solutions satisfy interval initial conditions, we obtain sufficient conditions for the Lyapunov stability and the practical stability of these solutions. The analysis is performed on the basis of locally large scalar Lyapunov functions. As examples, we consider quasilinear and linear nonautonomous systems.     

The extended COWG operators and their application to multiple attributive group decision making problems with interval numbers

The aim of this paper is to develop two extended continuous ordered weighted geometric (COWG) operators, such as the weighted geometric averaging COWG (WG-COWG) and ordered weighted geometric averaging COWG (OWG-COWG) operators. We study some desirable properties of the WG-COWG and OWG-COWG operators, and present their application to multiple attributive group decision making (MAGDM) problems with interval numbers. Finally, an illustrative numerical example is used to verify the developed approaches.     

Products of Fibonacci numbers with indices in an interval and at most four omitted being a power

Here, we find all instances in which a product of Fibonacci numbers with indices in an interval of length k and at most four of them omitted is a perfect power.     

Covering and distortion theorems for planar harmonic univalent mappings

In this paper, we investigate Clunie and Sheil-Small’s covering theorems for sense-preserving planar harmonic univalent mappings defined in the unit disk. Our results significantly improve the earlier known result. Also, we obtain a distortion theorem for fully starlike harmonic mappings in the unit disk.     

Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization

We further improve our methodology for solving irregular packing and cutting problems. We deal with an accurate representation of objects bounded by circular arcs and line segments and allow their continuous rotations and translations within rectangular and circular containers. We formulate a basic irregular placement problem which covers a wide spectrum of packing and cutting problems. We provide an exact non-linear programming (NLP) model of the problem, employing ready-to-use phi-functions. We develop an efficient solution algorithm to search for local optimal solutions for the problem in a reasonable time. The algorithm reduces our problem to a sequence of NLP subproblems and employs optimization procedures to generate starting feasible points and feasible subregions. Our algorithm allows us to considerably reduce the number of inequalities in NLP subproblems. To show the benefits of our methodology we give computational results for a number of new challenger and the best known benchmark instances.