Classification of framed links in 3-manifolds

We present a short and complete proof of the following Pontryagin theorem, whose original proof was complicated and has never been published in detail. Let M be a connected oriented closed smooth 3-manifold, L ₁(M) be the set of framed links in M up to a framed cobordism, and deg: L ₁(M) → H ₁(M; ℤ) be the map taking a framed link to its homology class. Then for each α ∈ H ₁(M; ℤ) there is a one-to-one correspondence between the set deg⁻¹ α and the group ℤ_2d(α), where d(α) is the divisibility of the projection of α to the free part of H ₁(M; ℤ).     

Moments and Distribution of the Local Times of a Transient Random Walk on ℤ d

Consider an arbitrary transient random walk on ℤ ^d with d∈ℕ. Pick α∈[0,∞), and let L _n (α) be the spatial sum of the αth power of the n-step local times of the walk. Hence, L _n (0) is the range, L _n (1)=n+1, and for integers α, L _n (α) is the number of the α-fold self-intersections of the walk. We prove a strong law of large numbers for L _n (α) as n→∞. Furthermore, we identify the asymptotic law of the local time in a random site uniformly distributed over the range. These results complement and contrast analogous results for recurrent walks in two dimensions recently derived by Černy (Stoch. Proc. Appl. 117:262–270, 2007). Although these assertions are certainly known to experts, we could find no proof in the literature in this generality.      

More-Than-Nearly-Perfect Packings and Partial Designs

o (n) of the n vertices. Here we show, in particular, that regular uniform hypergraphs for which the ratio of degree to maximum codegree is , for some ɛ>0, have packings which cover all but vertices, where α=α(ɛ)>0. The proof is based on the analysis of a generalized version of R?dl's nibble technique. We apply the result to the problem of finding partial Steiner systems with almost enough blocks to be Steiner systems, where we prove that, for fixed positive integers t<k, there exist partial S(t,k,n)'s with at most uncovered t-sets, improving the earlier result. Received: September 23, 1994/Revised: November 14, 1996     

Quadratically Hyponormal Recursively Generated Weighted Shifts Need Not Be Positively Quadratically Hyponormal

We study a class of weighted shifts W _α defined by a recursively generated sequence α ≡ α₀, … , α _m−2, (α _m−1, α _m , α _m+1)^∧ and characterize the difference between quadratic hyponormality and positive quadratic hyponormality. We show that a shift in this class is positively quadratically hyponormal if and only if it is quadratically hyponormal and satisfies a finite number of conditions. Using this characterization, we give a new proof of [12, Theorem 4.6], that is, for m = 2, W _α is quadratically hyponormal if and only if it is positively quadratically hyponormal. Also, we give some new conditions for quadratic hyponormality of recursively generated weighted shift W _α (m ≥ 2). Finally, we give an example to show that for m ≥ 3, a quadratically hyponormal recursively generated weighted shift W _α need not be positively quadratically hyponormal.     

On the pontryagin-steenrod-wu theorem

We present a short and direct proof (based on the Pontryagin-Thom construction) of the following Pontryagin-Steenrod-Wu theorem: (a) LetM be a connected orientable closed smooth (n + 1)-manifold,n≥3. Define the degree map deg: π ⁿ (M) →H ⁿ (M; ℤ) by the formula degf =f*[S ⁿ ], where [S ⁿ ] εH ⁿ (M; ℤ) is the fundamental class. The degree map is bijective, if there existsβ εH ₂(M, ℤ/2ℤ) such thatβ ·w ₂(M) ε 0. If suchβ does not exist, then deg is a 2-1 map; and (b) LetM be an orientable closed smooth (n+2)-manifold,n≥3. An elementα lies in the image of the degree map if and only ifρ ₂ α ·w ₂(M)=0, whereρ ₂: ℤ → ℤ/2ℤ is reduction modulo 2.     

Large Monotone Paths in Graphs with Bounded Degree

 We prove that for every ε>0 and positive integer r, there exists Δ₀=Δ₀(ε) such that if Δ>Δ₀ and n>n(Δ,ε,r) then there exists a packing of K _n with ⌊(n−1)/Δ⌋ graphs, each having maximum degree at most Δ and girth at least r, where at most εn ² edges are unpacked. This result is used to prove the following: Let f be an assignment of real numbers to the edges of a graph G. Let α(G,f) denote the maximum length of a monotone simple path of G with respect to f. Let α(G) be the minimum of α(G,f), ranging over all possible assignments. Now let α_Δ be the maximum of α(G) ranging over all graphs with maximum degree at most Δ. We prove that Δ+1≥α_Δ≥Δ(1−o(1)). This extends some results of Graham and Kleitman [6] and of Calderbank et al. [4] who considered α(K _n ). Received: March 15, 1999?Final version received: October 22, 1999     

Anisotropic young diagrams and jack symmetric functions

We study the Young lattice with the edge multiplicitiesϰ _α (λ, ⋏) arising in the simplest Pieri formula for Jack symmetric polynomialsP _λ (x; α) with parameter α. A new proof of Stanley’s α-version of the hook formula is given. We also prove the formula whereϕ(λ) = ∏ _b∈λ (a(b)α +l(b) + 1)⁻¹ andc _α(b) is the α-contents of the new boxb=⋏/λ. Partially supported by the Federal Grant Program “Integration,” No. 326.53, and by MSRI at Berkeley. St. Petersburg Division of the V. A. Steklov Mathematical Institute. Translated from Funksional’nyi Analiz i Ego Prilozheniya, Vol. 34, No. 1, pp. 51–64, January–March, 200. Translated by S. V. Kerov     

On the degree of continuity and smoothness of sine and cosine Fourier transforms of Lebesgue integrable functions

We consider complex-valued functions f∈L ¹(ℝ₊), where ℝ₊:=[0,∞), and prove sufficient conditions under which the sine Fourier transform [^(f)]_s\hat{f}_{s} and the cosine Fourier transform [^(f)]_c\hat{f}_{c} belong to one of the Lipschitz classes Lip (α) and lip (α) for some 0<α≦1, or to one of the Zygmund classes Zyg (α) and zyg (α) for some 0<α≦2. These sufficient conditions are best possible in the sense that they are also necessary if f(x)≧0 almost everywhere.     

Self-similar extremal processes

Given an extremal process X: [0,∞)→[0,∞)^d with lower curve C and associated point process N={(t_k, X_k):k≥0}, t_k distinct and X_k independent, given a sequence ζ _n =(τ _n , ξ _n ), n≥1, of time-space changes (max-automorphisms of [0,∞)^d+1), we study the limit behavior of the sequence of extremal processes Y_n(t)=ξ _n ^-1 ○ X ○ τ_n(t)=C_n(t) V max {ξ _n ^-1 ○ X_k: t_k ≤ τ_n(t){ ⇒ Y under a regularity condition on the norming sequence ζ_n and asymptotic negligibility of the max-increments of Y_n. The limit class consists of self-similar (with respect to a group η_α=(σ_α, L_α), α>0, of time-space changes) extremal processes. By self-similarity here we mean the property L_α ○ Y(t) ₌ ^d Y ○ α_α(t) for all α>0. The univariate marginals of Y are max-self-decomposable. If additionally the initial extremal process X is assumed to have homogeneous max-increments, then the limit process is max-stable with homogeneous max-increments. Supported by the Bulgarian Ministry of Education and Sciences (grant No. MM 234/1996). Proceedings of the Seminar on Stability Problems for Stochastic Models, Hajdúszoboszló, Hungary, 1997, Part I.     

A Hille–Yosida Type Theorem in Ordered Convex Cones

It is proved that the Laplace transform establishes a bijection between a class of resolvents (V_α)_α>0 and a class of semi-groups Φ of kernels, acting on an abstract ordered convex cone. The compactness (in some weak topology) of the closed convex envelopes of the trajectories: Φ(t, x), t > 0, resp. of (nV_n)^kx, n, k ∈ ȑ, plays a central role in these results.     

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.     

Quelques observations sur lesL 2-resolvantes

Cet article a deux parties. Dans la première nous allons étudier les normes des opérateurs d'uneL ²-résolvante. Dans la deuxième partie on va associer à chaqueL ²-résolvante (G _α)_α>0 un processus (f _α)_α>0 (l'idée de considérer ce processus appartient à I. Cuculescu). En ce qui concerne ce processus (f _α)_α>0 on va montrer que si (G _α)_α>0 est uneL ²-résolvante qui correspond à un espace de Dirichlet fortement régulier sur (E, ℬ, μ) oùE est un espace métrique compact, ℬ est le corp borélien engendré par les ouverts deE et μ est une probabilité (ou une mesure finie), alors l'ensemble des zeros de chaquef _α est un ensemble fermé avec l'intérieur vide.     

Various Slicing Indices on Banach Spaces

We give a short and direct proof for the computation of the Szlenk index of the C(K) spaces, when K is a countable compact space and determine their Lavrientiev indices. We also compute the Szlenk index of certain C(α) spaces, where α is an uncountable ordinal. Finally, we show that if the Szlenk index of a Banach space is ω (first infinite ordinal), then its weak*-dentability index is at most ω² and that this estimate is optimal. The first author was supported by the grants: Institutional Research Plan AV0Z10190503, A100190502, GA ČR 201/04/0090.     

Karhunen-Loève expansions of <Emphasis Type="Italic">α</Emphasis>-Wiener bridges

We study Karhunen-Loève expansions of the process(X _t ^(α)) _t∈[0,T) given by the stochastic differential equation $ dX_t^{(\alpha )} = - \frac{\alpha } {{T - t}}X_t^{(\alpha )} dt + dB_t ,t \in [0,T) $ dX_t^{(\alpha )} = - \frac{\alpha } {{T - t}}X_t^{(\alpha )} dt + dB_t ,t \in [0,T) , with the initial condition X ₀^(α) = 0, where α > 0, T ∈ (0, ∞), and (B _t )t≥0 is a standard Wiener process. This process is called an α-Wiener bridge or a scaled Brownian bridge, and in the special case of α = 1 the usual Wiener bridge. We present weighted and unweighted Karhunen-Loève expansions of X ^(α). As applications, we calculate the Laplace transform and the distribution function of the L ²[0, T]-norm square of X ^(α) studying also its asymptotic behavior (large and small deviation).     

Global behavior of the branch of positive solutions for nonlinear Sturm–Liouville problems

We consider the nonlinear Sturm–Liouville problem

Fourier Analysis of Semistable Distributions

We consider the generalized convolution powers G _α ^*u (x) of an arbitrary semistable distribution function G _α (x) of exponent α∈(0,2), and prove that for all j, k∈{0,1,2,…} and u>0 the derivatives G _α ^(k,j)(x;u)=∂ ^k+j G _α ^*u (x)/∂ x ^k ∂ u ^j , x∈ℝ, are of bounded variation on the whole real line ℝ. The proof, along with an integral recursion in j, is new even in the special case of stable laws, and the result provides a framework for possible asymptotic expansions in merge theorems from the domain of geometric partial attraction of semistable laws. An erratum to this article can be found at     

A limit theorem for random coverings of a circle

LetN _{α, m} equal the number of randomly placed arcs of length α (0<α<1) required to cover a circleC of unit circumferencem times. We prove that lim_α→0 P(N_α,m≦(1/α) (log (1/α)+mlog log(1/α)+x)=exp ((−1/(m−1)!) exp (−x)). Using this result for m=1, we obtain another derivation of Steutel's resultE(N_α,1)=(1/α) (log(1/α)+log log(1/α)+γ+o(1)) as α→0, γ denoting Euler's constant.     

Zeros in Tables of Characters for the Groups <Emphasis Type="Italic">S</Emphasis><Subscript>n</Subscript> and <Emphasis Type="Italic">A</Emphasis><Subscript>n</Subscript>. II

Let P(n) be the set of all partitions of a natural number n. In the representation theory of symmetric groups, for every partition α ∈ P(n), the partition h(α) ∈ P(n) is defined so as to produce a certain set of zeros in the character table for S_n. Previously, the analog f(α) of h(α) was obtained pointing out an extra set of zeros in the table mentioned. Namely, h(α) is greatest (under the lexicographic ordering ≤) of the partitions β of n such that χ^α(g_β) ≠ 0, and f(α) is greatest of the partitions γ of n that are opposite in sign to h(α) and are such that χ^α(g_γ) ≠ 0, where χ^α is an irreducible character of S_n, indexed by α, and g_β is an element in the conjugacy class of S_n, indexed by β. For α ∈ P(n), under some natural restrictions, here, we construct new partitions h′(α) and f′(α) of n possessing the following properties. (A) Let α ∈ P(n) and n ⩾ 3. Then h′(α) is identical is sign to h(α), χ^α(g_h′(α)) ≠ 0, but χ^α(g_γ) = 0 for all γ ∈ P(n) such that the sign of γ coincides with one of h(α), and h′(α) < γ < h(α). (B) Let α ∈ P(n), α ≠ α′, and n ⩾ 4. Then f′(α) is identical in sign to f(α), χ^α(g_f′(α)) ≠ 0, but χ^α(g_γ) = 0 for all γ ∈ P(n) such that the sign of γ coincides with one of f(α), and f′(α) < γ < f(α). The results obtained are then applied to study pairs of semiproportional irreducible characters in A_n. Supported by RFBR grant No. 04-01-00463. __________ Translated from Algebra i Logika, Vol. 44, No. 6, pp. 643–663, November–December, 2005.     

Asymptotic separation for independent trajectories of Markov processes

We say that n independent trajectories ξ₁(t),…,ξ _n (t) of a stochastic process ξ(t)on a metric space are asymptotically separated if, for some ɛ > 0, the distance between ξ _i (t _i ) and ξ _j (t _j ) is at least ɛ, for some indices i, j and for all large enough t ₁,…,t _n , with probability 1. We prove sufficient conitions for asymptotic separationin terms of the Green function and the transition function, for a wide class of Markov processes. In particular,if ξ is the diffusion on a Riemannian manifold generated by the Laplace operator Δ, and the heat kernel p(t, x, y) satisfies the inequality p(t, x, x) ≤ Ct ^−ν/2 then n trajectories of ξ are asymptotically separated provided . Moreover, if for some α∈(0, 2)then n trajectories of ξ^(α) are asymptotically separated, where ξ^(α) is the α-process generated by −(−Δ)^α/2. Received: 10 June 1999 / Revised version: 20 April 2000 / Published online: 14 December 2000 RID="*" ID="*" Supported by the EPSRC Research Fellowship B/94/AF/1782 RID="**" ID="**" Partially supported by the EPSRC Visiting Fellowship GR/M61573