3 Uniform measures of complexity 12 3.1 Metric entropy and the combinatorial dimension . . . . . . . . . 12 3.1.1 Binary valued classes . . . . . . . . . . . . . . . . . . . . . 13 3.1.2 Real valued classes . . . . . . . . . . . . . . . . . . . . . . 15 3.2 Random averages and the combinatorial dimension . . . . . . . . 17 3.3 Phase transitions in GC classes . . . . . . . . . . . . . . . . . . ...

A 1-2 model configuration is a subgraph of the hexagonal lattice, in which the edgedegree of each vertex is either 1 or 2. We prove that for any translation invariant Gibbs measure of the 1-2 model configurations on the whole-plane hexagonal lattice, almost surely there are no infinite paths. Using a measure-preserving correspondence between 1-2 model configurations on the hexagonal lattice and...

We provide a new interpretation of mixed strategy equilibria that incorporates both von Neumann and Morgenstern’s classical concealment role of mixing as well as the more recent Bayesian view originating with Harsanyi. For any two-person game, G, we consider an incomplete information game, IG; in which each player’s type is the probability he assigns to the event that his mixed strategy in G is...

In this short note we prove that if a symplectomorphism f is C-stably shadowable, then f is Anosov. The same result is obtained for volume-preserving diffeomorphisms.

In this paper, we study the stability of a wide class of switched systems using stability preserving mappings. By considering an existing result and extending it to a general class of switched systems, we show that stability preserving mappings constitute an important and practical tool in stability analysis and design of switched systems.

let $g$ be a finite simple graph whose vertices and edges are weighted by two functions. in this paper we shall define and calculate entropy of a dynamical system on weights of the graph $g$, by using the weights of vertices and edges of $g$. we examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. at the end it is shown that, for $rin [0,+infty]$, t...

Let D be a division ring and let m,n be integers ≥ 2. Let Mm×n(D) be the space of m × n matrices. In the fundamental theorem of the geometry of rectangular matrices all bijective mappings φ of Mm×n(D) are determined such that both φ and φ−1 preserve adjacency. We show that if a bijective map φ of Mm×n(D) preserves the adjacency then also φ −1 preserves the adjacency. Thus the supposition that φ...