On dimensional rigidity of bar-and-joint frameworks

Let V={1,2,…,n}. A mapping p:V→R^r, where p¹,…,pⁿ are not contained in a proper hyper-plane is called an r-configuration. Let G=(V,E) be a simple connected graph on n vertices. Then an r-configuration p together with graph G, where adjacent vertices of G are constrained to stay the same distance apart, is called a bar-and-joint framework (or a framework) in R^r, and is denoted by G(p). In this paper we introduce the notion of dimensional rigidity of frameworks, and we study the problem of determining whether or not a given G(p) is dimensionally rigid. A given framework G(p) in R^r is said to be dimensionally rigid iff there does not exist a framework G(q) in R^s for s?r+1, such that ∥qⁱ-q^j∥²=∥pⁱ-p^j∥² for all (i,j)∈E. We present necessary and sufficient conditions for G(p) to be dimensionally rigid, and we formulate the problem of checking the validity of these conditions as a semidefinite programming (SDP) problem. The case where the points p¹,…,pⁿ of the given r-configuration are in general position, is also investigated.     

The minimum span of L(2,1)-labelings of certain generalized Petersen graphs

In the classical channel assignment problem, transmitters that are sufficiently close together are assigned transmission frequencies that differ by prescribed amounts, with the goal of minimizing the span of frequencies required. This problem can be modeled through the use of an L(2,1)-labeling, which is a function f from the vertex set of a graph G to the non-negative integers such that |f(x)-f(y)|? 2 if xand y are adjacent vertices and |f(x)-f(y)|?1 if xand y are at distance two. The goal is to determine the λ-number of G, which is defined as the minimum span over all L(2,1)-labelings of G, or equivalently, the smallest number k such that G has an L(2,1)-labeling using integers from {0,1,…,k}. Recent work has focused on determining the λ-number of generalized Petersen graphs (GPGs) of order n. This paper provides exact values for the λ-numbers of GPGs of orders 5, 7, and 8, closing all remaining open cases for orders at most 8. It is also shown that there are no GPGs of order 4, 5, 8, or 11 with λ-number exactly equal to the known lower bound of 5, however, a construction is provided to obtain examples of GPGs with λ-number 5 for all other orders. This paper also provides an upper bound for the number of distinct isomorphism classes for GPGs of any given order. Finally, the exact values for the λ-number of n-stars, a subclass of the GPGs inspired by the classical Petersen graph, are also determined. These generalized stars have a useful representation on Möebius strips, which is fundamental in verifying our results.     

On the third largest Laplacian eigenvalue of a graph

In this article, a sharp lower bound for the third largest Laplacian eigenvalue of a graph is given in terms of the third largest degree of the graph.     

Coalgebraic representations of distributive lattices with operators

We present a framework for extending Stone's representation theorem for distributive lattices to representation theorems for distributive lattices with operators. We proceed by introducing the definition of algebraic theory of operators over distributive lattices. Each such theory induces a functor on the category of distributive lattices such that its algebras are exactly the distributive lattices with operators in the original theory. We characterize the topological counterpart of these algebras in terms of suitable coalgebras on spectral spaces. We work out some of these coalgebraic representations, including a new representation theorem for distributive lattices with monotone operators.     

Periodic solutions for a Lotka–Volterra mutualism system with several delays

In the present paper, a Lotka–Volterra type mutualism system with several delays is studied. Some new and interesting sufficient conditions are obtained for the global existence of positive periodic solutions of the mutualism system. Our method is based on Mawhin’s coincidence degree and novel estimation techniques for the a priori bounds of unknown solutions. Our results are different from the existing ones such as those in of Yang et al. [F. Yang, D. Jiang, A. Ying, Existence of positive solution of multidelays facultative mutualism system, J. Eng. Math. 3 (2002) 64–68] and Chen et al. [F. Chen, J. Shi, X. Chen, Periodicity in a Lotka–Volterra facultative mutualism system with several delays, J. Eng. Math. 21 (3) (2004) 403–409].     

The convex hull property and topology of hypersurfaces with nonnegative curvature

We prove that, in Euclidean space, any nonnegatively curved, compact, smoothly immersed hypersurface lies outside the convex hull of its boundary, provided the boundary satisfies certain required conditions. This gives a convex hull property, dual to the classical one for surfaces with nonpositive curvature. A version of this result in the nonsmooth category is obtained as well. We show that our boundary conditions determine the topology of the surface up to at most two choices. The proof is based on uniform estimates for radii of convexity of these surfaces under a clipping procedure, a noncollapsing convergence theorem, and a gluing procedure.     

The Solow model improved through the logistic manpower growth law

In this paper the neo-classical economic Solow-Swan model (1956) has been improved replacing its Malthusian manpower law with the Verhulst (logistic) one. The relevant ordinary differential equation for the ratio capital/work has been then integrated in closed form via the Hypergeometric function₂ F ₁. The logistic growth injection for the manpower is detected to induce a more slow dynamics onto the Solow-Swan system, which keeps its stability. Increasing developments are displayed as the technologic progress rises. Further sceneries are tested and the congruence of the new solution with the classical one is shown switching to zero the selflimitation coefficent in the logistic law. Research supported by MURST grant:Metodi matematici in economia     

Electronic structure of the wrong-bond states in amorphous germanium sulphides

First-principles calculations of the electronic structures of the wrong bonds were performed for amorphous germanium sulphides in order to explain their compositional dependence. Model cluster calculations of the density of states using a set of geometry similar to the crystalline-GeS₂ coordination can reproduce the peak structure of the experimental valence band photoemission spectra. The bonding and anti-bonding states of the covalent Ge-S bonds form valence and conduction band respectively, and the top of the valence band is occupied with S 3p lone-pair states. The bonding states are modified by S-S bonds and the anti-bonding states are modified by Ge-Ge bonds, mainly through their hybridization with the wrong-bond states between p-orbitals. The lone-pair states do not interact either of them to form a different band, and obscure the modification induced by the S-S wrong bonds. Therefore, we can conclude that the narrowing of the bandgap with increasing Ge content from GeS₂ composition is due to that of the conduction-band bottom with increasing germanium wrong bonds, though the narrowing with increasing S content is moderate due to the presence of the lone-pair states at the valence-band top.