Associative identities of octonions

We work to find a basis of identities for an octonion algebra modulo an associator ideal of a free alternative algebra, or, in other words, a basis for an associative replica of an ideal of identities of an octonion algebra.     

On Shioda-Inose structures of one-parameter families of K3 surfaces

We develop an algorithm to determine a one-parameter family of elliptic curves associated to a one-parameter family of K3 surfaces with generic Picard number 19 by a Shioda-Inose structure. The family of elliptic curves is determined up to an isomorphism and an isogeny. An application to a generalized congruence number problem is also discussed.     

Approach to the stabilization of unstable periodic solutions of autonomous systems of partial differential equations

We suggest an approach to the stabilization of unstable periodic solutions of autonomous systems of partial differential equations based on the introduction of a derivative system in which each periodic solution of the original system is stationary. By using the introduction of an additional space into the derivative system, we suggest to stabilize its stationary solution corresponding to a periodic solution of the original system. This approach permits effectively obtaining a complete ordered set of functions corresponding to an unstable cycle of the original system. We consider an example of stabilization of an unstable cycle in the Kuramoto-Tsuzuki system.     

Roughness and approximation of quasi-representations of amenable groups

Sufficient conditions are obrained for a quasi-representation (not necessarily bounded) of an amenable group (topological in general) to be a bounded perturbation of an ordinary representation. In particular, it is shown that an arbitrary (not necessarily bounded) finite-dimensional quasi-representation of an amenable topological group is a bounded perturbation of an ordinary representation. Translated fromMatematicheskie Zametki, Vol. 65, No. 6, pp. 908–920, June, 1999.     

Examples of attracting sets of birkhoff type

We discuss an explicit example of a map of the plane R ² with a nontrivial attracting set. In particular, we are concerned with the concept of rotation number introduced by Poincaré for maps of the circle and its subsequent extension by Birkhoff to maps of the annulus. The use of rotation number allows nontrivial attractors to be distinguished. The map we discuss has an attracting set containing a set of orbits with infinitely many different rotation numbers. We obtain the map by considering an Euler iteration of a family of vector fields originally described by Arnold and find that the resulting Euler map undergoes some bifurcations which are analogous to those of the family of vector fields. Specifically, there are Hopf bifurcations where changes of stability of a fixed point result in the creation of an attracting circle. The circle which grows from the fixed point is then shown to undergo structural changes giving nontrivial attracting sets. This arises from Euler map behaviour for which the corresponding vector field behaviour is a heteroclinic saddle connection. It is possible to give an explicit trapping region for the Euler map which contains the attracting set and to describe some of its properties. Finally, an analogy is drawn with attracting sets which arise for forced oscillators.     

Limits of tropicalizations

We give general criteria under which the limit of a system of tropicalizations of a scheme over a nonarchimedean field is homeomorphic to the analytification of the scheme. As an application, we show that the analytification of an arbitrary closed subscheme of a toric variety is naturally homeomorphic to the limit of its tropicalizations, generalizing an earlier result of the third author for quasiprojective varieties.     

An extension of a result of Sierpiński

As an application of Roth's theorem concerning the rational approximation of algebraic numbers, two sufficiency conditions are derived for an alternating series of rational terms to converge to a transcendental number. The first of these conditions represents an extension of an earlier condition of Sierpiński for the convergence of alternating series to irrational values.     

Measuring the fuzziness of human thoughts: An application of fuzzy sets to sociological research

Conventionally, sociologists measure the membership of an individual to a group by a “0 or 1” characteristic function. But when the definition of that group is fuzzy and an individual is neither a full member nor a nonmember, this dichotomous characteristic function may distort the reality. Instead of the “0 or 1” characteristic function by classical set theory, fuzzy set theory introduces a membership function which is a gradation from 0 to 1 to measure the degree to which an object (an individual) belongs to a concept (a group). Based on the rationale of fuzzy set theory, we suggest some new methods of data collection and analysis. Among several noteworthy findings, two points are emphasized: 1) the fuzzy set is an appropriate way of measuring the fuzziness of human thought; and 2) it allows one to relax the conventional assumption that all individuals have identical distributions and deviations around their means.     

Allocation of dependent divisional resources

A resource allocation problem is considered with resources that are dependent in the sense that an allocation to an activity requires the application of several resources, except for certain activities which are divisional in the sense that an allocation to such an activity requires the use of only a single resource. Return and cost functions are assumed to be continuous and increasing, and the allocation variables are continuous. Conditions are given for the replacement of the continuous problem by an associated problem with discrete variables and a single constraint, and to a given degree of accuracy. The associated problem can be efficiently solved by dynamic programming. Certain divisional resource allocation problems with discrete variables and several linear constraints are shown to be equivalent to a discrete problem with a single constraint. A numerical example is given.     

Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations

Varying methods exist for computing a presentation of a finitely generated commutative cancellative monoid. We use an algorithm of Contejean and Devie [An efficient incremental algorithm for solving systems of linear diophantine equations, Inform. and Comput. 113 (1994) 143-172] to show how these presentations can be obtained from the nonnegative integer solutions to a linear system of equations. We later introduce an alternate algorithm to show how such a presentation can be efficiently computed from an integer basis.     

Enforced stability of an eigenvalue in the continuous spectrum of a waveguide with an obstacle

Perturbations of an eigenvalue in the continuous spectrum of the Neumann problem for the Laplacian in a strip waveguide with an obstacle symmetric about the midline are studied. Such an eigenvalue is known to be unstable, and an arbitrarily small perturbation can cause it to leave the spectrum to become a complex resonance point. Conditions on the perturbation of the obstacle boundary are found under which the eigenvalue persists in the continuous spectrum. The result is obtained via the asymptotic analysis of an auxiliary object, namely, an augmented scattering matrix.     

Construction of orthonormal bases in higher symmetry classes of tensors

We present a method for constructing an orthonormal basis for a symmetry class of tensors from an orthonormal basis of the underlying vector space. The basis so obtained is not composed of decomposable symmetrized tensors. Indeed, we show that, for symmetry classes of tensors whose associated character has degree higher than one, it is impossible to construct an orthogonal basis of decomposable symmetrized tensors from any basis of the underlying vector space. We end with an open problem on the possibility of a symmetry class having an orthonormal basis of decomposable symmetrized tensors.     

Improvement of a method of the evaluation of allocations of resources to activities

Resources are allocated to activities in order to maximize the ratio od a concave return to an affine cost. A previously given method transforms any feasible solution to an upper bound of the optimal objective value. In this paper a modification is introduced that reduces the upper bound.     

A mathematical model of market competition

We consider a mathematical model of decision making by a company attempting to win a market share. We assume that the company releases its products to the market under the competitive conditions that another company is making similar products. Both companies can vary the kinds of their products on the market as well as the prices in accordance with consumer preferences. Each company aims to maximize its profit. A mathematical statement of the decision-making problem for the market players is a bilevel mathematical programming problem that reduces to a competitive facility location problem. As regards the latter, we propose a method for finding an upper bound for the optimal value of the objective function and an algorithm for constructing an approximate solution. The algorithm amounts to local ascent search in a neighborhood of a particular form, which starts with an initial approximate solution obtained simultaneously with an upper bound. We give a computational example of the problem under study which demonstrates the output of the algorithm.     

Autoregulated Impulse Point Heating of a Finite Medium

We consider a finite heat conducting medium whose boundary is maintained at zero temperature and, moreover, to which the same amount of heat is supplied at a certain point at the instant when the temperature at this point decreases to a given level. Up to an arbitrary shift in time, we prove the existence and uniqueness of a periodic regime with a unique heat pulse during each period. We present an efficient algorithm for constructing this regime if the medium is either an n-dimensional ball heated at the center or an interval heated at an arbitrary point.     

Quadpack computation of Feynman loop integrals

The paper addresses a numerical computation of Feynman loop integrals, which are computed by an extrapolation to the limit as a parameter in the integrand tends to zero. An important objective is to achieve an automatic computation which is effective for a wide range of instances. Singular or near singular integrand behavior is handled via an adaptive partitioning of the domain, implemented in an iterated/repeated multivariate integration method. Integrand singularities possibly introduced via infrared (IR) divergence at the boundaries of the integration domain are addressed using a version of the Dqags algorithm from the integration package Quadpack, which uses an adaptive strategy combined with extrapolation. The latter is justified for a large class of problems by the underlying asymptotic expansions of the integration error. For IR divergent problems, an extrapolation scheme is presented based on dimensional regularization.     

Numerical method of solving a linear problem on the minimum of resource consumption

A simple algorithm for developing a quasioptimal control over resource consumption is considered. The control is used as an initial approach to an iterative procedure of computing an optimal control. A system of linear algebraic equations is derived which approximately relate increments of initial conditions of an adjoint system to increments of amplitudes of a quasioptimal control with respect to ultimate values. Local convergence of the computing process with a quadratic rate is proved, and the convergence radius is found. A condition for global convergence of the method is specified.     

Applications of expansions in powers of a small parameter

During the last 35 years there has been an explosive interest in the problem of solving nonlinear differential equations. The purpose of this paper is to provide an historically oriented expository introduction to an analytical method of solving certain nonlinear differential equations in which a series expansion in powers of a small parameter is used. These series expansions turn out frequently to be asymptotic series.     

阿基米德序半群的链的若干刻画

本文首先引入了一个序半群$S$的准素模糊理想的概念,通过序半群$S$上的一些二元关系以及它的理想的模糊根给出了该序半群是阿基米德序子半群的半格的一些刻画.进一步地借助于序半群$S$的模糊子集对该序半群是阿基米德序子半群的半格进行了刻画.尤其是通过序半群的模糊素根定理证明了序半群$S$是阿基米德序子半群的链当且仅当$S$是阿基米德序子半群的半格且$S$的所有弱完全素模糊理想关于模糊集的包含关系构成链.     

Optimizing the initial setting of complex adaptive systems–optimizing the layout of initial AFVs stations for maximizing the diffusion of AFVs

There are occasions when people want to optimize the initial setting of a CAS (complex adaptive system) so that it evolves in a desired direction. A CAS evolves by heterogeneous actors interacting with each other. It is difficult to describe the evolution process with an objective function. Researchers usually attempt to optimize an intervening objective function, which is supposed to help a CAS evolve in a desired direction. This article puts forward an approach to optimize the initial setting of a CAS directly (instead of through an intervening objective function) by nesting agent‐based simulations in a genetic algorithm. In the approach, an initial setting of a CAS is treated as a genome, and its fitness is defined by the closeness between the simulation result and the desired evolution. We test the applicability of the proposed approach on the problem of optimizing the layout of initial AFV (alternative fuel vehicle) refueling stations to maximize the diffusion of AFVs. Computation experiments show that the initial setting generated with the approach could better induce the desired evolving result than optimizing an intervening objective function. The idea of the approach can also be applied to other decision making associated with a complex adaptive process. © 2015 Wiley Periodicals, Inc. Complexity 21: 275–290, 2016