Variation and Change in Peruvian Spanish Word Order: Language Contact and Dialect Contact in Lima

Previous studies have revealed that the direct object/verb (OV) word order typical of Quechua and Aymara is also prevalent in Andean Spanish. The current study examines the frequency of such structures in Lima, Peru, where massive migration over the past 60 years has brought speakers of Andean indigenous languages and rural Andean Spanish into close contact with speakers of limeño Spanish. Goldvarb analysis of data from 34 participants (seven first-generation migrants, six 1.5-generation migrants, 10 second-generation migrants, and 11 native limeños) indicates that the pragmatic functions that motivated OV order among the participants include those found in noncontact varieties of Spanish, as well as others reported for rural Andean Spanish. Furthermore, L1 speakers of an indigenous language, who were almost all first- and 1.5-generation immigrants, were significantly more likely to use OV word order than L1 Spanish speakers. In contrast, in the speech of second-generation migrants, nearly all of whom spoke Spanish as an L1, the frequency of OV word order was similar to that documented for other non-contact varieties of Spanish

An update on the Hirsch conjecture

The Hirsch conjecture was posed in 1957 in a letter from Warren M. Hirsch to George Dantzig. It states that the graph of a d-dimensional polytope with n facets cannot have diameter greater than n - d. Despite being one of the most fundamental, basic and old problems in polytope theory, what we know is quite scarce. Most notably, no polynomial upper bound is known for the diameters that are conjectured to be linear. In contrast, very few polytopes are known where the bound $n-d$ is attained. This paper collects known results and remarks both on the positive and on the negative side of the conjecture. Some proofs are included, but only those that we hope are accessible to a general mathematical audience without introducing too many technicalities.Comment: 28 pages, 6 figures. Many proofs have been taken out from version 2 and put into the appendix arXiv:0912.423

Measurement of bronchial hyperreactivity : comparison of three Nordic dosimetric methods

Clinical testing of bronchial hyperreactivity (BHR) provides valuable information in asthma diagnostics. Nevertheless, the test results depend to a great extent on the testing procedure: test substance, apparatus and protocol. In Nordic countries, three protocols predominate in the testing field: Per Malmberg, Nieminen and Sovijarvi methods. However, knowledge of their equivalence is limited. We aimed to find equivalent provocative doses (PD) to obtain similar bronchoconstrictive responses for the three protocols. We recruited 31 patients with suspected asthma and health care workers and performed BHR testing with methacholine according to Malmberg and Nieminen methods, and with histamine according to Sovijarvi. We obtained the individual response-dose slopes for each method and predicted equivalent PD values. Applying a mixed-model, we found significant differences in the mean (standard error of mean) response-dose (forced expiratory volume in one second (FEV1)%/mg): Sovijarvi 7.2 (1.5), Nieminen 13.8 (4.2) and Malmberg 26 (7.3). We found that the earlier reported cut-point values for moderate BHR and marked BHR between the Sovijarvi (PD15) and Nieminen (PD20) methods were similar, but with the Malmberg method a significant bronchoconstrictive reaction was measured with lower PD20 values. We obtained a relationship between slope values and PD (mg) between different methods, useful in epidemiological research and clinical practice.Peer reviewe

Surface modification of hydrophobic polymers for improvement of endothelial cell-surface interactions

The aim of this study is to improve the interaction of endothelial cells with polymers used in vascular prostheses. Polytetrafluoroethylene (PTFE; Teflon) films were treated by means of nitrogen and oxygen plasmas. Depending on the plasma exposure time, modified PTFE surfaces showed water-contact angles of 15¿58° versus 96° for unmodified PTFE. Electron spectroscopy in chemical analysis (ESCA) measurements revealed incorporation of both nitrogenand oxygen-containing groups into the PTFE surfaces, dependent on the plasma composition and exposure time. In-vitro biological evaluation of unmodified and modified PTFE surfaces showed that human endothelial cells, seeded from 20% human serum-containing culture medium, adhered well on to modified PTFE surfaces, but not on to unmodified films. Adhesion of endothelial cells on to expanded PTFE graft material (Gore-Tex) was also stimulated by plasma treatment of this substrate. On plasma-treated expanded PTFE, the adhering endothelial cells formed a monolayer, which covered the textured surface. The latter observation is important in view of the hemocompatibility of vascular grafts seeded with endothelial cells before implantation

Property (T) and rigidity for actions on Banach spaces

We study property (T) and the fixed point property for actions on $L^p$ and other Banach spaces. We show that property (T) holds when $L^2$ is replaced by $L^p$ (and even a subspace/quotient of $L^p$), and that in fact it is independent of $1\leq p<\infty$. We show that the fixed point property for $L^p$ follows from property (T) when 1. For simple Lie groups and their lattices, we prove that the fixed point property for $L^p$ holds for any $1< p<\infty$ if and only if the rank is at least two. Finally, we obtain a superrigidity result for actions of irreducible lattices in products of general groups on superreflexive Banach spaces.Comment: Many minor improvement

Combinatorial Markov chains on linear extensions

We consider generalizations of Schuetzenberger's promotion operator on the set L of linear extensions of a finite poset of size n. This gives rise to a strongly connected graph on L. By assigning weights to the edges of the graph in two different ways, we study two Markov chains, both of which are irreducible. The stationary state of one gives rise to the uniform distribution, whereas the weights of the stationary state of the other has a nice product formula. This generalizes results by Hendricks on the Tsetlin library, which corresponds to the case when the poset is the anti-chain and hence L=S_n is the full symmetric group. We also provide explicit eigenvalues of the transition matrix in general when the poset is a rooted forest. This is shown by proving that the associated monoid is R-trivial and then using Steinberg's extension of Brown's theory for Markov chains on left regular bands to R-trivial monoids.Comment: 35 pages, more examples of promotion, rephrased the main theorems in terms of discrete time Markov chain

Economic performance or electoral necessity? Evaluating the system of voluntary income to political parties

Whilst the public funding of political parties is the norm in western democracies, its comprehensive introduction has been resisted in Britain. Political and electoral arrangements in Britain require parties to function and campaign on a regular basis, whilst their income follows cycles largely related to general elections. This article shows that the best predictor of party income is the necessity of a well-funded general election campaign rather than party performance. As a result, income can only be controlled by parties to a limited degree, which jeopardises their ability to determine their own financial position and fulfil their functions as political parties

Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum dimension of a bounded face, then the number of vertices of the polyhedron is O(n^d) and the total number of bounded faces of the polyhedron is O(n^d^2). For inputs in general position the number of bounded faces is O(n^d). For any fixed d, we show how to compute the set of all vertices, how to determine the maximum dimension of a bounded face of the polyhedron, and how to compute the set of bounded faces in polynomial time, by solving a polynomial number of linear programs

A Novel Approach for Ellipsoidal Outer-Approximation of the Intersection Region of Ellipses in the Plane

In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection of the ellipses are found in an efficient manner. To do so, the intersection points of the ellipses that fall on the boundary of the intersection region are determined, and a set of points is generated on the elliptic arcs connecting every two neighbouring intersection points. By finding the tangent lines to the ellipses at the extended set of points, a set of half-planes is obtained, whose intersection forms a polygon. To find the polygon more efficiently, the points are given an order and the intersection of the half-planes corresponding to every two neighbouring points is calculated. If the polygon is convex and bounded, these calculated points together with the initially obtained intersection points will form its vertices. If the polygon is non-convex or unbounded, we can detect this situation and then generate additional discrete points only on the elliptical arc segment causing the issue, and restart the algorithm to obtain a bounded and convex polygon. Finally, the smallest area ellipse that contains the vertices of the polygon is obtained by solving a convex optimization problem. Through numerical experiments, it is illustrated that the proposed technique returns a tighter outer-approximation of the intersection of multiple ellipses, compared to conventional techniques, with only slightly higher computational cost