Stability of <Emphasis Type="Italic">n</Emphasis>-particle pseudorelativistic systems

For a system Z_n of n identical pseudorelativistic particles, we show that under some restrictions on the pair interaction potentials, there is an infinite sequence of numbers n_s, s = 1, 2,..., such that the system Z_n is stable for _n = n_s, and the inequality sup _sn_s+1n _s ⁻¹ < + ∞ holds. Furthermore, we show that if the system Z_n is stable, then the discrete spectrum of the energy operator for the relative motion of the system Z_n is nonempty for some values of the total momentum of the particles in the system. The stability of n-particle systems was previously studied only for nonrelativistic particles. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 152, No. 3, pp. 528–537, September, 2007.     

Spectra of Hamiltonians of molecule pseudorelativistic electrons in spaces of functions with permutational and point symmetry

We study the spectral properties of the Hamiltonian H _n of n pseudorelativistic electrons in the Coulomb field of k fixed nuclei in spaces of functions having arbitrary given types of permutational and point symmetry. For this operator, we establish the location of the essential spectrum, obtain two-sided estimates of the discrete spectrum counting function in terms of the counting functions of the discrete spectrum of some two-particle nonrelativistic operators, and find the leading term of the spectral asymptotics.     

Note on primitive words

This note presents an example that disproves, forn=4, Weinbaum’s conjecture, that ifw is a cyclically reduced primitive word inF _n such that all the generatorsx∈X appear inw then some cyclic permutation ofw can be partitioned inton words generatingF _n :w≡uv,vu≡s ₁ s ₂…s _n , <s ₁,s ₂,…s _n >=F _n .     

A braidlike presentation of Sp(n,p)

Forn even andp an odd prime a symplectic group Sp(n, p) is a quotient of the Artin braid groupB _n+1. Ifs ₁, …,s _n are standard generators ofB _n+1 then the kernel of the corresponding epimorphism is the normal closure of just four elements:s ₁ ^p ,(s ₁ s ₂)⁶,s ₁ ^(p+1)/2 s ₂ ⁴ s ₁ ^(p−1)/2 s ₂ ⁻² s ₁ ⁻¹ s ₂ ² and (s ₁ s ₂ s ₃)⁴ A ⁻¹ s ₁ ⁻² A, whereA=s ₂ s ₃ ⁻¹ s ₂ ^(p−1)/2 s ₄ s ₃ ² s ₄, all of them lying in the subgroupB ₅. Sp(n, p) acts on a vector space and the image of the subgroupB _n ofB _n+1 in Sp(n, p), denoted Sp(n−1,p), is a stabilizer of one vector. A sequence of inclusions …B _k+1·B _k … induces a sequence of inclusions …Sp(k,p)·Sp(k−1,p)…, which can be used to study some finite-valued invariants of knots and links in the 3-sphere via the Markov theorem. Partially supported by the Technion VPR-Fund.     

Spectral properties of a pseudorelativistic system of two particles with finite masses

The discrete spectrum of the Hamiltonian of a pseudorelativistic system of two particles with finite masses is investigated for a fixed total system momentum p and interaction potentials having the form Z|r₁₂|^−γ for large |r₁₂|, where Z<0 and 0<γ≤2. The leading spectral asymptotic term is derived for γ<2. For γ=2, conditions are found for the finiteness and infiniteness of the discrete spectrum that depend (for some Z) on the fixed momentum p, which radically distinguishes the situation in question from the nonrelativistic case. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 121, No. 2, pp. 297–306, November, 1999.     

Discrete spectrum in the gaps of a perturbed pseudorelativistic hamiltonian

The pseudorelativistic Hamiltonian is considered under wide conditions on potentials A(x), W(x). It is assumed that a real point λ is regular for G_1/2. Let G_1/2(α)=G_1/2−αV, where α>0, V(x)≥0, and V ∈L _d(ℝ^d). Denote by N(λ, α) the number of eigenvalues of G_1/2(t) that cross the point λ as t increases from 0 to α. A Weyl-type asymptotics is obtained for N(λ, α) as α→∞. Bibliography: 5 titles. To O. A. Ladyzhenskaya Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 249, 1997. pp. 102–117. Translated by A. B. Pushnitskii.     

The cycle structure of two rows in a random Latin square

Let L be chosen uniformly at random from among the latin squares of order n ≥ 4 and let r,s be arbitrary distinct rows of L. We study the distribution of σ_r,s, the permutation of the symbols of L which maps r to s. We show that for any constant c > 0, the following events hold with probability 1 ‐ o(1) as n → ∞: (i) σ_r,s has more than (log n)^1?c cycles, (ii) σ_r,s has fewer than 9 cycles, (iii) L has fewer than n^5/2 intercalates (latin subsquares of order 2). We also show that the probability that σ_r,s is an even permutation lies in an interval and the probability that it has a single cycle lies in [2n^‐2,2n^‐2/3]. Indeed, we show that almost all derangements have similar probability (within a factor of n^3/2) of occurring as σ_r,s as they do if chosen uniformly at random from among all derangements of {1,2,…,n}. We conjecture that σ_r,s shares the asymptotic distribution of a random derangement. Finally, we give computational data on the cycle structure of latin squares of orders n ≤ 11. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

A problem on semigroups satisfying permutation identities

Let σ be a nontrivial permutation of ordern. A semigroupS is said to be σ-permutable ifx ₁ x ₂ ...x _n =x _σ(1) x _σ(2) ...x _σ(n) , for every (x ₁ ,x ₂,...,x _n )∈S ⁿ . A semigroupS is called(r,t)-commutative, wherer,t are in ℕ^*, ifx ₁ ...x _r x _r+1 ...x _r+t =x _r+1 ...x _r+t x ₁ ...x _r , for every (x ₁ ,x ₂,...,x _r+t ∈S ^r+t . According to a result of M. Putcha and A. Yaqub ([11]), if σ is a fixed-point-free permutation andS is a σ-permutable semigroup then there existsk ∈ ℕ^* such thatS is (1,k)-commutative. In [8], S. Lajos raises up the problem to determine the leastk=k(n) ∈ ℕ^* such that, for every fixed-point-free permutation σ of ordern, every σ-permutable semigroup is also (1,k)-commutative. In this paper this problem is solved for anyn less than or equal to eight and also whenn is any odd integer. For doing this we establish that if a semigroup satisfies a permutation identity of ordern then inevitably it also satisfies some permutation identities of ordern+1.     

A Degree Constraint for Uniquely Hamiltonian Graphs

A graph, G, is called uniquely Hamiltonian if it contains exactly one Hamilton cycle. We show that if G=(V, E) is uniquely Hamiltonian then Where #(G)=1 if G has even number of vertices and 2 if G has odd number of vertices. It follows that every n-vertex uniquely Hamiltonian graph contains a vertex whose degree is at most c log₂n+2 where c=(log₂3−1)⁻¹≈1.71 thereby improving a bound given by Bondy and Jackson [3].     

On the number of cycles of given length of a free word in several random permutations

Let w ≠ 1 be a free word in the symbols g₁,…, g_k and their inverses (i.e., an element of the free group F_k). For any s₁,…, s_k, in the group s_n of all permutation of n objects, we denote by w(s₁,…,s_k) ? S_n the permutation obtained by replacing g₁,…, g_k with s₁,…, s_k in the expression of w. Let X (s₁,…, s_k) denote the number of cycles of length L of w(s₁,…, s_k). For fixed w and L, we show that X, viewed as a random variable on S_n^k, has (for n →∞) a Poisson-type limit distribution, which can be computed precisely. © 1994 John Wiley & Sons, Inc.     

Algebraic relations for reciprocal sums of odd terms in Fibonacci numbers

In this paper, we prove the algebraic independence of the reciprocal sums of odd terms in Fibonacci numbers ∑ _n=1^∞ F _2n−1⁻¹, ∑ _n=1^∞ F _2n−1⁻², ∑ _n=1^∞ F _2n−1⁻³ and write each ∑ _n=1^∞ F _2n−1^−s (s≥4) as an explicit rational function of these three numbers over ℚ. Similar results are obtained for various series including the reciprocal sums of odd terms in Lucas numbers.      

Joint ergodicity and mixing

The study of jointly ergodic measure preserving transformations of probability spaces, begun in [1], is continued, and notions of joint weak and strong mixing are introduced. Various properties of ergodic and mixing transformations are shown to admit analogues for several transformations. The case of endomorphisms of compact abelian groups is particularly emphasized. The main result is that, given such commuting endomorphisms σ₁σ₂,...,σ, ofG, the sequence ((1/N)Σ _n=0 ^N−1 σ ₁ ⁿ f ¹·σ ₂ ⁿ f ²· ··· · σ _s ⁿ f ^sconverges inL ²(G) for everyf ₁,f ₂,…,f _s∈L ^∞(G). If, moreover, the endomorphisms are jointly ergodic, i.e., if the limit of any sequence as above is Π _i=1 ^s ∫ _G f ₁ d μ, where μ is the Haar measure, then the convergence holds also μ-a.e.     

On the growth of an entire dirichlet series

We establish the relation between the increase of the quantityM(σ,F) = ∣a ₀∣ + ∑ _n=1 ^∞ ∣a _n ∣ exp (σλ _n ) and the behavior of sequences (|a _n |) and (λ _n ), where (λ _n ) is a sequence of nonnegative numbers increasing to + ∞, andF(s) =a ₀ + ∑ _n=1 ^∞ a _n e ^sλn ,s=σ+it, is the Dirichlet entire series. Lviv University, Lviv. Translated from Ukrainskii Matematicheskii Zhurmal, Vol. 51, No. 8, pp. 1149–1153, August, 1999.     

Perturbation Analysis for the Eigenvalue Problem of a Formal Product of Matrices

We study the perturbation theory for the eigenvalue problem of a formal matrix product A ₁ ^{s 1} ··· A _p ^{s p}, where all A _k are square and s _k {–1, 1}. We generalize the classical perturbation results for matrices and matrix pencils to perturbation results for generalized deflating subspaces and eigenvalues of such formal matrix products. As an application we then extend the structured perturbation theory for the eigenvalue problem of Hamiltonian matrices to Hamiltonian/skew-Hamiltonian pencils.     

Solvability of elliptic functional-differential equations with compressions of the arguments in weighted spaces

In the paper, the equation

A random construction for permutation codes and the covering radius

We analyse a probabilistic argument that gives a semi-random construction for a permutation code on n symbols with distance n − s and size Θ(s!(log n)^1/2), and a bound on the covering radius for sets of permutations in terms of a certain frequency parameter.      

Sets of rigged paths with Virasoro characters

Let {M _r,s ^(p,p′)}_{1≤r≤p−1,1≤s≤p′−1} be the irreducible Virasoro modules in the (p,p′)-minimal series. In our previous paper, we have constructed a monomial basis of ⊕ _r=1 ^p−1 M _r,s ^(p,p′) in the case 1<p′/p<2. By ‘monomials’ we mean vectors of the form , where φ _−n ^(r′,r):M _r,s ^(p,p′)→M _r′,s ^(p,p′) are the Fourier components of the (2,1)-primary field and |r ₀,s〉 is the highest weight vector of . In this article, we introduce for all p<p′ with p≥3 and s=1 a subset of such monomials as a conjectural basis of ⊕ _r=1 ^p−1 M _r,1^(p,p′). We prove that the character of the combinatorial set labeling these monomials coincides with the character of the corresponding Virasoro module. We also verify the conjecture in the case p=3.      

On linguistic dynamical systems,families of graphs of large girth,and cryptography

The paper is devoted to the study of a linguistic dynamical system of dimension n ≥ 2 over an arbitrary commutative ring K, i.e., a family F of nonlinear polynomial maps f _α : K ⁿ → K ⁿ depending on “time” α ∈ {K − 0} such that f _α ⁻¹ = f _−αM, the relation f _α1 (x) = f _α2 (x) for some x ∈ Kⁿ implies α₁ = α₂, and each map f _α has no invariant points. The neighborhood {f _α (υ)∣α ∈ K − {0}} of an element v determines the graph Γ(F) of the dynamical system on the vertex set Kⁿ. We refer to F as a linguistic dynamical system of rank d ≥ 1 if for each string a = (α₁, υ, α₂), s ≤ d, where α_i + α_i+1 is a nonzero divisor for i = 1, υ, d − 1, the vertices υ _a = f _α1 × ⋯ × f _αs (υ) in the graph are connected by a unique path. For each commutative ring K and each even integer n ≠= 0 mod 3, there is a family of linguistic dynamical systems L_n(K) of rank d ≥ 1/3n. Let L(n, K) be the graph of the dynamical system L_n(q). If K = F_q, the graphs L(n, F_q) form a new family of graphs of large girth. The projective limit L(K) of L(n, K), n → ∞, is well defined for each commutative ring K; in the case of an integral domain K, the graph L(K) is a forest. If K has zero divisors, then the girth of K drops to 4. We introduce some other families of graphs of large girth related to the dynamical systems L_n(q) in the case of even q. The dynamical systems and related graphs can be used for the development of symmetric or asymmetric cryptographic algorithms. These graphs allow us to establish the best known upper bounds on the minimal order of regular graphs without cycles of length 4n, with odd n ≥ 3. Bibliography: 42 titles. Published in Zapiski Nauchnykh Seminarov POMI, Vol. 326, 2005, pp. 214–234.     

Are the degrees of best (co)convex and unconstrained polynomial approximation the same?

Let ℂ[−1,1] be the space of continuous functions on [−,1], and denote by Δ² the set of convex functions f ∈ ℂ[−,1]. Also, let E _n (f) and E _n ⁽²⁾ (f) denote the degrees of best unconstrained and convex approximation of f ∈ Δ² by algebraic polynomials of degree < n, respectively. Clearly, En (f) ≦ E _n ⁽²⁾ (f), and Lorentz and Zeller proved that the inverse inequality E _n ⁽²⁾ (f) ≦ cE _n (f) is invalid even with the constant c = c(f) which depends on the function f ∈ Δ². In this paper we prove, for every α > 0 and function f ∈ Δ², that