Exploring the role of market learning capability in competitive strategy

It has been argued that a firm's capacity to learn from its market is a source of both innovation and competitive advantage. However, past research has failed to conceptualize market-focused learning activity as a capability having the potential to contribute to competitive advantage. Prior innovation research has been biased toward technological innovation. However, there is evidence to suggest that both technological and non-technological innovations contribute to competitive advantage reflecting the need for a broader conceptualization of the innovation construct. Past research has also overlooked the critical role of entrepreneurship in the capability building process. Competitive advantage has been predominantly measured in terms of financial indicators of performance. In general, the literature reflects the need for comprehensive measures of organizational innovation and competitive advantage. This paper examines the role of market-focused learning capability in organizational innovation-based competitive strategy. The paper contributes to the strategic marketing theory by developing and refining measures of entrepreneurship, market-focused learning capability, organizational innovation and sustained competitive advantage, testing relationships among these constructs.

Pseudo-randomness of round-off errors in discretized linear maps on the plane

We analyze the sequences of round-off errors of the orbits of a discretized planar rotation, from a probabilistic angle. It was shown [Bosio & Vivaldi, 2000] that for a dense set of parameters, the discretized map can be embedded into an expanding p-adic dynamical system, which serves as a source of deterministic randomness. For each parameter value, these systems can generate infinitely many distinct pseudo-random sequences over a finite alphabet, whose average period is conjectured to grow exponentially with the bit-length of the initial condition (the seed). We study some properties of these symbolic sequences, deriving a central limit theorem for the deviations between round-off and exact orbits, and obtain bounds concerning repetitions of words. We also explore some asymptotic problems computationally, verifying, among other things, that the occurrence of words of a given length is consistent with that of an abstract Bernoulli sequence.