On some generalized sequence spaces of fuzzy numbers defined by a sequence of Orlicz functions

The purpose of the paper is to introduce the concepts of almost λ-statistical convergence and strongly almost λ-convergence of sequences of fuzzy numbers. We establish some connections between these concepts. It is also shown that if a sequence of fuzzy numbers is strongly almost λ-convergent with respect to a sequence of Orlicz funtions then it is almost λ-statistical convergent.     

Algebraic Independence of Reciprocal Sums of Binary Recurrences II

 Algebraic independence of the numbers for various d and l, where is a periodic sequence of algebraic numbers and is a sequence of integers satisfying a binary linear recurrence relation, is studied by Mahler’s method. Received 25 August 2000; in revised form 8 January 2002     

Sum-Difference Sequences and Catalan Numbers

 Let be a sequence of natural numbers > 1, and set . The sequence is called admissible if a _i divides for all i. It is known that the admissible sequences are counted by the Catalan numbers. We present a proof of this fact which, in turn, leads to some interesting combinatorial and number-theoretic questions.     

Good points for diophantine approximation

Given a sequence (x _n ) _n=1^∞ of real numbers in the interval [0, 1) and a sequence (δ _n ) _n=1^∞ of positive numbers tending to zero, we consider the size of the set of numbers in [0, 1] which can be ‘well approximated’ by terms of the first sequence, namely, those y ∈ [0, 1] for which the inequality |y − x _n | < δ _n holds for infinitely many positive integers n. We show that the set of ‘well approximable’ points by a sequence (x _n ) _n=1^∞, which is dense in [0, 1], is ‘quite large’ no matter how fast the sequence (δ _n ) _n=1^∞ converges to zero. On the other hand, for any sequence of positive numbers (δ _n ) _n=1^∞ tending to zero, there is a well distributed sequence (x _n ) _n=1^∞ in the interval [0, 1] such that the set of ‘well approximable’ points y is ‘quite small’.     

Inversive congruential generator over a Galois ring of dimension <Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">l</Emphasis></Superscript>

We consider the construction of of an inversive congruential generator over a Galois ring of odd dimension p ^l , whichwas proposed by Solé and Zinoviev for p = 2. Using the estimates of trigonometric sums on the sequences of pseudorandom numbers, we obtain the estimates of a discrepant function, a generated sequence of pseudorandom numbers, and the associated sequence of two-dimensional “overlapping” points.     

Prime and composite numbers as integer parts of powers

We study prime and composite numbers in the sequence of integer parts of powers of a fixed real number. We first prove a result which implies that there is a transcendental number ξ>1 for which the numbers [ξ^{n !}], n =2,3, ..., are all prime. Then, following an idea of Huxley who did it for cubics, we construct Pisot numbers of arbitrary degree such that all integer parts of their powers are composite. Finally, we give an example of an explicit transcendental number ζ (obtained as the limit of a certain recurrent sequence) for which the sequence [ζⁿ], n =1,2,..., has infinitely many elements in an arbitrary integer arithmetical progression. This revised version was published online in June 2006 with corrections to the Cover Date.     

Sum-Difference Sequences and Catalan Numbers

 Let be a sequence of natural numbers > 1, and set . The sequence is called admissible if a _i divides for all i. It is known that the admissible sequences are counted by the Catalan numbers. We present a proof of this fact which, in turn, leads to some interesting combinatorial and number-theoretic questions. Received 12 May 1997; in revised form 9 June 1997     

On the strong law of large numbers for sequences of random variables without the independence condition

New sufficient conditions for the applicability of the strong law of large numbers to a sequence of dependent random variables X ₁, X ₂, …, with finite variances are established. No particular type of dependence between the random variables in the sequence is assumed. The statement of the theorem involves the classical condition Σ _n ^∞ (log₂ n)²/n ² < ∞, which appears in various theorems on the strong law of large numbers for sequences of random variables without the independence condition.     

Suites de longueur minimale associees a un ensemble normal donne

For a given subsetA of the set of real numbers, we search a sequence Λ=(λ _n) of real numbers such that bothA is the normal setB(Λ) associated to Λ, and Λ takes its values in a bounded interval, with a minimal lengthM. A lower bound ofM is obtained, which gives some necessary conditions of existency of such a bounded sequence Λ. More details are given whenA is a subset of the set of integers. In this case, the problem is to find a polynomialQ of lowest degree such that the productP.Q has non-negative coefficients, for some special given polynomialP.      

A Note on Log-Convexity of q-Catalan Numbers

The q-Catalan numbers studied by Carlitz and Riordan are polynomials in q with nonnegative coefficients. They evaluate, at q = 1, to the Catalan numbers: 1, 1, 2, 5, 14,…, a log-convex sequence. We use a combinatorial interpretation of these polynomials to prove a q-log-convexity result. The sequence of q-Catalan numbers is not q-log-convex in the narrow sense used by other authors, so our work suggests a more flexible definition of q-log convex be adopted. Received January 2, 2007     

On Λ(p)-subsets of squares

This paper is a follow up of [B₁]. It is shown that the sequence of squares {n ²|n=1, 2, ...} contains Λ(p)-subsets of “maximal density”, for any givenp>4. The proof is based on the probabilistic method developed in [B₁] and a precise estimate of the Λ(p)-constant for the sequence of squares itself. Analogues of this phenomenon are obtained for other arithmetic sets, such as the sequence ofkth powers {n ^k |n=1, 2, ...} or the sequence of prime numbers. Sections 2 and 3 of the paper are of independent interest to orthogonal system theory.     

<Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>-invariants of Riemannian foliations

For a Riemannian foliation on a closed manifold M, we define L ²-spectral sequence Betti numbers and spectral sequence Novikov–Shubin invariants. The spectral sequence of the lift of to the universal covering of M is used in the definitions. These invariants are natural extensions of the L ²-Betti numbers and the Novikov–Shubin invariants of differentiable manifolds. It is shown that these numbers are invariant by foliated homotopy equivalences, and they are computed for several examples.      

First Observations on Prefab Posets’ Whitney Numbers

We introduce a natural partial order ≤ in structurally natural finite subsets of the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling-like numbers’ triangular array — are then calculated and the explicit formula for them is provided. Next — in the second construction — we endow the set sums of prefabiants with such an another partial order that their Bell-like numbers include Fibonacci triad sequences introduced recently by the present author in order to extend famous relation between binomial Newton coefficients and Fibonacci numbers onto the infinity of their relatives among whom there are also the Fibonacci triad sequences and binomial-like coefficients (incidence coefficients included). The first partial order is F-sequence independent while the second partial order is F-sequence dependent where F is the so-called admissible sequence determining cobweb poset by construction. An F-determined cobweb poset’s Hasse diagram becomes Fibonacci tree sheathed with specific cobweb if the sequence F is chosen to be just the Fibonacci sequence. From the stand-point of linear algebra of formal series these are generating functions which stay for the so-called extended coherent states of quantum physics. This information is delivered in the last section. Presentation (November 2006) at the Gian-Carlo Rota Polish Seminar .     

Computation of betti numbers of monomial ideals associated with cyclic polytopes

We give a combinatorial formula for the Betti numbers which appear in a minimal free resolution of the Stanley-Reisner ringk[Δ(P)]=A/I _Δ(P) of the boundary complex Δ(P) of an odd-dimensional cyclic polytopePover a fieldk. A corollary to the formula is that the Betti number sequence ofk[Δ(P)] is unimodal and does not depend on the base fieldk.     

Small deviations of the maximal element of a sequence of weighted independent random variables

Consider a sequence {X _i } of independent copies of a nonnegative random variable X and let M = sup _{j ≥ 1}λ _j X _j , where {λ _j } is a nonincreasing sequence of positive numbers for which P(M < ∞) = 1. The asymptotic behavior of -logP(M < r) as r → 0 is studied.     

Convergence of the median filterings of sequences

Suppose thatx=|x(n)|_n∈ℤ is a sequence of real numbers. For eachp∈ℕ,x ^p =|x ^p (n)|_n∈ℤis the resulting sequence ofx throughp times median filterings with window 2k+1. It is proved that whenp→∞, bothx ^(2p) andx(² p}-1) are convergent. Thus the problem of convergence of the median filters of infinite-length sequences is completely solved. Project supported by the National Natural Science Foundation of China (Grant No. 16971047).     

<Emphasis Type="Italic">p</Emphasis>-adic interpolation of Taylor coefficients of modular forms

In this paper we show that the Taylor coefficients of a Hecke eigenform at a CM-point, suitably modified, form a sequence of algebraic numbers that satisfy the Kubota–Leopoldt generalization of the Kummer congruences for primes that split in the imaginary quadratic field associated with a CM-point. More generally, we show that these numbers are moments of a certain p-adic measure. In addition, we write down explicitly the “Euler factor” at p in terms of the p th Hecke eigenvalue of the modular form in question and certain data of the CM-point. P. Guerzhoy is supported by NSF grant DMS-0700933.     

Discrepancy of Certain Kronecker Sequences Concerning Transcendental Numbers

Let ω1,..., ωs be a set of real transcendental numbers satisfying a certain Diophantine inequality. The upper bound for the discrepancy of the Kronecker sequence （{nω1},..., {nωs}）（1 ≤ n ≤ N） is given. In particular, some low-discrepancy sequences are constructed.     

Transcendence of Certain Reciprocal Sums of Linear Recurrences

 Suppose that {R _n } _n ⩾ 0 is a sequence of integers satisfying a binary linear recurrence relation with suitable conditions. We prove the transcendency of the numbers

On a Class of Vector-Valued Sequences Associated with Multiplier Sequences

In this article we introduce the vector valued sequence space m(E_k,φ,∧),associated with themultiplier sequence ∧=(λ_k) of non-zero complex numbers,and the terms of the sequence are chosen from theseminormed spaces E_k,seminormed by f_k for all k∈N.This generalizes the sequence space m(φ) introducedand studied by Sargent.We study some of its properties like solidity,completeness,and obtain some inclusionresults.We also characterize the multiplier problem and obtain the corresponding spaces dual to m(E_k,φ,∧).We prove some general results too.