A quantum spin system with random interactions I

We study a quantum spin glass as a quantum spin system with random interactions and establish the existence of a family of evolution groups {τ_t(ω)}_ω∈/Ω of the spin system. The notion of ergodicity of a measure preserving group of automorphisms of the probability space Ω, is used to prove the almost sure independence of the Arveson spectrum Sp(τ(ω)) of τ_t(ε). As a consequence, for any family of (τ(ω),β) — KMS states {ρ(ω)}, the spectrum of the generator of the group of unitaries which implement τ(ω) in the GNS representation is also almost surely independent of ω.     

Analytic sets extending the graphs of holomorphic mappings

Let D, D′ ⊂ ℂⁿ be bounded domains with smooth real analytic boundaries and ƒ: D → D′ be a proper holomorphic map. Our main result implies that if the graph of ƒ extends as an analytic set to a neighborhood of a poìnt (a, a′) ∈ ∂D × 3D′ with a′ ∈ cl_ƒ(a), then ƒ extends holomorphically to a neighborhood of a.     

Maximizing a congruence with respect to its partition of idempotents

For a congruence σ on a semigroupS a congruence μ(σ) onS, containing σ, is defined such that the semigroupS/σ is fundamental if and only if σ=μ(σ). The congruence μ(σ) is shown to possess maximality properties and for idempotent-surjective semigroups, μ(σ) is the maximum congruence with respect to the partition of the idempotents determined by σ. Thus μ is the maximum idempotent-separating congruence on any idempotent-surjective semigroup. It is shown that μ(μ(σ))=μ(σ). If ρ is another congruence onS, possibly with the same partition of the idempotents as σ, then it is of interest to know when ρ⊆σ (or ρ⊆μ(σ)) implies μ(ρ)⊆μ(σ) or even μ(ρ)=μ(σ). These implications are not true in general but if σ⊆ρ⊆μ(σ) then μ(ρ)⊆μ(σ). IfS is an idempotent-surjective semigroup and ρ and σ have the same partition of the idempotents then μ(ρ)=μ(σ).     

Elastic waveguides: history and the state of the art. II

In this paper, the normal modes of an elastic rectangular waveguide are analyzed. We retrace the key aspects of the almost 150-year history of this problem. Using the superposition method, we have obtained an analytical solution of the problem for four types of symmetry of the wave field. In addition, we have established important differences of the dispersion characteristics of normal modes in a rectangle from the Rayleigh–Lamb modes for an infinite plate and the Pochhammer–Chree modes for a cylinder. We give also an estimate of a series of approximate theories for a rectangular waveguide.

The numerical interpretation of the results of analysis is however necessary, and it is a degree of perfection which it would be very important to give to every application of analysis to the natural sciences. So long as it is not obtained, the solutions may be said to remain incomplete and useless, and the truth which it is proposed to discover is no less hidden in the formulas of analysis than it was in the physical problem itself.

                             J. Fourier [28, Sec. 13]

     

Automorphisms of Extensions of ℚ by a Direct Sum of Finitely Many Copies of ℚ

Let G be an extension of ℚ by a direct sum of r copies of ℚ. (1) If G is abelian, then G is a direct sum of r + 1 copies of ℚ and AutG ≅ GL(r + 1, Q); (2) If G is non-abelian, then G is a direct product of an extraspecial ℚ-group E and m copies of ℚ, where E/ζE is a linear space over Q with dimension 2n and m + 2n = r. Furthermore, let AutG′G be the normal subgroup of AutG consisting of all elements of AutG which act trivially on the derived subgroup G′ of G, and AutG/ζG,ζGG be the normal subgroup of AutG consisting of all central automorphisms of G which also act trivially on the center ζG of G. Then (i) The extension 1 → AutG′G → AutG → AutG′ → 1 is split; (ii) AutG′G/AutG/ζG,ζGG ≅ Sp(2n,Q) × (GL(m, Q) ⋉ ℚ(m)); (iii) AutG/ζG,ζGG/InnG ≅ ℚ(2nm).     

On subadditive functions and ψ-additive mappings

In [4], assuming among others subadditivity and submultiplicavity of a function ψ: [0, ∞)→[0, ∞), the authors proved a Hyers-Ulam type stability theorem for “ψ-additive” mappings of a normed space into a normed space. In this note we show that the assumed conditions of the function ψ imply that ψ=0 and, consequently, every “ψ-additive” mapping must be additive     

Erdős measures,sofic measures,and Markov chains

We consider the random variable ζ = ξ₁ρ+ξ₂ρ²+…, where ξ₁, ξ₂, … are independent identically distibuted random variables taking the values 0 and 1 with probabilities P(ξ_i = 0) = p₀, P(ξ_i = 1) = p₁, 0 < p₀ < 1. Let β = 1/ρ be the golden number. The Fibonacci expansion for a random point ρζ from [0, 1] is of the form η₁ρ + η₂ρ² + … where the random variables η_k are {0, 1}-valued and η_kη_k+1 = 0. The infinite random word η = η₁η₂ … η_n … takes values in the Fibonacci compactum and determines the so-called Erdős measure μ(A) = P(η ∈ A) on it. The invariant Erdős measure is the shift-invariant measure with respect to which the Erdős measure is absolutely continuous. We show that the Erdős measures are sofic. Recall that a sofic system is a symbolic system that is a continuous factor of a topological Markov chain. A sofic measure is a one-block (or symbol-to-symbol) factor of the measure corresponding to a homogeneous Markov chain. For the Erdős measures, the corresponding regular Markov chain has 5 states. This gives ergodic properties of the invariant Erdős measure. We give a new ergodic theory proof of the singularity of the distribution of the random variable ζ. Our method is also applicable when ξ₁, ξ₂, … is a stationary Markov chain with values 0, 1. In particular, we prove that the distribution of ζ is singular and that the Erdős measures appear as the result of gluing together states in a regular Markov chain with 7 states. Bibliography: 3 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 326, 2005, pp. 28–47.     

Completions for partially ordered semigroups

A standard completion γ assigns a closure system to each partially ordered set in such a way that the point closures are precisely the (order-theoretical) principal ideals. If S is a partially ordered semigroup such that all left and all right translations are γ-continuous (i.e., Y∈γS implies {x∈S:y·x∈Y}∈γS and {x∈S:x·y∈Y}∈γS for all y∈S), then S is called a γ-semigroup. If S is a γ-semigroup, then the completion γS is a complete residuated semigroup, and the canonical principal ideal embedding of S in γS is a semigroup homomorphism. We investigate the universal properties of γ-semigroup completions and find that under rather weak conditions on γ, the category of complete residuated semigroups is a reflective subcategory of the category of γ-semigroups. Our results apply, for example, to the Dedekind-MacNeille completion by cuts, but also to certain join-completions associated with so-called “subset systems”. Related facts are derived for conditional completions. A first draft of this paper by the second author, containing parts of Section 2, was received on August 9, 1985.     

Decidability of first-order theories for groups and monoids of integral matrices

We deal with the decidability problem for first-order theories of a complete linear group GL(n,ℤ) of all integral matrices of order n ≥ 3. and of a respective complete linear monoid ML(n,ℤ). It is proved that theories ∀? ∧ GL(3,ℤ). ∃∀∧ GL(3,ℤ). ∀? ∧ ML(3,ℤ), and ∃? ∧ ML(3,ℤ) are critical. and that ∃∀ ∧ νGL(n,ℤ) and ∃∀ ∧ML(n,ℤ) are decidable for any n ≥ 3. Translated fromAlgebra i Logika, Vol. 39, No. 4, pp. 480–504, July–August, 2000.     

Vertices of simple modules and normal subgroups ofp-solvable groups

Let π be a set of prime numbers andG a finite π-separable group. Let θ be an irreducible π′-partial character of a normal subgroupN ofG and denote by I_π′ (G‖θ), the set of all irreducible π′-partial characters Φ ofG such that θ is a constituent of Φ_N. In this paper, we obtain some information about the vertices of the elements in I_π′ (G‖θ). As a consequence, we establish an analogue of Fong's theorem on defect groups of covering blocks, for the vertices of the simple modules (in characteristicsp) of a finitep-solvable group lying over a fixed simple module of a normal subgroup.     

A note on quantum products of Schubert classes in a Grassmannian

Given two Schubert classes σ_λ and σ_μ in the quantum cohomology of a Grassmannian, we construct a partition ν, depending on λ and μ, such that σ_ν appears with coefficient 1 in the lowest (or highest) degree part of the quantum product σ_λ⋆σ_μ. To do this, we show that for any two partitions λ and μ, contained in a k × (n − k) rectangle and such that the 180^∘-rotation of one does not overlap the other, there is a third partition ν, also contained in the rectangle, such that the Littlewood-Richardson number c _λμ ^ν is 1.     

Non-wandering sets of the powers of maps of a tree

Let T be a tree and let Ω ( f ) be the set of non-wandering points of a continuous map f: T→ T. We prove that for a continuous map f: T→ T of a tree T: ( i) if x∈ Ω( f) has an infinite orbit, then x∈ Ω( fⁿ) for each n∈ ℕ; (ii) if the topological entropy of f is zero, then Ω( f) = Ω( fⁿ) for each n∈ ℕ. Furthermore, for each k∈ ℕ we characterize those natural numbers n with the property that Ω(f^k) = Ω(f^kn) for each continuous map f of T.     

Noise sensitivity of Boolean functions and applications to percolation

It is shown that a large class of events in a product probability space are highly sensitive to noise, in the sense that with high probability, the configuration with an arbitrary small percent of random errors gives almost no prediction whether the event occurs. On the other hand, weighted majority functions are shown to be noise-stable. Several necessary and sufficient conditions for noise sensitivity and stability are given. Consider, for example, bond percolation on ann+1 byn grid. A configuration is a function that assigns to every edge the value 0 or 1. Let ω be a random configuration, selected according to the uniform measure. A crossing is a path that joins the left and right sides of the rectangle, and consists entirely of edges ℓ with ω(ℓ)=1. By duality, the probability for having a crossing is 1/2. Fix an ɛ ∈ (0, 1). For each edge ℓ, let ω′(ℓ)=ω(ℓ) with probability 1 − ɛ, and ω′(ℓ)=1 − ω(ℓ) with probability ɛ, independently of the other edges. Letp(τ) be the probability for having a crossing in ω, conditioned on ω′ = τ. Then for alln sufficiently large,P{τ : |p(τ) − 1/2| > ɛ}<ɛ.     

Constructing greedy linear extensions by interchanging chains

A natural way to prove that a particular linear extension of an ordered set is ‘optimal’ with respect to the ‘jump number’ is to transform this linear extension ‘canonically’ into one that is ‘optimal’. We treat a ‘greedy chain interchange’ transformation which has applications to ordered sets for which each ‘greedy’ linear extension is ‘optimal’.     

On groups factorized by finitely many subgroups

We prove that every group factorizable into a product of finitely many pairwise permutable central-by-finite minimax subgroups is a soluble-by-finite group.

---

Про групи, факторизовані скінченним числом шдгруп

Розвивається спектральна теорія та теорія розсіяння для одпого класу самоспряжених матричних диференціальних операторів змішаного порядку.

---

---

This work was done while the author was visiting the Ukrainian Academy of Sciences in Kiev. He is grateful to the Institute of Mathematics for its warm hospitality.     

Stability of lurie-type non-linear equations

Summary Conditions are given for the indirect control system x′=a(x)+bμ, μ′=φ(σ), σ=c^Tx−ϱμ, to be absolutely stable. These conditions reduce to LaSalle and Lefschetz's in the linear case: a(x)=Ax. The conditions obtained for the stability of the direct control system x′=a(x)+bφ(σ), σ=c^Tx, reduce also to Lurie's condition in the linear case. The case of the direct control system x′=a(x, t)+bφ(σ), σ=c^Tx is also investigated. Entrata in Redazione il 18 febbraio 1976.     

Provability interpretations of modal logic

We consider interpretations of modal logic in Peano arithmetic (P) determined by an assignment of a sentencev ^* ofP to each propositional variablev. We put (⊥)*=“0 = 1”, (χ → ψ)* = “χ* → ψ*” and let (□ψ)* be a formalization of “ψ)* is a theorem ofP”. We say that a modal formula, χ, isvalid if ψ* is a theorem ofP in each such interpretation. We provide an axiomitization of the class of valid formulae and prove that this class is recursive.