Geometric separation and exact solutions for the parameterized independent set problem on disk graphs

We consider the parameterized problem, whether for a given set  of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this problem, we expose an algorithm running in time that is—to our knowledge—the first algorithm with running time bounded by an exponential with a sublinear exponent. For λ-precision disk graphs of bounded radius ratio, we show that the problem is fixed parameter tractable with a running time  . The results are based on problem kernelization and a new “geometric ( -separator) theorem” which holds for all disk graphs of bounded radius ratio. The presented algorithm then performs, in a first step, a “geometric problem kernelization” and, in a second step, uses divide-and-conquer based on our new “geometric separator theorem.”     

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.     

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.     

Constructing two-weight codes with prescribed groups of automorphisms

We construct new linear two-weight codes over the finite field with q elements. To do so we solve the equivalent problem of finding point sets in the projective geometry with certain intersection properties. These point sets are in bijection to solutions of a Diophantine linear system of equations. To reduce the size of the system of equations we restrict the search for solutions to solutions with special symmetries.Two-weight codes can be used to define strongly regular graphs. We give tables of the two-weight codes and the corresponding strongly regular graphs. In some cases we find new distance-optimal two-weight codes and also new strongly regular graphs.     

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

θ*r,s,t-图与唯一2-列表染色图的特征化

如果一个图G存在一个k-列表安排使得G具有一个唯一列表染色,则称 G是唯一列表可染色图,简称UkLC图．我们称图G具有M(k)性质当且仅当G不 是UkLC图．本文在借鉴θr,s,t-图概念的基础上引入θr,s,t-图的定义,并证明:除了 r=s=t=2以外,θr,s,t-图都是U2LC图．利用如上结果我们给出M．Mahdian and E．S．Mahmoodian对U2LC图所作特征化的一个简单证明．     

反光板(合作目标)反射率测量仪

本文介绍了反光板（合作目标）反射率测量仪的研制。仪器采用对称双光路比较测量法，给定两束相等光通量的光束，分别作为参考光束和测试光束，并用分束器实现原光路取样，从而解决了合作目标反光板入射光线与反射光线重合不能用常规测试方法来检测的难题。由于采用对称双光路的方法，入射光通量是相对恒定的，不受外界因素影响，从而使反射率测量仪达到精度高、重复性好和环境要求低的设计要求。