http://www.openstarts.units.it:80/dspace/handle/10077/5707 Mon, 13 May 2013 10:54:42 GMT 2013-05-13T10:54:42Z http://www.openstarts.units.it:80/dspace/retrieve/16644/eut_logo_100_scritta.gif http://www.openstarts.units.it:80/dspace/handle/10077/5707 http://www.openstarts.units.it:80/dspace/handle/10077/5722 Title: Rendiconti dell’Istituto di Matematica dell’Università di Trieste. An International Journal of Mathematics Type: Fascicolo rivista Sat, 01 Jan 2011 00:00:00 GMT http://www.openstarts.units.it:80/dspace/handle/10077/5722 2011-01-01T00:00:00Z http://www.openstarts.units.it:80/dspace/handle/10077/5721 Title: Editorial Note Authors: -, - Type: Articolo Sat, 01 Jan 2011 00:00:00 GMT http://www.openstarts.units.it:80/dspace/handle/10077/5721 2011-01-01T00:00:00Z http://www.openstarts.units.it:80/dspace/handle/10077/5720 Title: Splitting the Fučík Spectrum and the Number of Solutions to a Quasilinear ODE Authors: García-Huidobro, Marta; Manásevich, Raúl; Zanolin, Fabio Abstract: For $\varnothing$ an increasing homeomorphism from $\mathbb{R}$ onto $\mathbb{R}$ and $f\epsilon C\left(\mathbb{R}\right)$, we consider the problem \[ \left(\varnothing\left(u'\right)\right)'+f\left(u\right)=0,\qquad t\epsilon\left(0,L\right),\qquad u\left(0\right)=0=u\left(L\right). \] The aim is to study multiplicity of solutions by means of some generalized Pseudo Fu$\check{\textrm{c}}$ik spectrum (at infinity, or at zero). New insights that lead to a very precise counting of solutions are obtained by splitting these spectra into two parts, called Positive Pseudo Fu$\check{\textrm{c}}$ik Spectrum (PPFS) and Negative Pseudo Fu$\check{\textrm{c}}$ik spectrum (NPFS) (at infinity, or at zero, respectively), in this form tue can discuss separately the two cases u' (0) > 0 and u' (0) < 0. Type: Articolo Sat, 01 Jan 2011 00:00:00 GMT http://www.openstarts.units.it:80/dspace/handle/10077/5720 2011-01-01T00:00:00Z http://www.openstarts.units.it:80/dspace/handle/10077/5719 Title: Language Sampling for Universal Grammars Authors: Bortolussi, Luca; Sgarro, Andrea Abstract: In this paper we present a sampling algorithm for constrained strings representing the state of parameters of a universal grammar. This sampling algorithm has been used to assess statistical significance of the parametric comparison method, a new syntax-based approach to reconstruct linguistic phylogeny. Type: Articolo Sat, 01 Jan 2011 00:00:00 GMT http://www.openstarts.units.it:80/dspace/handle/10077/5719 2011-01-01T00:00:00Z