Multiplying Integers

<正>~~     

Multiplying Schur functions

A new combinatorial rule for expanding the product of Schur functions as a sum of Schur functions is formulated. The rule has several advantages over the Littlewood-Richardson rule (D. E. Littlewood and A. R. Richardson, Philos. Trans. Roy. Soc. London Ser. A233 (1934), 49–141). First this rule allows for direct computation of the expansion of the product of any number of Schur functions, not just the product of two Schur functions. Also, the rule is easily stated and is well suited to computer implementation. It is shown that the rule implies the Littlewood-Richardson rule and gives a combinatorial proof that the coefficient of S_λ in the product S_μS_ν equals the coefficient of S_ν in the expansion of the skew Schur function S_λ/μ. The rule is derived from some results proved independently by A. P. Hillman and R. M. Grassl (J. Combin. Comput. Sci. Systems5 (1980), 305–316) and by D. White (J. Combin. Theory Ser. A30 (1981), 237–247) on the Robinson-Schensted-Knuth correspondence.     

Curves with finite turn

In this paper we study the notions of finite turn of a curve and finite turn of tangents of a curve. We generalize the theory (previously developed by Alexandrov, Pogorelov, and Reshetnyak) of angular turn in Euclidean spaces to curves with values in arbitrary Banach spaces. In particular, we manage to prove the equality of angular turn and angular turn of tangents in Hilbert spaces. One of the implications was only proved in the finite dimensional context previously, and equivalence of finiteness of turn with finiteness of turn of tangents in arbitrary Banach spaces. We also develop an auxiliary theory of one-sidedly smooth curves with values in Banach spaces. We use analytic language and methods to provide analogues of angular theorems. In some cases our approach yields stronger results (for example Corollary 5.12 concerning the permanent properties of curves with finite turn) than those that were proved previously with geometric methods in Euclidean spaces. The author was partially supported by the grant GAČR 201/03/0931 and by the NSF grant DMS-0244515.     

Multiplying a conjugacy class by its inverse in a finite group

Suppose that G is a finite group and K is a non-trivial conjugacy class of G such that KK^?1 = 1 ∪ D ∪ D^?1 with D a conjugacy class of G. We prove that G is not a non-abelian simple group and we give arithmetical conditions on the class sizes determining the solvability and the structure of 〈K〉 and 〈D〉.     

Spectral Analysis and Generation Results for Streaming Operators with Multiplying Boundary Conditions

This paper deals with the spectral theory of streaming equations for smooth or partly smooth boundary operators. Generation results for muliplying boundary operators in L₁-spaces are also given.     

Discrete time dynamic Stackelberg games with the leaders in turn

In many dynamic Stackelberg games, the leader changes at each stage. A new type of dynamic Stackelberg game is initially put forward in this paper and is called dynamic Stackelberg games with the leaders in turn, in which players act as the leaders in turn. There exist extremely comprehensive applications for dynamic Stackelberg games with the leaders in turn. On the one hand, in this work we aim to establish models for a new type of game, dynamic Stackelberg games of multiple players with leaders in turn, which are induced from some economic and political phenomena, which play exceedingly important roles in many fields. On the other hand, we hope to extend dynamic programming algorithms to the new model under feedback information structure.     

Aircraft proximity termination conditions in the planar turn centric modes

Closed-form analytic solutions for proximity management strategies are of great importance as a design benchmark when validating both automated systems and procedures associated with the design of air traffic rules. Merz (1973) first presented a solution for a set of optimal strategies for resolving co-planar co-operative encounters between two aircraft (or ships) with identical linear and rotational speeds. This paper extends the solution domain for turning aircraft beyond that of identical aircraft by presenting a rigorous analysis of the problem through a generalised optimisation approach. This analysis provides a dependable method for determining the location of the point of closest approach. This is achieved by using a vector form of Fermat’s equation for stationary points. A characteristic of this solution is the identification of a fixed reference point lying on the vector between the aircraft turn centres or on one of its extensions. This point is then used to determine where the location of the minima in the relative range between the aircraft will occur. Bounds for the domain of the solution are constructed in terms of the rotational angles of the aircraft on their turn circles. Four distinct topologies are required to characterise the types of minima that can occur. The methodology has applications in an operational context permitting a more detailed and precise specification of proximity management functions when developing algorithms for aircraft avionics and air traffic management systems.     

Solving arc routing problems with turn penalties

In several arc routing problems, it is necessary to take turn penalties into account when designing a solution. Traditionally, this is done through a transformation of the arc routing problem into an equivalent vertex routing problem. In this paper it is shown that a more direct approach, not resorting to such a transformation, may be more efficient.     

A transformation for the mixed general routing problem with turn penalties

In this paper, we study a generalization of the Mixed General Routing Problem (MGRP) with turn penalties and forbidden turns. Thus, we present a unified model of this kind of extended versions for both node- and arc-routing problems with a single vehicle. We provide a polynomial transformation of this generalization into an asymmetric travelling salesman problem, which can be considered a particular case of the MGRP. We show computational results on the exact resolution on a set of 128 instances of the new problem using a recently developed code for the MGRP.     

The capacitated general windy routing problem with turn penalties

In this paper we present the capacitated general windy routing problem with turn penalties. This new problem subsumes many important and well-known arc and node routing problems, and it takes into account turn penalties and forbidden turns, which are crucial in many real-life applications, particularly in downtown areas and for large vehicles. We provide a way to solve this problem both optimally and heuristically by transforming it into a generalized vehicle routing problem.     

Optimal ship navigation with safety distance and realistic turn constraints

We consider the optimal ship navigation problem wherein the goal is to find the shortest path between two given coordinates in the presence of obstacles subject to safety distance and turn-radius constraints. These obstacles can be debris, rock formations, small islands, ice blocks, other ships, or even an entire coastline. We present a graph-theoretic solution on an appropriately-weighted directed graph representation of the navigation area obtained via 8-adjacency integer lattice discretization and utilization of the A^∗ algorithm. We explicitly account for the following three conditions as part of the turn-radius constraints: (1) the ship’s left and right turn radii are different, (2) ship’s speed reduces while turning, and (3) the ship needs to navigate a certain minimum number of lattice edges along a straight line before making any turns. The last constraint ensures that the navigation area can be discretized at any desired resolution. Once the optimal (discrete) path is determined, we smoothen it to emulate the actual navigation of the ship. We illustrate our methodology on an ice navigation example involving a 100,000 DWT merchant ship and present a proof-of-concept by simulating the ship’s path in a full-mission ship handling simulator.     

A note on dynamic Stackelberg games with leaders in turn

Recently, a model of dynamic Stackelberg games with leaders in turn has been proposed, and dynamic Stackelberg games with leaders in turn have been exploited under a feedback information structure. This paper characterizes dynamic Stackelberg games with leaders in turn under other information structures, both closed-loop and open-loop information structures. Explicit solutions are given for linear-quadratic systems under an open-loop information structure for dynamic Stackelberg games with leaders in turn.