二次曲面和平面位置关系的判式

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面a11x2+a22y2+a33z2+2a12xy+2a13xz+2a23yz+2a14x+2a24y+2a34z+a44=0(1)和平面Ax+By+Cz+D=0(2)的相对位置的判别式Δ=a11a12a13a14Aa21a22a23a24Ba31a32a33a34Ca41a42a43a44DA B C D0(aij=aji).(3)并证明了:若Δ>0,则二次曲面(1)与平面(2)相交;若Δ=0,则(1)和(2)相切;若Δ<0,则(1)和(2)相离.     

A Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints

In this paper a barrier function method is proposed for approximating a solution of the nonconvex quadratic programming problem with box constraints. The method attempts to produce a solution of good quality by following a path as the barrier parameter decreases from a sufficiently large positive number. For a given value of the barrier parameter, the method searches for a minimum point of the barrier function in a descent direction, which has a desired property that the box constraints are always satisfied automatically if the step length is a number between zero and one. When all the diagonal entries of the objective function are negative, the method converges to at least a local minimum point of the problem if it yields a local minimum point of the barrier function for a sequence of decreasing values of the barrier parameter with zero limit. Numerical results show that the method always generates a global or near global minimum point as the barrier parameter decreases at a sufficiently slow pace.     

Staircase Parameterization in Dynamical Selection

This paper deals with a variant of a dynamical selection scheme introduced by Attouch and Cominetti for ill-posed convex minimization which combines approximation with the steepest descent method by mean of a suitable parameterization of the approximation parameter as a function of the time. This variant applies to a general inclusion with a maximal monotone operator by mean of a staircase parameterization. A discrete analogue is also considered. Applications to selecting a particular zero of a maximal monotone operator or a particular fixed point of a nonexpansive mapping via regularization techniques are presented. Finally, the alternative use of well-posedness by perturbations is discussed.     

New parameters of subsets in polynomial association schemes

We define new parameters, a zero interval and a dual zero interval, of subsets in P- or Q-polynomial association schemes. A zero interval of a subset in a P-polynomial association scheme is a successive interval index for which the inner distribution vanishes, and a dual zero interval of a subset in a Q-polynomial association scheme is a successive interval index for which the dual inner distribution vanishes. We derive bounds of the lengths of a zero interval and a dual zero interval using the degree and dual degree respectively, and show that a subset in a P-polynomial association scheme (resp. a Q-polynomial association scheme) having a large length of a zero interval (resp. a dual zero interval) induces a completely regular code (resp. a Q-polynomial association scheme). Moreover, we consider the spherical analogue of a dual zero interval.     

On fractional powers of a pair of matrices and a plate-beam problem

In this paper we consider the transversal deflections of a dynamically-coupled Von Kármán system consisting of a plate which has a beam attached to its one edge. The problem is considered in the form of a non-linear evolution problem in a product space. We show the existence of a unique local solution by following a fractional powers approach to first construct a “weak” solution in a larger space. Regularity properties for this solution yield a unique local strong solution for the original boundary-value problem. This approach entails the introduction of fractional powers of a pair of matrices.     

A conjecture on bipartite graphical regular representations

In this paper we are concerned with the classification of the finite groups admitting a bipartite DRR and a bipartite GRR.First, we find a natural obstruction that prevents a finite group from admitting a bipartite GRR. Then we give a complete classification of the finite groups satisfying this natural obstruction and hence not admitting a bipartite GRR. Based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bipartite GRR.Next, we prove the existence of bipartite DRRs for most of the finite groups not admitting a bipartite GRR found in this paper. Actually, we prove a much stronger result: we give an asymptotic enumeration of the bipartite DRRs over these groups. Again, based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bipartite DRR.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

Diagrams of divide links

Recently N. A'Campo suggested a construction of a link from a generic immersion of a curve into a 2-disk. It is tightly related to the singularity theory. In this paper, we give a simple procedure to draw a diagram of the link from a picture of the curve.

     

On arithmetic Macaulayfication of Noetherian rings

The Rees algebra is the homogeneous coordinate ring of a blowing-up. The present paper gives a necessary and sufficient condition for a Noetherian local ring to have a Cohen-Macaulay Rees algebra: A Noetherian local ring has a Cohen-Macaulay Rees algebra if and only if it is unmixed and all the formal fibers of it are Cohen-Macaulay. As a consequence of it, we characterize a homomorphic image of a Cohen-Macaulay local ring. For non-local rings, this paper gives only a sufficient condition. By using it, however, we obtain the affirmative answer to Sharp's conjecture. That is, a Noetherian ring having a dualizing complex is a homomorphic image of a finite-dimensional Gorenstein ring.

     

Some iterative methods for finding fixed points and for solving constrained convex minimization problems

The present paper is divided into two parts. In the first part, we introduce implicit and explicit iterative schemes for finding the fixed point of a nonexpansive mapping defined on the closed convex subset of a real Hilbert space. We establish results on the strong convergence of the sequences generated by the proposed schemes to a fixed point of a nonexpansive mapping. Such a fixed point is also a solution of a variational inequality defined on the set of fixed points. In the second part, we propose implicit and explicit iterative schemes for finding the approximate minimizer of a constrained convex minimization problem and prove that the sequences generated by our schemes converge strongly to a solution of the constrained convex minimization problem. Such a solution is also a solution of a variational inequality defined over the set of fixed points of a nonexpansive mapping. The results of this paper extend and improve several results presented in the literature in the recent past.     

On a Mathematical Comparison between Hierarchy and Network with a Classification of Coordination Structures

This paper proposes a mathematical model to compare a network organization with a hierarchical organization. In order to formulate the model, we define a three-dimensional framework of the coordination structure of a network and of other typical coordination structures. In the framework, we can define a network structure by contrasting it with a hierarchy, in terms of the distribution of decision making, which is one of the main features of information processing. Based on this definition, we have developed a mathematical model for evaluating coordination structures. Using this model, we can derive two boundary conditions among the coordination structures with respect to the optimal coordination structure. The boundary conditions help us to understand why an organization changes its coordination structure from a hierarchy to a network and what factors cause this change. They enable us, for example, to find points of structural change where the optimal coordination structure shifts from a hierarchy to a hierarchy with delegation or from a hierarchy with delegation to a network, when the nature of the task changes from routine to non-routine. In conclusion, our framework and model may provide a basis for discussing the processes that occur when coordination structures change between a hierarchy and a network.     

Genus fields of Kummer extensions of rational function fields

In this paper we obtain the genus field of a general Kummer extension of a global rational function field. We study first the case of a general Kummer extension of degree a power of a prime. Then we prove that the genus field of a composite of two abelian extensions of a global rational function field with relatively prime degrees is equal to the composite of their respective genus fields. Our main result, the genus of a general Kummer extension of a global rational function field, is a direct consequence of this fact.     

DC programming techniques for solving a class of nonlinear bilevel programs

We propose a method for finding a global solution of a class of nonlinear bilevel programs, in which the objective function in the first level is a DC function, and the second level consists of finding a Karush-Kuhn-Tucker point of a quadratic programming problem. This method is a combination of the local algorithm DCA in DC programming with a branch and bound scheme well known in discrete and global optimization. Computational results on a class of quadratic bilevel programs are reported.     

On characterizations of distributions by mean absolute deviation and variance bounds

In this paper we present a bound for the mean absolute deviation of an arbitrary real-valued function of a discrete random variable. Using this bound we characterize a mixture of two Waring (hence geometric) distributions by linearity of a function involved in the bound. A double Lomax distribution is characterized by linearity of the same function involved in the analogous bound for a continuous distribution. Finally, we characterize the Pearson system of distributions and the generalized hypergeometric distributions by a quadratic function involved in a similar bound for the variance of a function of a random variable.     

Slice theorem and orbit type stratification in infinite dimensions

We establish a general slice theorem for the action of a locally convex Lie group on a locally convex manifold, which generalizes the classical slice theorem of Palais to infinite dimensions. We discuss two important settings under which the assumptions of this theorem are fulfilled. First, using Glöckner's inverse function theorem, we show that the linear action of a compact Lie group on a Fréchet space admits a slice. Second, using the Nash–Moser theorem, we establish a slice theorem for the tame action of a tame Fréchet Lie group on a tame Fréchet manifold. For this purpose, we develop the concept of a graded Riemannian metric, which allows the construction of a path-length metric compatible with the manifold topology and of a local addition. Finally, generalizing a classical result in finite dimensions, we prove that the existence of a slice implies that the decomposition of the manifold into orbit types of the group action is a stratification.     

A solution approach to the inventory routing problem in a three-level distribution system

We consider the infinite horizon inventory routing problem in a three-level distribution system with a vendor, a warehouse and multiple geographically dispersed retailers. In this problem, each retailer faces a demand at a deterministic, retailer-specific rate for a single product. The demand of each retailer is replenished either from the vendor through the warehouse or directly from the vendor. Inventories are kept at both the retailers and the warehouse. The objective is to determine a combined transportation (routing) and inventory strategy minimizing a long-run average system-wide cost while meeting the demand of each retailer without shortage. We present a decomposition solution approach based on a fixed partition policy where the retailers are partitioned into disjoint and collectively exhaustive sets and each set of retailers is served on a separate route. Given a fixed partition, the original problem is decomposed into three sub-problems. Efficient algorithms are developed for the sub-problems by exploring important properties of their optimal solutions. A genetic algorithm is proposed to find a near-optimal fixed partition for the problem. Computational results show the performance of the solution approach.     

TRANSITION FROM A DEFLAGRATION TO A DETONATION IN GAS DYNAMIC COMBUSTION＊＊＊＊

The transition from a deflagration to a detonation (DDT) in gas dynamics is investigated through the process of a deflagration with a imite width flame overtaken by a shock. The problem is formulated as a free boundary value problem in an angular domain with a strong detonation and a reflected shock as boundaries. The main difficulty lies in the fact that the strength of reflected shock is zero at the vertex where the shock speed degenerates to be the same as the characteristic speed. The conclusion is that a strong detonation and a retonation (a reflected shock) form locally. Also the entropy satisfaction of this solution is presented.     

On farthest points of sets

For a convex closed bounded set in a Banach space, we study the existence and uniqueness problem for a point of this set that is the farthest point from a given point in space. In terms of the existence and uniqueness of the farthest point, as well as the Lipschitzian dependence of this point on a point in space, we obtain necessary and su.cient conditions for the strong convexity of a set in several infinite-dimensional spaces, in particular, in a Hilbert space. A set representable as the intersection of closed balls of a fixed radius is called a strongly convex set. We show that the condition “for each point in space that is sufficiently far from a set, there exists a unique farthest point of the set” is a criterion for the strong convexity of a set in a finite-dimensional normed space, where the norm ball is a strongly convex set and a generating set.     

The rank of the endomorphism monoid of a uniform partition

The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a finite set that leave a non-trivial uniform partition invariant. That involves proving that the rank of a wreath product of two symmetric groups is two and then use the fact that the endomorphism monoid of a partition is isomorphic to a wreath product of two full transformation semigroups. The calculation of the rank of these semigroups solves an open question.     

Circles and Clifford Algebras

Consider a smooth map of a neighborhood of the origin in a real vector space into a neighborhood of the origin in a Euclidean space. Suppose that this map takes all germs of lines passing through the origin to germs of Euclidean circles, or lines, or a point. We prove that under some simple additional assumptions this map takes all lines passing though the origin to the same circles as a Hopf map coming from a representation of a Clifford algebra. We also describe a connection between our result and the Hurwitz–Radon theorem about sums of squares.