Information structure in linguistic theory and in speech production : validation of a cross-linguistic data set

The aim of this paper is to validate a dataset collected by means of production experiments which are part of the Questionnaire on Information Structure. The experiments generate a range of information structure contexts that have been observed in the literature to induce specific constructions. This paper compares the speech production results from a subset of these experiments with specific claims about the reflexes of information structure in four different languages. The results allow us to evaluate and in most cases validate the efficacy of our elicitation paradigms, to identify potentially fruitful avenues of future research, and to highlight issues involved in interpreting speech production data of this kind

The federal budget for 1956

Budget ; Federal government

Largest Laplacian Eigenvalue and Degree Sequences of Trees

We investigate the structure of trees that have greatest maximum eigenvalue among all trees with a given degree sequence. We show that in such an extremal tree the degree sequence is non-increasing with respect to an ordering of the vertices that is obtained by breadth-first search. This structure is uniquely determined up to isomorphism. We also show that the maximum eigenvalue in such classes of trees is strictly monotone with respect to majorization.Comment: 9 pages, 2 figure

Fast Recognition of Partial Star Products and Quasi Cartesian Products

This paper is concerned with the fast computation of a relation $\R$ on the edge set of connected graphs that plays a decisive role in the recognition of approximate Cartesian products, the weak reconstruction of Cartesian products, and the recognition of Cartesian graph bundles with a triangle free basis. A special case of $\R$ is the relation $\delta^\ast$, whose convex closure yields the product relation $\sigma$ that induces the prime factor decomposition of connected graphs with respect to the Cartesian product. For the construction of $\R$ so-called Partial Star Products are of particular interest. Several special data structures are used that allow to compute Partial Star Products in constant time. These computations are tuned to the recognition of approximate graph products, but also lead to a linear time algorithm for the computation of $\delta^\ast$ for graphs with maximum bounded degree. Furthermore, we define \emph{quasi Cartesian products} as graphs with non-trivial $\delta^\ast$. We provide several examples, and show that quasi Cartesian products can be recognized in linear time for graphs with bounded maximum degree. Finally, we note that quasi products can be recognized in sublinear time with a parallelized algorithm