Notes on the products of the lower topology and Lawson topology on posets

In this paper, we investigate the relation between the lower topology respectively the Lawson topology on a product of posets and their corresponding topological product. We show that (1) if S and T are nonsingleton posets, then Ω(S×T)=Ω(S)×Ω(T) iff both S and T are finitely generated upper sets; (2) if S and T are nontrivial posets with σ(S) or σ(T) being continuous, then Λ(S×T)=Λ(S)×Λ(T) iff S and T satisfy property K, where for a poset L, Ω(L) means the lower topological space, Λ(L) means the Lawson topological space, and L is said to satisfy property K if for any x∈L, there exist a Scott open U and a finite F⊆L with x∈U⊆↑F.     

Moving toward shared realities through empathy in mathematical modeling: An ecological systems theory approach

The mathematics education community has routinely called for mathematics tasks to be connected to the real world. However, accomplishing this in ways that are relevant to students’ lived experiences can be challenging. Meanwhile, mathematical modeling has gained traction as a way for students to learn mathematics through real-world connections. In an open problem to the mathematics education community, this paper explores connections between the mathematical modeling and the nature of what is considered relevant to students. The role of empathy is discussed as a proposed component for consideration within mathematical modeling so that students can further relate to real-world contexts as examined through the lens of Ecological Systems Theory. This is contextualized through a classroom-tested example entitled “Tiny Homes as a Solution to Homelessness” followed by implications and conclusions as they relate to mathematics education.     

Fuzzy topology on fuzzy sets: Product fuzzy topology and fuzzy topological groups

The notion of product fuzzy topology in the case of fuzzy topology on fuzzy sets is introduced and the product invariance of fuzzy Hausdorffness, compactness, connectedness are examined. The product fuzzy topology is used to define fuzzy group topology on a fuzzy subgroup of a group G and some properties of fuzzy topological groups are obtained.     

A brief historical introduction to Euler's formula for polyhedra,topology, graph theory and networks

This article is essentially devoted to a brief historical introduction to Euler's formula for polyhedra, topology, theory of graphs and networks with many examples from the real-world. Celebrated Königsberg seven-bridge problem and some of the basic properties of graphs and networks for some understanding of the macroscopic behaviour of real physical systems are included. We also mention some important and modern applications of graph theory or network problems from transportation to telecommunications. Graphs or networks are effectively used as powerful tools in industrial, electrical and civil engineering, communication networks in the planning of business and industry. Graph theory and combinatorics can be used to understand the changes that occur in many large and complex scientific, technical and medical systems. With the advent of fast large computers and the ubiquitous Internet consisting of a very large network of computers, large-scale complex optimization problems can be modelled in terms of graphs or networks and then solved by algorithms available in graph theory. Many large and more complex combinatorial problems dealing with the possible arrangements of situations of various kinds, and computing the number and properties of such arrangements can be formulated in terms of networks. The Knight's tour problem, Hamilton's tour problem, problem of magic squares, the Euler Graeco-Latin squares problem and their modern developments in the twentieth century are also included.     

Hausdorff graph topology, proximal graph topology and the uniform topology for densely continuous forms and minimal USCO maps

For metric spaces (X, d _x) and (Y, d _y) we consider the Hausdorff metric topology on the set (CL(X × Y), ρ) of closed subsets of the product metrized by the product (box) metric ρ and consider the proximal topology defined on CL(X × Y). These topologies are inherited by the set G(X, Y) of closed-graph multifunctions from X to Y, if we identify each multifunction with its graph. Finally, we consider the topology of uniform convergence τ _uc on the set F(X, 2^Y) of all closed-valued multifunctions, i.e. functions from X to the set (CL(Y),) of closed subsets of Y metrized by the Hausdorff metric . We show the relationship between these topologies on the space G(X, Y) and also on the subspaces of minimal USCO maps and locally bounded densely continuous forms. This work was supported by Science and Technology Assistance Agency under the contract No. APVT-51-006904. The authors would like to thank.ubica Holá for suggestions and comments.     

All for one and one for all: Theoretical models,sociological theory,and mathematical sociology

I make the argument that mathematical sociology uniquely contributes to sociological theory through the theoretical models it develops to bridge the gap between the ideas of sociological theorists and data relevant to their empirical evaluation. My work on intergroup association and social integration, the fruit of a long-time collaboration with Fararo and more recently with Karpiński, is used throughout to illustrate my points.     

Natural atomic probabilities in quantum information theory

Quantum Information Theory has witnessed a great deal of interest in the recent years since its potential for allowing the possibility of quantum computation through quantum mechanics concepts such as entanglement, teleportation and cryptography. In Chemistry and Physics, von Neumann entropies may provide convenient measures for studying quantum and classical correlations in atoms and molecules. Besides, entropic measures in Hilbert space constitute a very useful tool in contrast with the ones in real space representation since they can be easily calculated for large systems. In this work, we show properties of natural atomic probabilities of a first reduced density matrix that are based on information theory principles which assure rotational invariance, positivity, and N- and v-representability in the Atoms in Molecules (AIM) scheme. These (natural atomic orbital-based) probabilities allow the use of concepts such as relative, conditional, mutual, joint and non-common information entropies, to analyze physical and chemical phenomena between atoms or fragments in quantum systems with no additional computational cost. We provide with illustrative examples of the use of this type of atomic information probabilities in chemical process and systems.     

Global optimization of truss topology with discrete bar areas—Part I: theory of relaxed problems

This two part paper considers the classical problem of finding a truss design with minimal compliance subject to a given external force and a volume bound. The design variables describe the cross-section areas of the bars. While this problem is well-studied for continuous bar areas, we treat here the case of discrete areas. This problem is of major practical relevance if the truss must be built from pre-produced bars with given areas. As a special case, we consider the design problem for a single bar area, i.e., a 0/1-problem. In contrast to heuristic methods considered in other approaches, Part I of the paper together with Part II present an algorithmic framework for the calculation of a global optimizer of the underlying large-scaled mixed integer design problem. This framework is given by a convergent branch-and-bound algorithm which is based on solving a sequence of nonconvex continuous relaxations. The main issue of the paper and of the approach lies in the fact that the relaxed nonlinear optimization problem can be formulated as a quadratic program (QP). Here the paper generalizes and extends the available theory from the literature. Although the Hessian of this QP is indefinite, it is possible to circumvent the non-convexity and to calculate global optimizers. Moreover, the QPs to be treated in the branch-and-bound search tree differ from each other just in the objective function. In Part I we give an introduction to the problem and collect all theory and related proofs for the treatment of the original problem formulation and the continuous relaxed problems. The implementation details and convergence proof of the branch-and-bound methodology and the large-scale numerical examples are presented in Part II.     

测度拓扑和连续偏序集的刻画

研究偏序集上的测度拓扑以及与其它内蕴拓扑间的关系,利用测度拓扑刻画了偏序集的连续性.构造了反例说明存在完全分配格,其上的测度拓扑不是连续格从而不是局部紧拓扑.     

General theory of information transfer: Updated

We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main contributions concern information transfer by channels. There are also new questions and some answers in new models of source coding. While many of our investigations are in an explorative state, there are also hard cores of mathematical theories. In particular we present a unified theory of information transfer, which naturally incorporates Shannon's theory of information transmission and the theory of identification in the presence of noise as extremal cases. It provides several novel coding theorems. On the source coding side we introduce data compression for identification. Finally we are led beyond information theory to new concepts of solutions for probabilistic algorithms.

The original paper [R. Ahlswede, General theory of information transfer, Preprint 97-118, SFB 343 Diskrete Strukturen in der Mathematik, Universität Bielefeld, 1997] gave to and received from the ZIF-project essential stimulations which resulted in contributions added as GTIT-Supplements “Search and channels with feedback” and “Noiseless coding for multiple purposes: a combinatorial model”.

Other contributions—also to areas initiated—are published in the recent book [R. Ahlswede et al. (Eds.), General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, vol. 4123, Springer, Berlin, 2006].

The readers are advised to study always the pioneering papers in a field—in this case the papers [R. Ahlswede, G. Dueck, Identification via channels, IEEE Trans. Inform. Theory 35 (1989) 15–29; R. Ahlswede, G. Dueck, Identification in the presence of feedback—a discovery of new capacity formulas, IEEE Trans. Inform. Theory 35 (1989) 30–39] on identification. It is not only the most rewarding way to come to new ideas, but it also helps to more quickly grasp the more advanced formalisms without going through too many technicalities. Perhaps also the recent Shannon Lecture [R. Ahlswede, Towards a General Theory of Information Transfer, Shannon Lecture at ISIT in Seattle 13th July 2006, IEEE Information Theory Society Newsletter, 2007], aiming at an even wider scope, gives further impetus.     

The golden mean in the topology of four-manifolds, in conformal field theory, in the mathematical probability theory and in Cantorian space-time

In the present work we show the connections between the topology of four-manifolds, conformal field theory, the mathematical probability theory and Cantorian space-time. In all these different mathematical fields, we find as the main connection the appearance of the golden mean.     

Fisher information under restriction of Shannon information in multi-terminal situations

Fisher information generally decreases by summarizing observed data into encoded messages. The present paper studies the amount of Fisher information included in independently summarized messages from correlated information sources; that is, the amount of Fisher information when sequences x ^N and y ^N of N independent observations of random variables x and y are encoded (summarized) independently of each other into meassages m _X and m _Y . The problem is to obtain the maximal amount of Fisher information when the size of the summarized data or Shannon message information is limited. The problem is solved in the case of completely compressed symmetric data summarization. An achievable bound is given in the general case. Information geometry, which is a powerful new differential geometrical method applicable to statistics and systems theory, is applied to this problem, proving its usefulness in information theory as well.The present work is supported in part by Grant-in-Aid for Scientific Research #61030014, Ministry of Education, Science and Culture of Japan.     

A mathematical theory of climbing

Is it possible to develop a theory of climbing? The answer isno. Mountains are so different in quality of rock and geometryof their faces that any wall would require a specific theoryon the best strategy for being climbed. For this reason, climbingschools, so precise in teaching belaying, rappelling and prusiking,are instead vague in instructing how one must progress alongan irregular wall. This paper suggests a rough model for graspingthis complex problem.     

Some thoughts on a nonlinear Schrödinger equation motivated by information theory

The arguments leading to a nonlinear generalization of the Schrödinger equation in the context of the maximum uncertainty principle are reviewed. The exact and perturbative properties of that equation depend on a free regulating/interpolating parameter η, which can be fixed using energetics as is shown here. A linear theory with an external potential that reproduces some unusual exact solutions of the nonlinear equation is also discussed, together with possible symmetry enhancements in the nonlinear theory.     

均衡约束数学规划问题的一类广义Mond-Weir型对偶理论

针对均衡约束数学规划模型难以满足约束规范及难于求解的问题,基于Mond和Weir提出的标准非线性规划的对偶形式,利用其S稳定性,建立了均衡约束数学规划问题的一类广义Mond-Weir型对偶,从而为求解均衡约束优化问题提供了一种新的方法.在Hanson-Mond广义凸性条件下,利用次线性函数,分别提出了弱对偶性、强对偶性和严格逆对偶性定理,并给出了相应证明.该对偶化方法的推广为研究均衡约束数学规划问题的解提供了理论依据.     

Effective communication,critical aspects and compositionality in algebra

This paper contains a discussion of how the concept of critical aspects and the principle of compositionality can provide a powerful tool to analyse and understand the communications that occur in the classroom. It is grounded in data collected in a longitudinal study. The content chosen is algebra. It is argued that the critical aspects and the principle of compositionality should be considered as a methodological principle that describes how communication in the classroom should be designed. Here, I present the power of using variation theory whose main purpose is to generate an understanding of critical aspects and compositionality in practice.     

A ZFC Dowker space in : An application of pcf theory to topology

The existence of a Dowker space of cardinality and weight is proved in ZFC using pcf theory.

     

Applied topics of control theory,mathematical statistics,and mathematical cybernetics

A stochastic discrepancy method is proposed for the construction of a solving system of equations of the projective grid method in Bubnov-Galerkin form. The interpolation polynomial on a finite element is viewed as the result of weighted averaging of the nodal parameters of the element. A simple posterior bound on discretization error is considered.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 65, pp. 100–103, 1988.     

Use of stochastic and mathematical programming in?portfolio theory and practice

Standard finance portfolio theory draws graphs and writes equations usually with no constraints and frequently in the univariate case. However, in reality, there are multivariate random variables and multivariate asset weights to determine with constraints. Also there are the effects of transaction costs on asset prices in the theory and calculation of optimal portfolios in the static and dynamic cases. There we use various stochastic programming, linear complementary, quadratic programming and nonlinear programming problems. This paper begins with the simplest problems and builds the theory to the more complex cases and then applies it to real financial asset allocation problems, hedge funds and professional racetrack betting. This paper is based on a keynote lecture at the APMOD conference in Madrid in June 2006. It was also presented at the London Business School. Many thanks are due to APMOD organizers Antonio Alonso-Ayuso, Laureano Escudero, and Andres Ramos for inviting me and for excellent hospitality in Madrid. Thanks are also due to my teachers at Berkeley who got me on the right track on stochastic and mathematical programming, especially Olvi Mangasarian, Roger Wets and Willard Zangwill, and my colleagues and co-authors on portfolio theory in finance and horseracing, especially Chanaka Edirishinge, Donald Hausch, Jarl Kallberg, Victor Lo, Leonard MacLean, Raymond Vickson and Yonggan Zhao.