Minimal stabilization of vector (MISO and SIMO) systems

We consider the problem of constructing a stabilizer described by a system of linear differential equations and such that a given dynamical system becomes stable after being closed by the feedback produced by the stabilizer. Moreover, we require that the dimension of the stabilizer, that is, the dimension of its state vector, be minimal. We assume that the given system has either a single input and multiple outputs (a SIMO system) or, on the opposite, multiple inputs and a single output (a MISO system).     

Coarse-grained entropy in dynamical systems

Let M be the phase space of a physical system. Consider the dynamics, determined by the invertible map T: M → M, preserving the measure µ on M. Let ν be another measure on M, dν = ρdµ. Gibbs introduced the quantity s(ρ) = ?∝ρ log ρdµ as an analog of the thermodynamical entropy. We consider a modification of the Gibbs (fine-grained) entropy the so called coarse-grained entropy. First we obtain a formula for the difference between the coarse-grained and Gibbs entropy. The main term of the difference is expressed by a functional usually referenced to as the Fisher information. Then we consider the behavior of the coarse-grained entropy as a function of time. The dynamics transforms ν in the following way: ν → ν _n , dν _n = ρ ○ T ^?n dµ. Hence, we obtain the sequence of densities ρ _n = ρ ○ T ^?n and the corresponding values of the Gibbs and the coarse-grained entropy. We show that while the Gibbs entropy remains constant, the coarse-grained entropy has a tendency to a growth and this growth is determined by dynamical properties of the map T. Finally, we give numerical calculation of the coarse-grained entropy as a function of time for systems with various dynamical properties: integrable, chaotic and with mixed dynamics and compare these calculation with theoretical statements.     

Tame division algebras of prime period over function fields of p-adic curves

Let F be a field finitely generated and of transcendence degree one over a p-adic field, and let ? ≠ p be a prime. Results of Merkurjev and Saltman show that H²(F, µ_?) is generated by ?/?-cyclic classes. We prove the “?/?-length” in H²(F, µ_?) is less than the ?-Brauer dimension, which Salt-man showed to be three. It follows that all F-division algebras of period ? are crossed products, either cyclic (by Saltman’s cyclicity result) or tensor products of two cyclic F-division algebras. Our result was originally proved by Suresh when F contains the ?-th roots of unity µ_?.     

Équivalence rationnelle sur les hypersurfaces cubiques de mauvaise réduction

This article consists of two independent, but related, parts. The first one proves the vanishing of the Chow group of classes of zero-cycles of degree zero modulo rational equivalence for a cubic hypersurface of dimension ?10 on a p-adic or C₂ field (and, in fact, the R-triviality of such a hypersurface). This is done without the assumption of good reduction (or even smoothness). The second part goes in the other direction and gives an explicit example of a smooth cubic hypersurface of dimension 3 (necessarily of bad reduction) on a field such as C((ν,t)) (or C((ν))((t))) whose Chow group of classes of zero-cycles of degree zero modulo rational equivalence does not vanish.     

Negative entropy,zero temperature and Markov chains on the interval

We consider ergodic optimization for the shift map on the modified Bernoulli space σ: [0, 1]^? → [0, 1]^?, where [0, 1] is the unit closed interval, and the potential A: [0, 1]^? → ? considered depends on the two first coordinates of [0, 1]^?. We are interested in finding stationary Markov probabilities µ_∞ on [0, 1]^? that maximize the value ∫ Adµ, among all stationary (i.e. σ-invariant) probabilities µ on [0, 1]^?. This problem correspond in Statistical Mechanics to the zero temperature case for the interaction described by the potential A. The main purpose of this paper is to show, under the hypothesis of uniqueness of the maximizing probability, a Large Deviation Principle for a family of absolutely continuous Markov probabilities µ _β which weakly converges to µ_∞. The probabilities µ _β are obtained via an information we get from a Perron operator and they satisfy a variational principle similar to the pressure in Thermodynamic Formalism. As the potential A depends only on the first two coordinates, instead of the probability µ on [0, 1]^?, we can consider its projection ν on [0, 1]². We look at the problem in both ways. If µ_∞ is the maximizing probability on [0, 1]^?, we also have that its projection ν _∞ is maximizing for A. The hypothesis about stationarity on the maximization problem can also be seen as a transhipment problem. Under the hypothesis of A being C ² and the twist condition, that is,

$\frac{{\partial ^2 A}}{{\partial x\partial y}}(x,y) \ne 0, for all (x,y) \in [0,1]^2 ,$

we show the graph property of the maximizing probability ν on [0, 1]². Moreover, the graph is monotonous. An important result we get is: the maximizing probability is unique generically in Mañé’s sense. Finally, we exhibit a separating sub-action for A.

     

On the best mean square approximations by entire functions of exponential type in L 2(ℝ) and mean ν-widths of some functional classes

We consider some extremal problems of approximation theory of functions on the whole real axis ? by entire functions of the exponential type. In particular, we find the exact values of the mean ν-widths of classes of functions, defined by the modules of continuity of the mth order ω _m and majorants ψ satisfying the special type of restriction.     

Infinite systems of noncolliding generalized meanders and Riemann–Liouville differintegrals

Yor’s generalized meander is a temporally inhomogeneous modification of the 2(ν + 1)-dimensional Bessel process with ν  >   ? 1, in which the inhomogeneity is indexed by $\kappa \in [0, 2(\nu+1))$ . We introduce the noncolliding particle systems of the generalized meanders and prove that they are Pfaffian processes, in the sense that any multitime correlation function is given by a Pfaffian. In the infinite particle limit, we show that the elements of matrix kernels of the obtained infinite Pfaffian processes are generally expressed by the Riemann–Liouville differintegrals of functions comprising the Bessel functions J _ν used in the fractional calculus, where orders of differintegration are determined by ν ? κ. As special cases of the two parameters (ν, κ), the present infinite systems include the quaternion determinantal processes studied by Forrester, Nagao and Honner and by Nagao, which exhibit the temporal transitions between the universality classes of random matrix theory.     

The number of eigenvalues of the two-particle discrete Schrödinger operator

We consider the two-particle discrete Schrödinger operator associated with the Hamiltonian of a system of two particles (fermions) interacting only at the nearest neighbor sites. We find the number and the location of the eigenvalues of this operator depending on the particle interaction energy, the system quasimomentum, and the dimension of the lattice ? ^ν , ν ≥ 1.     

Universally L 1 good sequences with gaps tending to infinity

We construct a sequence (n _k ) such that n _{k + 1} − n _k → ∞ and for any ergodic dynamical system (X, Σ, μ, T) and f ε L ¹(μ) the averages converge to ∝ _X f dμ for μ almost every x. Since the above sequence is of zero Banach density this disproves a conjecture of J. Rosenblatt and M. Wierdl about the nonexistence of such sequences. Research supported by the Hungarian National Foundation for Scientific research T049727.     

The products of conjugacy classes in some infinite simple groups

LetH _ν =S/S ^ν , whereS is the group of all permutations of a set of cardinality ? _ν andS ^v is its subgroup of permutations moving less than ? _ν elements. The infinite simple groupsH _ν ,ν>0, have covering number two; that is,C ²=H ^ν holds for each nonunit conjugacy classC[M]. Janko’s small groupJ ₁, the only finite simple group with covering number two, satisfies also: 1 $$C_{^1 } \subseteq C_{^2 } \cdot C_{^3 } for any nonunit classes C_{^1 } ,C_{^2 } ,C_{^3 } $$ . In fact,H _ν (ν>0) are the only groups of covering number two where (*) is known to fail. In this paper we determine arbitrary products of classes inH _ν (ν>0).     

Small Divisor Problem in Dynamical Systems and Analytic Solutions of a q-Difference Equation with a Singularity at the Origin

In this paper, we consider a q-difference equation $$\sum_{j=0}^{k}\sum_{t=1}^{\infty}C_{t,j}(z)(y(q^jz))^{t}=G(z)$$ in the complex field ${\mathbb C,}$ where C _t,j (z) and G(z) have a h ₁ order pole and a h ₂ order pole at z = 0, respectively. Under the case 0 < |q| < 1 or |q| = 1, we give the existence of local analytic solutions for the above equation by using small divisor theory in dynamical systems.     

Estimation of Spectral Bounds in Gradient Algorithms

We consider the solution of linear systems of equations Ax=b, with A a symmetric positive-definite matrix in ? ^n×n , through Richardson-type iterations or, equivalently, the minimization of convex quadratic functions (1/2)(Ax,x)?(b,x) with a gradient algorithm. The use of step-sizes asymptotically distributed with the arcsine distribution on the spectrum of A then yields an asymptotic rate of convergence after k<n iterations, k→∞, that coincides with that of the conjugate-gradient algorithm in the worst case. However, the spectral bounds m and M are generally unknown and thus need to be estimated to allow the construction of simple and cost-effective gradient algorithms with fast convergence. It is the purpose of this paper to analyse the properties of estimators of m and M based on moments of probability measures ν _k defined on the spectrum of A and generated by the algorithm on its way towards the optimal solution. A precise analysis of the behavior of the rate of convergence of the algorithm is also given. Two situations are considered: (i) the sequence of step-sizes corresponds to i.i.d. random variables, (ii) they are generated through a dynamical system (fractional parts of the golden ratio) producing a low-discrepancy sequence. In the first case, properties of random walk can be used to prove the convergence of simple spectral bound estimators based on the first moment of ν _k . The second option requires a more careful choice of spectral bounds estimators but is shown to produce much less fluctuations for the rate of convergence of the algorithm.     

Geometry and entropy of generalized rotation sets

For a continuous map f on a compact metric space we study the geometry and entropy of the generalized rotation set Rot(Φ). Here Φ = (?₁, ..., ? _m ) is a m-dimensional continuous potential and Rot(Φ) is the set of all µ-integrals of Φ and µ runs over all f-invariant probability measures. It is easy to see that the rotation set is a compact and convex subset of ? ^m . We study the question if every compact and convex set is attained as a rotation set of a particular set of potentials within a particular class of dynamical systems. We give a positive answer in the case of subshifts of finite type by constructing for every compact and convex set K in ? ^m a potential Φ = Φ(K) with Rot(Φ) = K. Next, we study the relation between Rot(Φ) and the set of all statistical limits Rot _Pt (Φ). We show that in general these sets differ but also provide criteria that guarantee Rot(Φ) = Rot _Pt (Φ). Finally, we study the entropy function w ? H(w),w ∈ Rot(Φ). We establish a variational principle for the entropy function and show that for certain non-uniformly hyperbolic systems H(w) is determined by the growth rate of those hyperbolic periodic orbits whose Φ-integrals are close to w. We also show that for systems with strong thermodynamic properties (sub-shifts of finite type, hyperbolic systems and expansive homeomorphisms with specification, etc.) the entropy function w ? H(w) is real-analytic in the interior of the rotation set.     

Synthesis of minimum-order robust inverters

In the present paper, we consider the inversion problem for dynamical systems, that is, the problem of reconstruction of the unknown input signal ξ(t) of a given system on the basis of known information (about either the complete phase vector or a measurable output of the system). An auxiliary dynamical system forming the desired estimate of the signal ξ(t) is called an inverter.In earlier papers of the authors, attention was mainly paid to the possibility of inversion of a dynamical system in different cases in principle. In this relation, a model of dynamical systems with some stabilizing control was used as an inverter for the solution of the problem; moreover, this control was often designed with the use of an additional dynamical system, an observer of the phase vector of the original system or the system in deviations. Thus, a dynamical system whose dimension either coincides with the dimension of the original system or exceeds it was considered as an inverter.In the solution of practical problems, it is often required to synthesize inverters of minimal order. (This requirement is related to constraints on the complexity, cost, and operation speed of automated control systems.) In the present paper, we consider the problem on the possible reduction of the order of the inverter in various cases and the problem on the construction of inverters of minimal order.     

On recurrence and transience of self-interacting random walks

Let µ₁,...,µ _k be d-dimensional probabilitymeasures in ? ^d with mean 0. At each time we choose one of the measures based on the history of the process and take a step according to that measure. We give conditions for transience of such processes and also construct examples of recurrent processes of this type. In particular, in dimension 3 we give the complete picture: every walk generated by two measures is transient and there exists a recurrent walk generated by three measures.     

Threshold phenomena for a reaction-diffusion system

We consider the pure initial value problem for the system of equations $\text{ν}{}_{\mathrm{t}}\text{= ν}{}_{\mathrm{xx}}\text{+ ?(ν) ? w, w}{}_{\mathrm{t}}\text{= ε(ν ? γw), ε, γ ? 0}$, the initial data being (ν(x, 0), w(x, 0)) = (?(x), 0). Here $\text{?(v) = ?v + H(v ? a)}$, where H is the Heaviside step function and $\text{a ? (0,}\text{1}\text{2}\text{)}$. This system is of the FitzHugh-Nagumo type and has several applications including nerve conduction and distributed chemical/ biochemical systems. It is demonstrated that this system exhibits a threshold phenomenon. This is done by considering the curve s(t) defined by s(t) = sup{x: v(x, t) = a}. The initial datum, ?(x), is said to be superthreshold if lim_{t→∞ s(t) = ∞}. It is proven that the initial datum is superthreshold if ?(x) > a on a sufficiently long interval, ?(x) is sufficiently smooth, and ?(x) decays sufficiently fast to zero as $\text{¦x¦ → ∞}$.     

The block grade of a block Krylov space

The aim of the paper is to compile and compare basic theoretical facts on Krylov subspaces and block Krylov subspaces. Many Krylov (sub)space methods for solving a linear system Ax=b have the property that in exact computer arithmetic the true solution is found after ν iterations, where ν is the dimension of the largest Krylov subspace generated by A from r₀, the residual of the initial approximation x₀. This dimension is called the grade of r₀ with respect to A. Though the structure of block Krylov subspaces is more complicated than that of ordinary Krylov subspaces, we introduce here a block grade for which an analogous statement holds when block Krylov space methods are applied to linear systems with multiple, say s, right-hand sides. In this case, the s initial residuals are bundled into a matrix R₀ with s columns. The possibility of linear dependence among columns of the block Krylov matrix , which in practical algorithms calls for the deletion (or, deflation) of some columns, requires extra care. Relations between grade and block grade are also established, as well as relations to the corresponding notions of a minimal polynomial and its companion matrix.     

Global Hölder estimates for optimal transportation

We generalize the well-known result due to Caffarelli concerning Lipschitz estimates for the optimal transportation T of logarithmically concave probability measures. Suppose that T: ? ^d → ? ^d is the optimal transportation mapping µ = e ^?V dx to ν = e ^?W dx. Suppose that the second difference-differential V is estimated from above by a power function and that the modulus of convexity W is estimated from below by the function A _q |x|^1+q , q ≥ 1. We prove that, under these assumptions, the mapping T is globally Hölder with the Hölder constant independent of the dimension. In addition, we study the optimal mapping T of a measure µ to Lebesgue measure on a convex bounded set K ? ? ^d . We obtain estimates of the Lipschitz constant of the mapping T in terms of d, diam(K), and DV, D ² V.     

Full automorphism group of the generalized symplectic graph

Let Fq be a finite field of odd characteristic, m, ν the integers with 1≤m≤ν and Ka 2ν× 2ν nonsingular alternate matrix over Fq. In this paper, the generalized symplectic graph GSp2ν (q, m) relative to K over Fq is introduced. It is the graph with m-dimensional totally isotropic subspaces of the 2ν-dimensional symplectic space F(2ν)q as its vertices and two vertices P and Q are adjacent if and only if the rank of PKQT is 1 and the dimension of P ∩ Q is m-1. It is proved that the full automorphism group of the graph GSp2ν(q, m) is the projective semilinear symplectic group PΣp(2ν, q).