Log-convex and Stieltjes moment sequences

We show that Stieltjes moment sequences are infinitely log-convex, which parallels a famous result that (finite) Pólya frequency sequences are infinitely log-concave. We introduce the concept of q-Stieltjes moment sequences of polynomials and show that many well-known polynomials in combinatorics are such sequences. We provide a criterion for linear transformations and convolutions preserving Stieltjes moment sequences. Many well-known combinatorial sequences are shown to be Stieltjes moment sequences in a unified approach and therefore infinitely log-convex, which in particular settles a conjecture of Chen and Xia about the infinite log-convexity of the Schröder numbers. We also list some interesting problems and conjectures about the log-convexity and the Stieltjes moment property of the (generalized) Apéry numbers.     

Suballowable sequences and geometric permutations

We define suballowable sequences of permutations as a generalization of allowable sequences. We give a characterization of allowable sequences in the class of suballowable sequences, prove a Helly-type result on sets of permutations which form suballowable sequences, and show how suballowable sequences are related to problems of geometric realizability. We discuss configurations of points and geometric permutations in the plane. In particular, we find a characterization of pairwise realizability of planar geometric permutations, give two necessary conditions for realizability of planar geometric permutations, and show that these conditions are not sufficient.     

Further discrepancy bounds and an Erdös–Turán–Koksma inequality for hybrid sequences

We consider hybrid sequences, that is, sequences in a multidimensional unit cube that are composed from lower-dimensional sequences of two different types. We establish nontrivial deterministic discrepancy bounds for five kinds of hybrid sequences as well as a new version of the Erdös–Turán–Koksma inequality which is suitable for hybrid sequences.     

Sum and direct sum of frame sequences

Casazza, Han and Larson characterized various properties of the direct sum of two frame sequences. We add characterizations of other properties and study the relationship between the direct sum and the sum of frame sequences. In particular, we find a necessary and sufficient condition for the sum of two strongly disjoint (orthogonal) frame sequences (in the same Hilbert space) to be a frame sequence, and thereby show that the sum of two strongly disjoint frame sequences may not be a frame sequence. We also show that the closedness of the sum of the synthesis operators of two frame sequences and that of the sum of the frame operators of the same frame sequences are not related. Other observations are also included.     

Relations on generalized degree sequences

We study degree sequences for simplicial posets and polyhedral complexes, generalizing the well-studied graphical degree sequences. Here we extend the more common generalization of vertex-to-facet degree sequences by considering arbitrary face-to-flag degree sequences. In particular, these may be viewed as natural refinements of the flag f-vector of the poset. We investigate properties and relations of these generalized degree sequences, proving linear relations between flag degree sequences in terms of the composition of rank jumps of the flag. As a corollary, we recover an f-vector inequality on simplicial posets first shown by Stanley.     

Catalan-like number sequences and Hausdorff moment sequences

Many well-known Catalan-like sequences turn out to be Stieltjes moment sequences (Liang et al. (2016)). However, a Stieltjes moment sequence is in general not determinate; Liang et al. suggested a further analysis about whether these moment sequences are determinate and how to obtain the associated measures. In this paper we find necessary conditions for a Catalan-like sequence to be a Hausdorff moment sequence. As a consequence, we will see that many well-known counting coefficients, including the Catalan numbers, the Motzkin numbers, the central binomial coefficients, the central Delannoy numbers, are Hausdorff moment sequences. We can also identify the smallest interval including the support of the unique representing measure. Since Hausdorff moment sequences are determinate and a representing measure for above mentioned sequences are already known, we could almost complete the analysis raised by Liang et al. In addition, subsequences of Catalan-like number sequences are also considered; we will see a necessary and sufficient condition for subsequences of Stieltjes Catalan-like number sequences to be Stieltjes Catalan-like number sequences. We will also study a representing measure for a linear combination of consecutive terms in Catalan-like number sequences.     

Optimal transformations for scalar sequences

Summary We consider transformations which accelerate convergence in some specified classes of convergent sequences. As an asymptotic measure of acceleration we introduce the order of transformation. We find a sharp upper bound on the order and show the explicit form of transformations of maximal order. We consider also the efficiency of transformations for fast convergent sequences. As a special case we find that the Germain-Bonne version of Richardson extropolation has maximal order for linearly convergent sequences.     

扩展时间事件图的分析

本文研究了一类扩展时间事件图的分析问题，证明了系统的输出时间序列有三类．有限序列，准周期序列，近似于Dlogp q的序列．     

Kronecker–Halton sequences in Fp((X−1))

In this paper we investigate the distribution properties of hybrid sequences which are made by combining Halton sequences in the ring of polynomials and digital Kronecker sequences. We give a full criterion for the uniform distribution and prove results on the discrepancy of such hybrid sequences.     

Convergence of decreasing sequences of convex sets in nonreflexive Banach spaces

We consider nested sequences of linear or convex closed sets of the form arising in estimation and other inverse problems. We show that such sequences may fail to converge in any of the recently studied set convergences other than Mosco convergence. We also provide a positive result concerning the epislice convergence of related sequences of functions.Research partially supported by NSERC operating grants.     

Almost periodicity,finite automata mappings,and related effectiveness issues

We introduce a class of eventually almost periodic sequences where some suffix is almost periodic (i.e., uniformly recurrent). The class of generalized almost periodic sequences includes the class of eventually almost periodic sequences, and we prove this inclusion to be strict. We also prove that the class of eventually almost periodic sequences is closed under finite automata mappings and finite transductions. Moreover, we obtain an effective form of this result. In conclusion we consider some algorithmic questions related to the almost periodicity.     

Linear complexity profile of binary sequences with small correlation measure

Summary A high linear complexity profile is a desirable feature of sequences used for cryptographical purposes. For a given binary sequence we estimate its linear complexity profile in terms of the correlation measure, which was introduced by Mauduit and Sárk?zy. We apply this result to certain periodic sequences including Legendre sequences, Sidelnikov sequences and other sequences related to the discrete logarithm.     

The nature of convergence of the Fourier series for functions of bounded variation

We study increasing sequences of positive integers that divide the Fourier series of functions of bounded variation into blocks of absolutely convergent series. We obtain a new version of the stability theorem for such sequences.     

Pseudo Leja sequences

We study pseudo Leja sequences attached to a compact set in the complex plane. The requirements are weaker than those of ordinary Leja sequences, but these sequences still provide excellent points for interpolation of analytic functions and their computation is much easier. We also apply them to the construction of excellent sets of nodes for multivariate interpolation of analytic functions on product sets.     

Similarity analysis of DNA sequences based on the EMD method

DNA sequences can be translated into 2D graphs and into numerical sequences; we call the numerical sequences nonlinear signal sequences. We can use the empirical mode decomposition (EMD) method to divide nonlinear signal sequences into a group of well-behaved intrinsic mode functions (IMFs) and a residue, so that we can compare the similarities among DNA sequences conveniently and intuitively. This work tests the method’s suitability by using the mitochondria of four different species.     

On Discrete Limits of Sequences of Approximately Continuous Functions and tae-Continuous Functions

We show that the classes of all discrete limits of sequences of ap- proximately continuous functions, of all discrete limits of sequences of derivatives and of all discrete limits of sequences of Baire 1 functions are the same. We describe also the discrete limits of sequences of quasicontinuous functions, and of sequences of almost everywhere continuous functions, and we present anec- essary condition which must be satisfied by the discrete limits of sequences of T_ae -continuous functions.     

About computation of the linear complexity of generalized cyclotomic sequences with period p n+1

We propose a computation method for linear complexity of series of generalized cyclotomic sequences with period p ⁿ⁺¹. This method is based on using the polynomial of the classic cyclotomic sequences of period p. We found the linear complexity of generalized cyclotomic sequences corresponding to the classes of biquadratic residues and Hall sequences.     

Coherent sequences versus Radin sequences

We attempt to make a connection between the sequences of measures used to define Radin forcing and the coherent sequences of extenders which are the basis of modern inner model theory. We show that in certain circumstances we can read off sequences of measures as defined by Radin from coherent sequences of extenders, and that we can define Radin forcing directly from a coherent extender sequence and a sequence of ordinals; this generalises Mitchell's construction of Radin forcing from a coherent sequence of measures.     

Nonlinear deterministic structures and the randomness of protein sequences

To clarify the randomness of protein sequences, we make a detailed analysis of a set of typical protein sequences representing each structural classes by using nonlinear prediction method. No deterministic structures are found in these protein sequences and this implies that they behave as random sequences. We also give an explanation to the controversial results obtained in previous investigations.     

Restricting statistical convergence

We first introduce a new notion called statistical convergence of order α and primarily show that it gives rise to a decreasing chain of closed linear subspaces of the space of all bounded real sequences with sup norm which never coincides with the class of convergent sequences and in fact their intersection properly contains the class of convergent sequences. We then show that the same method can be applied for double sequences also and introduce the notion of statistical convergence of order (α,β).