Minimal sets in monotone and sublinear skew-product semiflows I: The general case

The dynamics of a general monotone and sublinear skew-product semiflow is analyzed, paying special attention to the long-term behavior of the strongly positive semiorbits and to the minimal sets. Four possibilities arise depending on the existence or absence of strongly positive minimal sets and bounded semiorbits, as well as on the coexistence or not of bounded and unbounded strongly positive semiorbits. Previous results are unified and extended, and scenarios which are impossible in the autonomous or periodic cases are described.     

Mesophases in a Gel from Hydroxypropyl Cellulose/Polyacrylamide

The objective of the present work is to analyze the different mesophases observed in a gel synthesized from hydroxypropyl cellulose (HPC) and polyacrylamide (PAAm) and its phase behavior in water. Hydroxypropyl cellulose is a material derived from cellulose it is non toxic and degradable. HPC is widely used in pharmaceutics, food additives, stabilizer, thickener, etc., HPC is approved by the FDA for use in the food industry. HPC has the characteristic that it forms liquid crystals, depending on the solvent and on the concentration of the polymer. In this work a lower critical solution temperature (LCST) and an upper critical solution temperature (UCST) were observed, the resulting gel showed anisotropic, nematic and cholesteric phases in water, the phase formed depended on the concentration of the polymer.     

On deformations of spherical isometric foldings

The behavior of special classes of isometric foldings of the Riemannian sphere S ² under the action of angular conformal deformations is considered. It is shown that within these classes any isometric folding is continuously deformable into the standard spherical isometric folding f _s defined by f _s (x, y, z) = (x, y, |z|).     

Supply chain interactions due to store-brand introductions: The impact of retail competition

Store-brand products are of increasing importance in retailing, often causing channel conflict as they compete with national brands. Focusing on the interactions that arise in single-manufacturer single-retailer settings, previous research suggests that one main driver of store-brand profitability to the retailer is that it leads to a reduction of the national-brand wholesale price. Under retail competition, the Robinson Patman Act then introduces an interesting trade-off: A retailer that introduces a store brand incurs the associated costs and risks, while sharing this benefit with its competition. We show that the resulting interactions can cause retailers to play “chicken”, either of them preferring a store-brand introduction by the competitor. Such interactions do not arise in channels with a single retailer, as has been the object of most previous research, and we show that some of the key insights derived from single-retailer models fail to hold when retailers compete. We conduct a numeric study, and our findings suggest that retailers are more likely to randomize their store-brand introduction strategies when customers have strong store preferences, and when the retailers’ store-brand products are similar to the national-brand product in terms of customer valuations and production cost.     

A robust optimization approach to wine grape harvesting scheduling

Optimization models are increasingly being used in agricultural planning. However, the inherent uncertainties present in agriculture make it difficult. In recent years, robust optimization has emerged as a methodology that allows dealing with uncertainty in optimization models, even when probabilistic knowledge of the phenomenon is incomplete. In this paper, we consider a wine grape harvesting scheduling optimization problem subject to several uncertainties, such as the actual productivity that can be achieved when harvesting. We study how effective robust optimization is solving this problem in practice. We develop alternative robust models and show results for some test problems obtained from actual wine industry problems.     

Sample entropy of ECG time series of fearful flyers: preliminary results

Research within the framework of the nonlinear dynamical systems (NDS) in the field of anxiety disorders has shown that greater irregularity/complexity appears in the output from healthy systems. In this study we measured the Heart rate variability (HRV) and the sample sntropy (SampEn) of the ECG mV time series of fearful flyers (N = 15) and a matched control group (N = 15) when confronted with three combinations of feared stimuli (pictures, sounds, and pictures with sounds) as well as relaxing stimuli (pictures and sounds). Fearful flyers had lower SampEn than controls in all conditions, including baseline. Non-phobics showed significant entropy decreases from baseline in two out of three exposure conditions. No differences on HRV were found between groups, and HRV was not sensitive to condition changes. The main finding of the study is that the SampEn calculated on very short ECG mV recordings (10 to 60 seconds, easy to obtain in clinical settings) may be a useful diagnostic measure since it can distinguish fearful from non-fearful flyers.     

Digital technologies and the challenge of constructing an inclusive school mathematics

This article addresses research related to the use of digital technologies in the teaching and learning of mathematics in Brazil. Its scope is limited to the context of school mathematics and, more specifically, to an ongoing research programme which involves the development of collaborative research partnerships with teachers of mathematics. The paper begins with a brief presentation of the introduction of computers into the Brazilian educational scenario in the 1980s, highlighting how computer technology was heralded as a key to permitting new pedagogical approaches appropriate to the constructivist philosophy of that time. It goes on to consider recent developments in the theoretical frameworks used to interpret mathematics learning in the presence of digital technologies and the importance of focusing on the learning system as a whole, considering epistemological, cognitive and pedagogic dimensions concomitantly. In this vein, it is argued that for any real integration to take place, the mathematical practices afforded by digital tools must be considered legitimate by all the actors in this process and, perhaps most notably, by teachers. The rest of the paper focuses on our approaches to involve teachers in making decisions about technology use in their own classrooms. The strategy used was based on the realisation of research activities underpinned by the idea of the collaborative design of learning situations and the goal of including the wide diversity of learners that characterises Brazilian mathematics classrooms.     

Co-Jacobian for Lipschitzian Maps

The notion of co-Jacobian is introduced for locally Lipschitz functions acting between arbitrary normed spaces. The main results of this paper provide a characterization, calculus rules, a mean value theorem, as well as the computation of the co-Jacobian of piecewise smooth functions. Comparisons with known differentiability notions and Mordukhovich’s co-derivatives are derived.     

A bound on the treewidth of planar even-hole-free graphs

The class of planar graphs has unbounded treewidth, since the k×k grid, ∀k∈N, is planar and has treewidth k. So, it is of interest to determine subclasses of planar graphs which have bounded treewidth. In this paper, we show that if G is an even-hole-free planar graph, then it does not contain a 9×9 grid minor. As a result, we have that even-hole-free planar graphs have treewidth at most 49.     

Decompositions for edge-coloring join graphs and cobipartite graphs

An edge-coloring is an association of colors to the edges of a graph, in such a way that no pair of adjacent edges receive the same color. A graph G is Class 1 if it is edge-colorable with a number of colors equal to its maximum degree Δ(G). To determine whether a graph G is Class 1 is NP-complete [I. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981) 718-720]. First, we propose edge-decompositions of a graph G with the goal of edge-coloring G with Δ(G) colors. Second, we apply these decompositions for identifying new subsets of Class 1 join graphs and cobipartite graphs. Third, the proposed technique is applied for proving that the chromatic index of a graph is equal to the chromatic index of its semi-core, the subgraph induced by the maximum degree vertices and their neighbors. Finally, we apply these decomposition tools to a classical result [A.J.W. Hilton, Z. Cheng, The chromatic index of a graph whose core has maximum degree 2, Discrete Math. 101 (1992) 135-147] that relates the chromatic index of a graph to its core, the subgraph induced by the maximum degree vertices.