Analysis of Bragg reflection waveguides with finite cladding: An accurate matrix method formulation

Ideal Bragg reflection waveguides (BRWs) are assumed to have an infinitely extended periodic cladding whereas in practice, the cladding of BRWs is of a finite extent. Bloch theorem is widely used to analyze the propagation characteristics of the BRWs. Since Bloch theorem is ideally valid only for an infinitely extended periodic medium, its application to study such BRWs is an approximation. We present a matrix method for a more accurate analysis of finite-clad BRWs and estimate the extent of errors involved in the values of the propagation constant obtained by the Bloch wave formalism. The proposed method can be used to obtain the mode effective indices as well as the radiation loss of a finite-clad BRW without resorting to solving any complex transcendental equation. In addition, since the method does not inherently assume a periodic cladding, it can also be used to analyze symmetric multi-channel BRWs, chirped structures and directional couplers.     

Design of an Optimal Grid for Finite Element Methods

ABSTRACT Finite element solutions of improved quality are obtained by optimizing the location of nodes of the finite element grid, while keeping the number of degrees of freedom fixed. The formulation of the grid optimization problem is based on the reduction of error associated with interpolation of the exact solution, using functions from the finite element space. Element sizes are selected as design variables: length in R1 and area in R2. Analytically derived optimality conditions are presented and an approximation to these conditions is introduced to obtain a set of operationally useful equations that can be used as guidelines for construction of improved grids. Example problems are given for illustration.     

Bessel functions of third order and the distribution of cyclic planar motions with three directions

The exact distribution of a cyclic planar motion with three directions is explicitly derived in terms of Bessel functions of order three (suitably combined). The absolutely continuous part of the distribution is proved to satisfy suitable boundary conditions and some of its properties are analyzed. The transformations converting the governing equations of order three is presented and its solutions (used here) derived by applying the Frobenius method.     

Constant memory routing in quasi-planar and quasi-polyhedral graphs

We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three-dimensional space. In two dimensions we propose the class of quasi-planar graphs and in three dimensions the class of quasi-polyhedral graphs. In the former case such graphs are geometrically embedded in R² and have an underlying backbone that is planar with convex faces; however within each face arbitrary edges (with arbitrary crossings) are allowed. In the latter case, these graphs are geometrically embedded in R³ and consist of a backbone of convex polyhedra and arbitrary edges within each polyhedron. In both cases we provide a routing algorithm that guarantees delivery. Our algorithms need only “remember” the source and destination nodes and one (respectively, two) reference nodes used to store information about the underlying face (respectively, polyhedron) currently being traversed. The existence of the backbone is used only in proofs of correctness of the routing algorithm; the particular choice is irrelevant and does not affect the behaviour of the algorithm.     

一类平面多项式微分系统赤道环量的代数递推公式

本文研究一类形式相当一般的平面多项式系统赤道环量(Gauss球面的无穷远点奇点量)的计算,建立了系统赤道环量计算的简明的线性代数递推公式.应用递推公式计算赤道环量,只需用系统系数做四则运算,避免了通常计算赤道环量需要的复杂的积分运算和解方程,极易用计算机代数系统作符号推导并且不含舍入误差.     

Smaller planar triangle-free graphs that are not 3-list-colorable

In 1995, Voigt constructed a planar triangle-free graph that is not 3-list-colorable. It has 166 vertices. Gutner then constructed such a graph with 164 vertices. We present two more graphs with these properties. The first graph has 97 vertices and a failing list assignment using triples from a set of six colors, while the second has 109 vertices and a failing list assignment using triples from a set of five colors.     

Exploiting planarity in separation routines for the symmetric traveling salesman problem

At present, the most successful approach for solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cut is due in large part to the availability of effective separation procedures; that is, routines for identifying violated linear constraints.

For two particular classes of constraints, known as comb and domino-parity constraints, it has been shown that separation becomes easier when the underlying graph is planar. We continue this line of research by showing how to exploit planarity in the separation of three other classes of constraints: subtour elimination, 2-matching and simple domino-parity constraints.     

Periodic solutions for planar autonomous systems with nonsmooth periodic perturbations

In this paper we consider a class of planar autonomous systems having an isolated limit cycle x₀ of smallest period T>0 such that the associated linearized system around it has only one characteristic multiplier with absolute value 1. We consider two functions, defined by means of the eigenfunctions of the adjoint of the linearized system, and we formulate conditions in terms of them in order to have the existence of two geometrically distinct families of T-periodic solutions of the autonomous system when it is perturbed by nonsmooth T-periodic nonlinear terms of small amplitude. We also show the convergence of these periodic solutions to x₀ as the perturbation disappears and we provide an estimation of the rate of convergence. The employed methods are mainly based on the theory of topological degree and its properties that allow less regularity on the data than that required by the approach, commonly employed in the existing literature on this subject, based on various versions of the implicit function theorem.     

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1,…,n}, then with probability tending to 1 as n→∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.     

Dendriform equations

We investigate solutions for a particular class of linear equations in dendriform algebras. Motivations as well as several applications are provided. The latter follow naturally from the intimate link between dendriform algebras and Rota–Baxter operators, e.g. the Riemann integral map or Jackson's q-integral.