A. Overview (1) Organization: a. What is generative linguistics and phonology? b. Rule-based phonology c. How OT works d. Predictions of the model e. Acquisition and OT f. Current developments g. Resources B. What is generative linguistics and phonology? (2) Competence vs. performance Generative linguists are interested in describing what a speaker knows about their language, rather than in des...

Recall some basic facts about eigenspaces — we say that Eα is an eigenspace of a matrixM of dimension d if the dimension of the nullspace of αI −M has dimension d. Moreover, by the theory covered in class, we must have that the polynomial (λ− α) divides the characteristic polynomial of M , which is defined to be det(λI −M). We first calculate the eigenspaces of Bn. Observe that if α = 1, then w...

The first part of the article is a continuation of [4]. Next, we define the identity sequence of natural numbers and the constant sequences. The main part of this article is the definition of tuples. The element of a set of all sequences of the length n of D is called a tuple of a non-empty set D and it is denoted by element of Dn. Also some basic facts about tuples of a non-empty set are proved.

In this paper we focus on the problem of computing the number of moduli of the so called Severi varieties (denoted by V|D|,δ), which parametrize universal families of irreducible, δ-nodal curves in a complete linear system |D|, on a smooth projective surface S of general type. We determine geometrical and numerical conditions on D and numerical conditions on δ ensuring that such number coincide...

A Fibonacci d-polytope of order k is defined as the convex hull of {0, 1}-vectors with d entries and no consecutive k ones, where k ≤ d. We show that these vertices can be partitioned into k subsets such that the convex hull of the subsets give the equivalent of Fibonacci (d− i)polytopes, for i = 1, . . . , k, which yields a “Fibonacci like” recursive formula to enumerate the vertices. Surprisi...