Admissible points of a convex polyhedron

In this paper, we present several new properties of the admissible points of a convex polyhedron. These properties can be classified into two categories. One category concerns the characterization and generation of these points. The other category concerns the circumstances under which these points are efficient solutions for linear multiple-objective programs with nonnegative criteria matrices. To illustrate some of the potential utility of these properties, we describe their application to two practical problems. These problems are the linear multiple-objective problem with interval coefficients and the problem of optimizing over the efficient set.This research was supported, in part, by the Center for Econometrics and Decision Sciences, University of Florida, Gainesville, Florida.     

Rings containing a field of characteristic zero

Let K be a field of characteristic zero, and let R be a ring containing K. Then either \(R^\times = K^\times \) or \(K^\times \) is a subgroup of infinite index in \(R^\times \).     

Invariant discrete flows

In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself.     

The Space of Bounded Spherical Functions on the Free 2-Step Nilpotent Lie Group

Let N be a connected and simply connected 2-step nilpotent Lie group and let K be a compact subgroup of Aut(N). We say that (K, N) is a Gelfand pair when the set of integrable K-invariant functions on N forms an abelian algebra under convolution. In this paper we construct a one-to-one correspondence between the set Δ(K, N) of bounded spherical functions for such a Gelfand pair and a set of K-orbits in the dual of the Lie algebra for N. The construction involves an application of the Orbit Method to spherical representations of K ⋉ N. We conjecture that the correspondence is a homeomorphism. Our main result shows that this is the case for the Gelfand pair given by the action of the orthogonal group on the free 2-step nilpotent Lie group. In addition, we show how to embed the space Δ(K, N) for this example in a Euclidean space by taking eigenvalues for an explicit set of invariant differential operators. These results provide geometric models for the space of bounded spherical functions on the free 2-step group.     

A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case

The algorithms and algorithmic ideas currently available for globally optimizing linear functions over the efficient sets of multiple objective linear programs either use nonstandard subroutines or cannot yet be implemented for lack of sufficient development. In this paper a Bisection-Extreme Point Search Algorithm is presented for globally solving a large class of such problems. The algorithm finds an exact, globally-optimal solution after a finite number of iterations. It can be implemented by using only well-known pivoting and optimization subroutines, and it is adaptable to large scale problems or to problems with many local optima.     

Global Optimization Algorithm for the Nonlinear Sum of Ratios Problem

This article presents a branch-and-bound algorithm for globally solving the nonlinear sum of ratios problem (P). The algorithm economizes the required computations by conducting the branch-and-bound search in ^p, rather than in ⁿ, where p is the number of ratios in the objective function of problem (P) and n is the number of decision variables in problem (P). To implement the algorithm, the main computations involve solving a sequence of convex programming problems for which standard algorithms are available.     

Fast and accurate reflectivity calculations for shaped core optical fibres

A novel scalar (i.e. paraxial) free space radiation mode method is presented for calculating the normal incidence facet reflectivity of the main guided mode of a step-index optical fibre with generally shaped smooth core. Numerical results are presented and discussed for several cases of the Nth order super-elliptical core shape, including the circular, elliptical, rectangular-type and slab limiting cases.     

Regulated and entangled photons from a single quantum Dot

We propose a new method of generating nonclassical optical field states. The method uses a semiconductor device, which consists of a single quantum dot as active medium embedded in a p- i- n junction and surrounded by a microcavity. Resonant tunneling of electrons and holes into the quantum dot ground states, together with the Pauli exclusion principle, produce regulated single photons or regulated pairs of photons. We propose that this device also has the unique potential to generate pairs of entangled photons at a well-defined repetition rate.     

Parity violation in elastic electron-proton scattering and the Proton's strange magnetic form factor

We report a new measurement of the parity-violating asymmetry in elastic electron scattering from the proton at backward scattering angles. This asymmetry is sensitive to the strange magnetic form factor of the proton as well as electroweak axial radiative corrections. The new measurement of A = -4.92+/-0.61+/-0.73 ppm provides a significant constraint on these quantities. The implications for the strange magnetic form factor are discussed in the context of theoretical estimates for the axial corrections.