On the Spectral Radius of Trees with the Given Diameter d

Let T denote a tree with the diameter d(d≥2) and order n. Let P^*d,r,n-d-1denote the tree obtained by identifying the rth vertex of path Pd l and the center of starKl,K1,n-d-1, where r = r(d) is the integer part about d 2/2. Then p(T)≤ p(P^*d,r,n-d-1), andequality holds if and only if T≌P^*d,r,n-d-1     

Computing homotopic shortest paths in the plane

We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very recently [Cabello et al., in: Proc. 18th Annu. ACM Sympos. Comput. Geom., 2002, pp. 160–169; Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. The algorithm for non-simple paths achieves O(log²n) time per output vertex which is an improvement by a factor of O(n/log²n) of the previous algorithm [Hershberger, Snoeyink, Comput. Geom. Theory Appl. 4 (1994) 63–98], where n is the number of obstacles. The running time has an overhead O(n²⁺) for any positive constant . In the case k<n²⁺, where k is the total size of the input and output, we improve the running to O((n+k+(nk)^2/3)log^O(1)n).     

Motion Control by ZV Shaper Synthesis Extended for Fractional Systems and Its Application to CRONE Control

Shaping command input or preshaping is used for reducing system oscillation in motion control. Desired systems inputs are altered so that the system finishes the requested move without residual oscillation. This technique, developed by N.C. Singer and W.P. Seering, is used for example in the aerospace field, in particular in flexible structure control. This paper presents the study of ZV shaper for explicit fractional derivative systems (generalized derivative systems). A robustness study of ZV shaper is then presented and applied to improve second generation CRONE control response time. Results from simulation and from a DC motor bench are also given.     

Note on André's reflection principle

This note generalizes André's reflection principle to give a new combinatorial proof of a formula for the number of lattice paths lying within certain trapezoids.     

Lattice path combinatorics and asymptotics of multiplicities of weights in tensor powers

We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers V_λ^⊗N of an irreducible representation V_λ of a compact connected Lie group G. The weights are allowed to depend on N, and we obtain several regimes of pointwise asymptotics, ranging from a central limit region to a large deviations region. We use a complex steepest descent method that applies to general asymptotic counting problems for lattice paths with steps in a convex polytope.     

Path Integrals in Noncommutative Quantum Mechanics

We consider an extension of the Feynman path integral to the quantum mechanics of noncommuting spatial coordinates and formulate the corresponding formalism for noncommutative classical dynamics related to quadratic Lagrangians (Hamiltonians). The basis of our approach is that a quantum mechanical system with a noncommutative configuration space can be regarded as another effective system with commuting spatial coordinates. Because the path integral for quadratic Lagrangians is exactly solvable and a general formula for the probability amplitude exists, we restrict our research to this class of Lagrangians. We find a general relation between quadratic Lagrangians in their commutative and noncommutative regimes and present the corresponding noncommutative path integral. This method is illustrated with two quantum mechanical systems in the noncommutative plane: a particle in a constant field and a harmonic oscillator.     

Sample path analysis of level crossings for the workload process

We examine level crossings of sample paths of queueing processes and investigate the conditions under which the limiting empirical distribution for the workload process exists and is absolutely continuous. The connection between the density of the workload distribution and the rate of downcrossings is established as a sample path result that does not depend on any stochastic assumptions. As a corollary, we obtain the sample path version of the Takács formula connecting the time and customer stationary distributions in a queue. Defective limiting empirical distributions are considered and an expression for the mass at infinity is derived.This research has been supported in part by NSF Grants ECS-8811003 and DDM-8905638.     

Semi-classical limit of the bottom of spectrum of a Schrödinger operator on a path space over a compact Riemannian manifold

We determine the limit of the bottom of spectrum of Schrödinger operators with variable coefficients on Wiener spaces and path spaces over finite-dimensional compact Riemannian manifolds in the semi-classical limit. These are extensions of the results in [S. Aida, Semiclassical limit of the lowest eigenvalue of a Schrödinger operator on a Wiener space, J. Funct. Anal. 203 (2) (2003) 401-424]. The problem on path spaces over Riemannian manifolds is considered as a problem on Wiener spaces by using Ito's map. However the coefficient operator is not a bounded linear operator and the dependence on the path is not continuous in the uniform convergence topology if the Riemannian curvature tensor on the underling manifold is not equal to 0. The difficulties are solved by using unitary transformations of the Schrödinger operators by approximate ground state functions and estimates in the rough path analysis.     

优化路问题的代数方法—论动态规划（Ⅱ）

本文用同一思路求解多阶段有向图中三种优化路问题:最优路、N阶最优路及多指标Pareto优化路问题,它们都服从嘉量原理,都用同一个代数公式表达它们的嘉量,并可在同一种表格中进行计算,只是所在半域不同,以本文的方法讨论动态规划中一些离散决定型典型应用问题,其提法、建模思路以及求解过程都有可观的扩大与改善。     

The Classification of Exponential Paths in Sp(2)

众所周知，四阶以上辛群中指数型道路的Ｍａｓｌｏｖ指标可以取任意整数．本文给出了二阶辛群中指数型道路的分类及其Ｍａｓｌｏｖ指标的取值范围，指出了与高阶情形的不同之处．