On Lander’s conjecture for difference sets whose order is a power of 2 or 3

Let p be a prime and let b be a positive integer. If a (v, k, λ, n) difference set D of order n = p ^b exists in an abelian group with cyclic Sylow p-subgroup S, then \({p\in\{2,3\}}\) and |S| = p. Furthermore, either p = 2 and v ≡ λ ≡ 2 (mod 4) or the parameters of D belong to one of four families explicitly determined in our main theorem.     

Hybrid inclusion and disclusion systems with applications to equilibria and parametric optimization

In this paper, we first establish the existence theorems of the solution of hybrid inclusion and disclusion systems, from which we study mixed types of systems of generalized quasivariational inclusion and disclusion problems and systems of generalized vector quasiequilibrium problems. Some applications of existence theorems to feasible points for various mathematical programs with variational constraints or equilibrium constraints, system of vector saddle point and system of minimax theorem are also given.     

Uniqueness,Extinction and Explosivity of Generalised Markov Branching Processes with Pairwise Interaction

We examine basic properties regarding uniqueness, extinction, and explosivity for the generalised Markov branching processes with pairwise interaction. First we establish uniqueness criteria, proving that in the essentially-explosive case the process is honest if and only if the mean death rate is greater than or equal to the mean birth rate, while in the sub-explosive case the process is dishonest only in exceptional circumstances. Explicit expressions are then obtained for the extinction probabilities, the mean extinction times and the conditional mean extinction times. Explosivity is also investigated and an explicit expression for mean explosion time is established.     

Comparison of Spaces of Hardy Type for the Ornstein–Uhlenbeck Operator

Denote by γ the Gauss measure on ℝ ⁿ and by ${\mathcal{L}}${\mathcal{L}} the Ornstein–Uhlenbeck operator. In this paper we introduce a Hardy space \mathfrakh¹g{{\mathfrak{h}}^1}{{\rm \gamma}} of Goldberg type and show that for each u in ℝ ∖ {0} and r > 0 the operator (rI+L)^iu(r{\mathcal{I}}+{\mathcal{L}})^{iu} is unbounded from \mathfrakh¹g{{\mathfrak{h}}^1}{{\rm \gamma}} to L ¹γ. This result is in sharp contrast both with the fact that (rI+L)^iu(r{\mathcal{I}}+{\mathcal{L}})^{iu} is bounded from H ¹γ to L ¹γ, where H ¹γ denotes the Hardy type space introduced in Mauceri and Meda (J Funct Anal 252:278–313, 2007), and with the fact that in the Euclidean case (rI-D)^iu(r{\mathcal{I}}-\Delta)^{iu} is bounded from the Goldberg space \mathfrakh¹\mathbbRⁿ{{\mathfrak{h}}^1}{{\mathbb{R}}^n} to L ¹ℝ ⁿ . We consider also the case of Riemannian manifolds M with Riemannian measure μ. We prove that, under certain geometric assumptions on M, an operator T{\mathcal{T}}, bounded on L ² μ, and with a kernel satisfying certain analytic assumptions, is bounded from H ¹ μ to L ¹ μ if and only if it is bounded from \mathfrakh¹m{{\mathfrak{h}}^1}{\mu} to L ¹ μ. Here H ¹ μ denotes the Hardy space introduced in Carbonaro et al. (Ann Sc Norm Super Pisa, 2009), and \mathfrakh¹m{{\mathfrak{h}}^1}{\mu} is defined in Section 4, and is equivalent to a space recently introduced by M. Taylor (J Geom Anal 19(1):137–190, 2009). The case of translation invariant operators on homogeneous trees is also considered.     

A note on the <Emphasis Type="BoldItalic">O</Emphasis>(<Emphasis Type="BoldItalic">n</Emphasis>)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices

We propose a new O(n)-space implementation of the GKO-Cauchy algorithm for the solution of linear systems where the coefficient matrix is Cauchy-like. Moreover, this new algorithm makes a more efficient use of the processor cache memory; for matrices of size larger than n ≈ 500–1,000, it outperforms the customary GKO algorithm. We present an applicative case of Cauchy-like matrices with non-reconstructible main diagonal. In this special instance, the O(n) space algorithms can be adapted nicely to provide an efficient implementation of basic linear algebra operations in terms of the low displacement-rank generators.     

Regularity of the Anosov distributions of Euler-Lagrange deformations of geodesic flows

Let g be a negatively curved Riemannian metric of a closed C ^∞ manifold M of dimension at least three. Let L _λ be a C ^∞ one-parameter convex superlinear Lagrangian on TM such that L₀(v) = \frac12 g(v, v){L_0(v)= \frac{1}{2} g(v, v)} for any v ∈ TM. We denote by j^l{\varphi^\lambda} the restriction of the Euler-Lagrange flow of L _λ on the \frac12{\frac{1}{2}} -energy level. If λ is small enough then the flow j^l{\varphi^\lambda} is Anosov. In this paper we study the geometric consequences of different assumptions about the regularity of the Anosov distributions of j^l{\varphi^\lambda} . For example, in the case that the initial Riemannian metric g is real hyperbolic, we prove that for λ small, j^l{\varphi^\lambda} has C ³ weak stable and weak unstable distributions if and only if j^l{\varphi^\lambda} is C ^∞ orbit equivalent to the geodesic flow of g.     

The upper bound of the $${{\rm L}_{\mu}^2}$$ spectrum

Let M be an n-dimensional complete non-compact Riemannian manifold, dμ = e ^h (x)dV(x) be the weighted measure and \triangle_m{\triangle_{\mu}} be the weighted Laplacian. In this article, we prove that when the m-dimensional Bakry–émery curvature is bounded from below by Ric _m ≥ −(m − 1)K, K ≥ 0, then the bottom of the L_m²{{\rm L}_{\mu}^2} spectrum λ₁(M) is bounded by

Julia sets and periodic kneading sequences

We construct abstract Julia sets homeomorphic to Julia sets for complex polynomials of the form f _c (z) = z ² + c, having an associated periodic kneading sequence of the form [`(a*)]{\overline{\alpha\ast}} which is not a period n-tupling. We show that there is a single simply-defined space of “itineraries” which contains homeomorphic copies of all such Julia sets in a natural combinatorial way, with dynamical properties which are derivable directly from the combinatorics. This also leads to a natural definition of abstract Julia sets even for those kneading sequences which are not realized by any polynomial f _c , with similar dynamical properties.     

Cost minimization and the stochastic discount factor

It is shown that a cost function subject to internal costs of adjustment induces a stochastic discount factor (pricing kernel) that is a function of random output, input and output prices, existing capital stock, and investment. The only assumption on firm preferences is that they are increasing in current period consumption and future stochastic consumption. This ensures that the firm will always act to minimize current period cost of providing future consumption, and it is the first-order conditions for this cost minimization problem that generate the stochastic discount factor, which itself can be interpreted as the marginal variable cost of varying stochastic output. A cost-based pricing kernel is estimated using annual time-series data on macroeconomic variables and returns data for the S&P 500 and commercial paper.