Analysis of waveguides containing EMCs (electromagnetic conductors) or PEMCs (perfect electromagnetic conductors)

The concept of a perfect electromagnetic conductor (PEMC) was introduced to generalize and unify two well-known and apparently disjoint concepts in electromagnetics: the perfect electric conductor (PEC) and the perfect magnetic conductor (PMC). Although the PEMC has proven a fertile tool in electromagnetic analyses dealing with new and complex boundaries, its corresponding definition as a medium has, nevertheless, raised several problems. In fact, according to its initial 3D definition, the PEMC cannot be considered a unique and well-defined medium: it leads to extraneous fields without physical meaning. By using a previously published generalization of a PEMC that regards this concept both as a boundary and as a medium – which was dubbed an MIM (Minkowskian isotropic medium) and acts, in practice, as an actual electromagnetic conductor (EMC) – it is herein presented a straightforward analysis of waveguides containing PEMCs that readily and systematically follows from the general framework of waveguides containing EMCs.     

On the perfection of schemes

We present a detailed and elementary construction of the inverse perfection of a scheme and discuss some of its main properties. We also establish a number of auxiliary results (for example, on inverse limits of schemes) which do not seem to appear in the literature.     

图的D(2)点可区别星边色数的一个上界

提出了图的D(β)点可区别星边染色及D(β)点可区别星边色数的概念,并用Lovasz局部引理证明了在β=2时,若G=(V,E)是一个最小度为δ(G)>3的简单无向图,则X_(2-vds)(G)≤24△2/3]。     

一些倍图的点可区别均匀边色数

如果图G的一个正常边染色满足任意两个不同点的关联边色集不同,且任意两种颜色所染边数目相差不超过1,则称为点可区别均匀边染色,其所用最少染色数称为点可区别均匀边色数.本文得到了星、扇和轮的倍图的点可区别均匀边色数.     

系列平行图的邻强边色数

本文研究了系列平行图的邻强边染色.从图的结构性质出发,利用双重归纳和换色的方法证明了对于△(G)=3,4的系列平行图满足邻强边染色猜想;对于△(G)≥5的系列平行图G, 有△(G)≤x'as(G)≤△(G) 1,且x'as(G)=△(G) 1当且仅当存在两个最大度点相邻,其中△(G)和x'as(G)分别表示图G的最大度和邻强边色数.     

Binary integer programs with two variables per inequality

Several recent papers have shown that some properties of the maximum weight stable set problem hold true in the more general setting of binary integer programs with two variables per inequality. In this paper, we show that in fact the two problems are equivalent by using the transitive closure of the binary integer program and (possibly) reducing the number of variables by fixing, complementing, or identifying them. We use this equivalence to prove two conjectures made by Johnson and Padberg regarding the perfection of bidirected graphs.     

Yosida Type Representation for Perfect MV-Algebras

In [9] Mundici introduced a categorical equivalence Γ between the category of MV-algebras and the category of abelian ??-groups with strong unit. Using Mundici's functor Γ, in [8] the authors established an equivalence between the category of perfect MV-algebras and the category of abelian ??-groups. Aim of the present paper is to use the above functors to provide Yosida like representations (see [4]) of a large class of MV-algebras. Mathematics Subject Classification: 03G20, 03B50, 06D30, 06F20.     

Maximal stable sets of two-player games

If a connected component of perfect equilibria of a two-player game contains a stable set as defined by Mertens, then the component is itself stable. Thus the stable sets maximal under inclusion are connected components of perfect equilibria. Received: October 1999/Revised: February 2001     

The strong chromatic index of a class of graphs

The strong chromatic index of a graph G is the minimum integer k such that the edge set of G can be partitioned into k induced matchings. Faudree et al. [R.J. Faudree, R.H. Schelp, A. Gyárfás, Zs. Tuza, The strong chromatic index of graphs, Ars Combin. 29B (1990) 205-211] proposed an open problem: If G is bipartite and if for each edge xy∈E(G), d(x)+d(y)≤5, then sχ^′(G)≤6. Let H₀ be the graph obtained from a 5-cycle by adding a new vertex and joining it to two nonadjacent vertices of the 5-cycle. In this paper, we show that if G (not necessarily bipartite) is not isomorphic to H₀ and d(x)+d(y)≤5 for any edge xy of G then sχ^′(G)≤6. The proof of the result implies a linear time algorithm to produce a strong edge coloring using at most 6 colors for such graphs.