Rooth (1992) and Fiengo and May (1994) argue that elliptical structures are subject to both a semantic and a syntactic parallelism requirement. Pseudosluicing, where an elliptical cleft takes a non-cleft as its antecedent, pose a problem for the idea that there is a syntactic parallelism requirement. In this talk, we will look at Spanish data (building on the analysis of Rodrigues et al. 2008) ...

We prove the validity of an averaging principle for a class of systems of slow-fast reaction-diffusion equations with the reaction terms in both equations having polynomial growth, perturbed by a noise of multiplicative type. The models we have in mind are the stochastic Fitzhugh– Nagumo equation arising in neurophysiology and the Ginzburg–Landau equation arising in statistical mechanics.

In this paper we consider the following problem. Let k < K be fields. Suppose S ⊂ Mn(K) is an absolutely irreducible multiplicative semigroup with the property that the spectrum of every a ∈ S is contained in k. Does it follow that S is simultaneously realizable in Mn(k), that is, does there exist a p ∈ GLn(K) such that pSp−1 ⊂ Mn(k)? The overfield K plays no essential role in this situation. C...

In this paper we study the asymptotic dynamics of the stochastic strongly damped wave equation with multiplicative noise under homogeneous Dirichlet boundary condition. We investigate the existence of a compact random attractor for the random dynamical system associated with the equation.

In this paper, we prove results on the relationship between the complexity of the group and color isomorphism problems. The difficulty of color isomorphism problems is known to be closely linked to the the composition factors of the permutation group involved. Previous works are primarily concerned with applying color isomorphism to bounded degree graph isomorphism, and have therefore focused o...

In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph Isomorphism problem is to determine if there exists one to one correspondence between the structures of two graphs. Graph isomorphism problem arises in many fields such as chemistry, switching theory, inf...

We define a new type of spectrum, called δ-approximate spectrum, of an element a in a complex unital Banach algebra A and show that the δ-approximate spectrum σ_δ (a) of a is compact. The relation between the δ-approximate spectrum and the usual spectrum is investigated. Also an analogue of the classical Gleason-Kahane-Zelazko theorem is established: For each ε>0, there is δ>0 such that if ϕ is...

We present a reduction between subgraph isomorphism and minimal partial subgraph isomorphism. We also provide a new reduction between graph isomorphism and minimal partial graph isomorphism. The new reduction is more efficient and simpler than the previous reduction and can be generalized to subgraph isomorphism. In addition, we show that a reduction from graph isomorphism that makes only one c...

we define a new type of spectrum, called δ-approximate spectrum, of an element a in a complex unital banach algebra a and show that the δ-approximate spectrum σ_δ (a) of a is compact. the relation between the δ-approximate spectrum and the usual spectrum is investigated. also an analogue of the classical gleason-kahane-zelazko theorem is established: for each ε>0, there is δ>0 such that if ϕ is...