Loewy Modules with Finite Loewy Invariants and Max Modules with Finite Radical Invariants

Over a commutative ring R, a module is artinian if and only if it is a Loewy module with finite Loewy invariants [5 Facchini , A. ( 1981 ). Loewy and artinian modules over commutative rings . Ann. Mat. Pura Appl. 128 : 359 – 374 .[Crossref], [Web of Science ®] , [Google Scholar]]. In this paper, we show that this is not necesarily true for modules over noncommutative rings R, though every artinian module is always a Loewy module with finite Loewy invariants. We prove that every Loewy module with finite Loewy invariants has a semilocal endomorphism ring, thus generalizing a result proved by Camps and Dicks for artinian modules [3 Camps , R. , Dicks , W. ( 1993 ). On semilocal rings . Israel J. Math. 81 : 203 – 211 .[Crossref], [Web of Science ®] , [Google Scholar]]. Finally, we obtain similar results for the dual class of max modules.     

Mod-Retractable Rings

A right module M over a ring R is said to be retractable if Hom _R (M, N) ≠ 0 for each nonzero submodule N of M. We show that M ? _R RG is a retractable RG-module if and only if M _R is retractable for every finite group G. The ring R is (finitely) mod-retractable if every (finitely generated) right R-module is retractable. Some comparisons between max rings, semiartinian rings, perfect rings, noetherian rings, nonsingular rings, and mod-retractable rings are investigated. In particular, we prove ring-theoretical criteria of right mod-retractability for classes of all commutative, left perfect, and right noetherian rings.     

John Bell and the Identical Twins

I present a biographical profile of John S. Bell based upon extensive interviews I had with him. I present Bell‘s views on the quantum theory along with a simple explanation of his identity. Jeremy Bernstein is Professor Emeritus of Physics at the Stevens Institute of Technology and a former staff writer for The New Yorker.     

Partition into cliques for cubic graphs: Planar case, complexity and approximation

Given a graph G=(V,E) and a positive integer k, the partition into cliques (pic) decision problem consists of deciding whether there exists a partition of V into k disjoint subsets V₁,V₂,…,V_k such that the subgraph induced by each part V_i is a complete subgraph (clique) of G. In this paper, we establish both the NP-completeness of pic for planar cubic graphs and the Max SNP-hardness of pic for cubic graphs. We present a deterministic polynomial time -approximation algorithm for finding clique partitions in maximum degree three graphs.     

Min–Max vs. Min–Sum Vehicle Routing: A worst-case analysis

The classical objective function of the Vehicle Routing Problem (VRP) is to minimize the total distance traveled by all vehicles (Min–Sum). In several situations, such as disaster relief efforts, computer networks, and workload balance, the minimization of the longest route (Min–Max) is a better objective function. In this paper, we compare the optimal solution of several variants of the Min–Sum and the Min–Max VRP, from the worst-case point of view. Our aim is two-fold. First, we seek to motivate the design of heuristic, metaheuristic, and matheuristic algorithms for the Min–Max VRP, as even the optimal solution of the classical Min–Sum VRP can be very poor if used to solve the Min–Max VRP. Second, we aim to show that the Min–Max approach should be adopted only when it is well-justified, because the corresponding total distance can be very large with respect to the one obtained by optimally solving the classical Min–Sum VRP.     

Paul Ehrenfest’s Rough Road to Leiden: A Physicist’s Search for a Position, 1904–1912

Paul Ehrenfest (1880–1933) received his Ph.D. degree at the University of Vienna in 1904 and moved with his wife and young daughter to St. Petersburg in 1907, where he remained until he succeeded Hendrik Antoon Lorentz (1853–1928) in the chair of theoretical physics at the University of Leiden in 1912. Drawing upon Ehrenfest’s correspondence of the period, we first examine Ehrenfest’s difficult and insecure years in St. Petersburg and then discuss his unsuccessful attempts to obtain a position elsewhere before he was appointed as Lorentz’s successor in Leiden. Pim Huijnen is writing a doctoral dissertation in history; the present paper is based upon his Master’s Thesis, “‘Die Grenze des Pathologischen’: Het leven van fysicus Paul Ehrenfest, 1904–1912,” University of Groningen, 2003. A.J.Kox is Pieter Zeeman Professor of History of Physics at the University of Amsterdam.     

基于修正的Clough-Penzien地震动模型时MTMD的动力特性

研究了由许多刚度和阻尼保持常量而频率呈线性分布的TMD形成的MTMD的地震特性，基于虚拟激励法和本文提出的平稳过滤有色噪声地震动模型（修正的Clough-Penzien地震动模型），建立了结构－MTMD系统的传递函数，进而导出了设置MTMD时结构的动力放大系数（DMF）明确表达式。MTMD的优化准则可选为最大动力放大系数的最小值的最小化（Min.Min.Max.DMF)。通过最优搜寻可得MTMD的最优频率间隔、平均阻尼比、调谐频率比和相应的无量纲控制有效性指标。考虑结构受控频率与场地土卓越频率比的不同取值和不同场地类型，研究了场地土卓越频率和场地类型对MTMD最优参数及有效性的影响。而且，为比较，基于Clogh-Penzien地震动模型和不考虑地震动模型的结果也被考虑。     

The Constructions of the Max-min Fuzzy Relation Equations That Have a Unique Minimal Solution

ＴｈｅＣｏｎｓｔｒｕｃｔｉｏｎｓｏｆｔｈｅＭａｘｍｉｎＦｕｚｙＲｅｌａｔｉｏｎＥｑｕａｔｉｏｎｓＴｈａｔＨａｖｅａＵｎｉｑｕｅＭｉｎｉｍａｌＳｏｌｕｔｉｏｎＬｉＪｉａｎｘｉｎＨｕＧａｎｇ（ＴｅａｃｈｉｎｇａｎｄＲｅｓｅａｒｃｈＳｅｃｔｉｏｎｏｆＭ...     

A smoothing-out technique for min—max optimization

In this paper, we suggest approximations for smoothing out the kinks caused by the presence of max or min operators in many non-smooth optimization problems. We concentrate on the continuous-discrete min—max optimization problem. The new approximations replace the original problem in some neighborhoods of the kink points. These neighborhoods can be made arbitrarily small, thus leaving the original objective function unchanged at almost every point ofR ⁿ . Furthermore, the maximal possible difference between the optimal values of the approximate problem and the original one, is determined a priori by fixing the value of a single parameter. The approximations introduced preserve properties such as convexity and continuous differentiability provided that each function composing the original problem has the same properties. This enables the use of efficient gradient techniques in the solution process. Some numerical examples are presented.