Generalized Morse sequences

Summary A method for construction of almost periodic points in the shift space on two symbols is developed, and a necessary and sufficient condition is given for the orbit closure of such a point to be strictly ergodic. Points satisfying this condition are called generalized Morse sequences. The spectral properties of the shift operator in strictly ergodic systems arising from generalized Morse sequences are investigated. It is shown that under certain broad regularity conditions both the continuous and discrete parts of the spectrum are non-trivial. The eigenfunctions and eigenvalues are calculated. Using the results, given any subgroup of the group of roots of unity, a generalized Morse sequence can be constructed whose continuous spectrum is non-trivial and whose eigenvalue group is precisely the given group. New examples are given for almost periodic points whose orbit closure is not strictly ergodic.     

Generalized Davenport-Schinzel sequences

The extremal functionEx(u, n) (introduced in the theory of Davenport-Schinzel sequences in other notation) denotes for a fixed finite alternating sequenceu=ababa... the maximum length of a finite sequencev overn symbols with no immediate repetition which does not containu. Here (following the idea of J. Neetil) we generalize this concept for arbitrary sequenceu. We summarize the already known properties ofEx(u, n) and we present also two new theorems which give good upper bounds onEx(u _i ,n). We use these theorems to describe a wide class of sequencesu (linear sequences) for whichEx(u, n)=O(n). Both theorems are used for obtaining new superlinear upper bounds as well. We partially characterize linear sequences over three symbols. We also present several problems aboutEx(u, n).Supported by Deutsche Forschungsgemeinschaft, grant We 1265/2-1.     

Generalized Thue-Morse sequences of squares

We consider compact group generalizations T(n) of the Thue-Morse sequence and prove that the subsequence T(n ²) is uniformly distributed with respect to a measure gv that is absolutely continuous with respect to the Haar measure. The proof is based on a proper generalization of the Fourier based method of Mauduit and Rivat in their study of the sum-of-digits function of squares to group representations.     

Generalized renewal sequences and infinitely divisible lattice distributions

We introduce an increasing set of classes Γ_a (0?α?1) of infinitely divisible (i.d.) distributions on {0,1,2,…}, such that Γ₀ is the set of all compound-geometric distributions and Γ₁ the set of all compound-Poisson distributions, i.e. the set of all i.d. distributions on the non-negative integers. These classes are defined by recursion relations similar to those introduced by Katti [4] for Γ₁ and by Steutel [7] for Γ₀. These relations can be regarded as generalizations of those defining the so-called renewal sequences (cf. [5] and [2]). Several properties of i.d. distributions now appear as special cases of properties of the Γ_a'.     

Generalized Fermat, double Fermat and Newton sequences

In this paper, we discuss the relationship among the generalized Fermat, double Fermat, and Newton sequences. In particular, we show that every double Fermat sequence is a generalized Fermat sequence, and the set of generalized Fermat sequences, as well as the set of double Fermat sequences, is closed under term-by-term multiplication. We also prove that every Newton sequence is a generalized Fermat sequence and vice versa. Finally, we show that double Fermat sequences are Newton sequences generated by certain sequences of integers. An approach of symbolic dynamical systems is used to obtain congruence identities.     

Generalized statistical convergence and statistical core of double sequences

In this paper we extend the notion of A-statistical convergence to the （λ,μ）statistical convergence for double sequences x =（xjk）. We also determine some matrix transformations and establish some core theorems related to our new space of double sequences Sλ,μ.     

Generalized Levinson-Durbin sequences, binomial coefficients and autoregressive estimation

For a discrete time second-order stationary process, the Levinson-Durbin recursion is used to determine the coefficients of the best linear predictor of the observation at time k+1, given k previous observations, best in the sense of minimizing the mean square error. The coefficients determined by the recursion define a Levinson-Durbin sequence. We also define a generalized Levinson-Durbin sequence and note that binomial coefficients form a special case of a generalized Levinson-Durbin sequence. All generalized Levinson-Durbin sequences are shown to obey summation formulas which generalize formulas satisfied by binomial coefficients. Levinson-Durbin sequences arise in the construction of several autoregressive model coefficient estimators. The least squares autoregressive estimator does not give rise to a Levinson-Durbin sequence, but least squares fixed point processes, which yield least squares estimates of the coefficients unbiased to order 1/T, where T is the sample length, can be combined to construct a Levinson-Durbin sequence. By contrast, analogous fixed point processes arising from the Yule-Walker estimator do not combine to construct a Levinson-Durbin sequence, although the Yule-Walker estimator itself does determine a Levinson-Durbin sequence. The least squares and Yule-Walker fixed point processes are further studied when the mean of the process is a polynomial time trend that is estimated by least squares.     

Generalized genus sequences for misère octal games

Two approaches have been used to solve impartial games with misère play; genus theory, which has resulted in a number of results summarized in [2], and Sibert-Conway decomposition [9], which has been used to solve the octal game 0.77 (known as Kayles). The main aim of this paper is to publish (for the first time) the results archived in [1], extending genus theory beyond the applications to which it has previously been applied. In addition, we extend a result from [6] to misère play by adapting it to use the extended genus theory. The resulting theorems require extensive calculations to verify that their preconditions hold for any particular games. These calculations have been carried out by computer for all two-digit octal games. For many of these games, this has resulted in complete solutions. Complete solutions are presented for four games listed in [8] as unsolved. Received: September 2001     

Minimal polynomials of the modified de Bruijn sequences

It is well known that a de Bruijn sequence over has the minimal polynomial (x+1)^d, where 2^n-1+nd2ⁿ-1. We study the minimal polynomials of the modified de Bruijn sequences.     

Generalized inverses and the total stopping times of collatz sequences

Let f(n) be defined on the set N is even, and f(n)=3n+1 if nie: is odd. A well-known conjecture in number theory asserts that for every n the sequence of iterates eventually reaches the cycle (4,2,1). We recast the conjecture in terms of a denumerable Markov chain with transition matrix P. Assuming that (4,2,1) is the only cycle, but allowing for the possibility of unbounded trajectories, we establish the complete structure of a particular generalized inverse X of I?P and show that the entries of X describe the trajectories and "total stopping times" of integers n. Moreover, the infinite matrix X satisfies properties which, in the case of finite matrices, are the defining properties of the unique group generalized inverse (I?P)^#. The result extends to dynamical systems on ? consisting of points that are fixed, eventually fixed, or have unbounded trajectories. As a consequence, we obtain a generalized inverse that encodes the dynamics of such systems, and for cases in which known general criteria for the existence of (I?P)^# do not apply.     

Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts

A generalized Davenport-Schinzel sequence is one over a finite alphabet whose subsequences are not isomorphic to a forbidden subsequence σ. What is the maximum length of such a σ-free sequence, as a function of its alphabet size n? Is the extremal function linear or nonlinear? And what characteristics of σ determine the answers to these questions? It is known that such sequences have length at most n⋅²(α(n))^O(1), where α is the inverse-Ackermann function and the O(1) depends on σ.We resolve a number of open problems on the extremal properties of generalized Davenport-Schinzel sequences. Among our results:

1.

We give a nearly complete characterization of linear and nonlinear σ∈^?{a,b,c} over a three-letter alphabet. Specifically, the only repetition-free minimally nonlinear forbidden sequences are ababa and abcacbc.

2.

We prove there are at least four minimally nonlinear forbidden sequences.

3.

We prove that in many cases, doubling a forbidden sequence has no significant effect on its extremal function. For example, Nivasch?s upper bounds on alternating sequences of the form t(ab) and t(ab)a, for t?3, can be extended to forbidden sequences of the form t(aabb) and t(aabb)a.

4.

Finally, we show that the absence of simple subsequences in σ tells us nothing about σ?s extremal function. For example, for any t, there exists a σt avoiding ababa whose extremal function is Ω(n⋅²αt(n)).

Most of our results are obtained by translating questions about generalized Davenport-Schinzel sequences into questions about the density of 0-1 matrices avoiding certain forbidden submatrices. We give new and often tight bounds on the extremal functions of numerous forbidden 0-1 matrices.     

Generalized trace and modified dimension functions on ribbon categories

In this paper, we use topological techniques to construct generalized trace and modified dimension functions on ideals in certain ribbon categories. Examples of such ribbon categories naturally arise in representation theory where the usual trace and dimension functions are zero, but these generalized trace and modified dimension functions are nonzero. Such examples include categories of finite dimensional modules of certain Lie algebras and finite groups over a field of positive characteristic and categories of finite dimensional modules of basic Lie superalgebras over the complex numbers. These modified dimensions can be interpreted categorically and are closely related to some basic notions from representation theory.     

Generalized von Neumann–Kakutani transformation and random-start scrambled Halton sequences

It is a well-known fact that the Halton sequence exhibits poor uniformity in high dimensions. Starting with Braaten and Weller in 1979, several researchers introduced permutations to scramble the digits of the van der Corput sequences that make up the Halton sequence, in order to improve the uniformity of the Halton sequence. These sequences are called scrambled Halton, or generalized Halton sequences. Another significant result on the Halton sequence was the fact that it could be represented as the orbit of the von Neumann–Kakutani transformation, as observed by Lambert in 1982. In this paper, I will show that a scrambled Halton sequence can be represented as the orbit of an appropriately generalized von Neumann–Kakutani transformation. A practical implication of this result is that it gives a new family of randomized quasi-Monte Carlo sequences: random-start scrambled Halton sequences. This work generalizes random-start Halton sequences of Wang and Hickernell. Numerical results show that random-start scrambled Halton sequences can improve on the sample variance of random-start Halton sequences by factors as high as 7000.     

Modeling of non-stationary vibration signals based on the modified Kronecker sequences

The paper establishes a representation model for non-stationary random vibration signals based on the modified Kronecker sequences. The modified Kronecker sequence constructed via generalizing golden ratio is one of the special types of low discrepancy sequences which have better dimensional projections [1]. The actual modeling and simulation of non-stationary random data is more suitable for seismological signals and not for the vehicle vibrations [2, 3]. Under these circumstances, this paper presents a new algorithm for finding the modified Kronecker sequences in order to generate non-stationary vehicle vibration signals which mostly withhold the amplitude-frequency-time distribution of the sample signal. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)