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.

On Boas-Type Problem

R.P. Boas has found necessary and sufficient conditions of belonging of function to Lipschitz class. From his findings it turned out, that the conditions on sine and cosine coefficients for belonging of function to Lip α(0 & α & 1) are the same, but for Lip 1 are different. Later his results were generalized by many authors in the viewpoint of generalization of condition on the majorant of modulus of continuity. The aim of this paper is to obtain Boas-type theorems for generalized Lipschitz classes. To define generalized Lipschitz classes we use the concept of modulus of smoothness of fractional order.

Hours worked - Productivity puzzle: identification in fractional integration settings

A recent finding of the structural VAR literature is that the response of hours worked to a technology shock depends on the assumption on the order of integration of the hours. In this work we relax this assumption, allowing for fractional integration and long memory in the process for hours and productivity. We find that the sign and magnitude of the estimated impulse responses of hours to a positive technology shock depend crucially on the assumptions applied to identify them. Responses estimated with short-run identification are positive and statistically significant in all datasets analyzed. Long-run identification results in negative often not statistically significant responses. We check validity of these assumptions with the Sims (1989) procedure, concluding that both types of assumptions are appropriate to recover the impulse responses of hours in a fractionally integrated VAR. However, the application of longrun identification results in a substantial increase of the sampling uncertainty. JEL Classification numbers: C22, E32. Keywords: technology shock, fractional integration, hours worked, structural VAR, identification

Is the observed persistence spurious? A test for fractional integration versus short memory and structural breaks

Although it is commonly accepted that most macroeconomic variables are nonstationary, it is often difficult to identify the source of the non-stationarity. In particular, it is well-known that integrated and short memory models containing trending components that may display sudden changes in their parameters share some statistical properties that make their identification a hard task. The goal of this paper is to extend the classical testing framework for I(1) versus I(0)+ breaks by considering a a more general class of models under the null hypothesis: non-stationary fractionally integrated (FI) processes. A similar identification problem holds in this broader setting which is shown to be a relevant issue from both a statistical and an economic perspective. The proposed test is developed in the time domain and is very simple to compute. The asymptotic properties of the new technique are derived and it is shown by simulation that it is very well-behaved in finite samples. To illustrate the usefulness of the proposed technique, an application using inflation data is also provided.

Sherali-Adams Relaxations and Indistinguishability in Counting Logics

Two graphs with adjacency matrices $\mathbf{A}$ and $\mathbf{B}$ are isomorphic if there exists a permutation matrix $\mathbf{P}$ for which the identity $\mathbf{P}^{\mathrm{T}} \mathbf{A} \mathbf{P} = \mathbf{B}$ holds. Multiplying through by $\mathbf{P}$ and relaxing the permutation matrix to a doubly stochastic matrix leads to the linear programming relaxation known as fractional isomorphism. We show that the levels of the Sherali--Adams (SA) hierarchy of linear programming relaxations applied to fractional isomorphism interleave in power with the levels of a well-known color-refinement heuristic for graph isomorphism called the Weisfeiler--Lehman algorithm, or, equivalently, with the levels of indistinguishability in a logic with counting quantifiers and a bounded number of variables. This tight connection has quite striking consequences. For example, it follows immediately from a deep result of Grohe in the context of logics with counting quantifiers that a fixed number of levels of SA suffice to determine isomorphism of planar and minor-free graphs. We also offer applications in both finite model theory and polyhedral combinatorics. First, we show that certain properties of graphs, such as that of having a flow circulation of a prescribed value, are definable in the infinitary logic with counting with a bounded number of variables. Second, we exploit a lower bound construction due to Cai, Fürer, and Immerman in the context of counting logics to give simple explicit instances that show that the SA relaxations of the vertex-cover and cut polytopes do not reach their integer hulls for up to $\Omega(n)$ levels, where $n$ is the number of vertices in the graph.

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 group strategy-proof mechanisms for a many-to-one matching model

For the many-to-one matching model in which firms have substitutable and quota q-separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. In order to prove this result, we also show that under this domain of preferences (which contains the domain of responsive preferences of the college admissions problem) the workers-optimal stable matching is weakly Pareto optimal for the workers and the Blocking Lemma holds as well. We exhibit an example showing that none of these three results remain true if the preferences of firms are substitutable but not quota q-separable.

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.

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