Periodic solutions of second-order differential inclusions systems with p-Laplacian

Some existence results are obtained for periodic solutions of nonautonomous second-order differential inclusions systems with p-Laplacian

Periodic solutions for nonautonomous second order differential inclusions systems with p- Laplacian

Using the nonsmooth variant of minimax point theorems, some existence results are obtained for periodic solutions of nonautonomous second-order differential inclusions systems with p-Laplacian.

Sequencing games without initial order

In this note we study uncertainty sequencing situations, i.e., 1-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et al. (1989). Moreover, we propose and characterize two simple cost allocation rules for uncertainty sequencing situations with equal processing times.

On moduli of smoothness of fractional order

In this paper we consider the properties of moduli of smoothness of fractional order. The main result of the paper describes the equivalence of the modulus of smoothness and a function from some class.

Limit cycles for cubic systems with a symmetry of order 4 and without in nite critical points

"Vegeu el resum a l'inici del document del fitxer adjunt."

On the upper bound of the number of limit cycles obtained by the second order averaging method I

"Vegeu el resum a l'inici del document del fitxer adjunt."

On the upper bound of the number of limit cycles obtained by the second order averaging method II

"Vegeu el resum a l'inici del document del fitxer adjunt."

The third order Melnikov function of a quadratic center under quadratic perturbation

We study quadratic perturbations of the integrable system (1+x)dH; where H =(x²+y²)=2: We prove that the first three Melnikov functions associated to the perturbed system give rise at most to three limit cycles.

Stability and manipulation in representative democracies

This paper is devoted to the analysis of all constitutions equipped with electoral systems involving two step procedures. First, one candidate is elected in every jurisdiction by the electors in that jurisdiction, according to some aggregation procedure. Second, another aggregation procedure collects the names of the jurisdictional winners in order to designate the final winner. It appears that whenever individuals are allowed to change jurisdiction when casting their ballot, they are able to manipulate the result of the election except in very few cases. When imposing a paretian condition on every jurisdictions voting rule, it is shown that, in the case of any finite number of candidates, any two steps voting rule that is not manipulable by movement of the electors necessarily gives to every voter the power of overruling the unanimity on its own. A characterization of the set of these rules is next provided in the case of two candidates.

Dynamics of the third order Lyness' difference equation

"Vegeu el resum a l'inici del document del fitxer adjunt"

Clean Development Mechanism and Sustainable Development: a discussion on the link between the CDM and Sustainable Development, an analysis of the current status of the CDM portfolio, and an multicriteria evaluation of the effects of additional incentives in order to foster broad local Sustainable Development dividends from the CDM projects

vegeu resum en el fitxer adjunt a l'inici del treball de recerca

A public-key cryptosystem based on second order linear sequences

Based on Lucas functions, an improved version of the Diffie-Hellman distribution key scheme and to the ElGamal public key cryptosystem scheme are proposed, together with an implementation and computational cost. The security relies on the difficulty of factoring an RSA integer and on the difficulty of computing the discrete logarithm.

A public key encryption based on third order linear sequences

Based on third order linear sequences, an improvement version of the Diffie-Hellman distribution key scheme and the ElGamal public key cryptosystem scheme are proposed, together with an implementation and computational cost. The security relies on the difficulty of factoring an RSA integer and on the difficulty of computing the discrete logarithm.

On the number of higher order Delaunay triangulations

"Vegeu el resum a l'inici del document del fitxer adjunt."