Related papers: Generalized wordlength patterns and strength

The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…

We introduce generalizations of powers and factor complexity via orbits of group actions. These generalizations include concepts like abelian powers and abelian complexity. It is shown that this notion of factor complexity cannot be used to…

Let X=(X^0,\mu,T) be an ergodic measure preserving system. For a natural number k we consider the averages (*) 1/N \sum_{n=1}^N \prod_{j=1}^k f_j(T^{n a_j}x) where the functions f_j are bounded, and a_j are integers. A factor of X is…

Users of program analyses expect that results change predictably in response to changes in their programs, but many analyses fail to provide such robustness. This paper introduces a theoretical framework that provides a unified language to…

We show that, if $w_1, \ldots , w_6$ are words which are not an identity of any (non-abelian) finite simple group, then $w_1(G)w_2(G) \cdots w_6(G) = G$ for all (non-abelian) finite simple groups $G$. In particular, for every word $w$,…

In this paper, we study the fibers of "automorphic word maps", a certain generalization of word maps, on finite groups and on nonabelian finite simple groups in particular. As an application, we derive a structural restriction on finite…

The research of developing a general methodology for the construction of good nonregular designs has been very active in the last decade. Recent research by Xu and Wong [Statist. Sinica 17 (2007) 1191--1213] suggested a new class of…

A factor $u$ of a word $w$ is a cover of $w$ if every position in $w$ lies within some occurrence of $u$ in $w$. A word $w$ covered by $u$ thus generalizes the idea of a repetition, that is, a word composed of exact concatenations of $u$.…

This paper proposes a new notion of typical sequences on a wide class of abstract alphabets (so-called standard Borel spaces), which is based on approximations of memoryless sources by empirical distributions uniformly over a class of…

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

The algebraic properties of formal power series, whose coefficients show factorial growth and admit a certain well-behaved asymptotic expansion, are discussed. It is shown that these series form a subring of $\mathbb{R}[[x]]$. This subring…

In this paper, we study the relation between periodicity of two-dimensional words and their abelian pattern complexity. A pattern $\cal{P}$ in $\mathbb{Z}^n$ is the set of all translations of some finite subset $F$ of $\mathbb{Z}^n$. An…

We define a new statistic on any Weyl group which we call the odd length and which reduces, for Weyl groups of types $A$, $B$, and $D$, the the statistics by the same name that have already been defined and studied in [10], [13], [14], and…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Several fundamental and closely interconnected issues related to factor models are reviewed and discussed: dynamic versus static loadings, rate-strong versus rate-weak factors, the concept of weakly common component recently introduced by…

We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…

A definition is offered of the factorial characters of the general linear group, the symplectic group and the orthogonal group in an odd dimensional space. It is shown that these characters satisfy certain flagged Jacobi-Trudi identities.…

Suppose that the finite group $G=AB$ is a mutually permutable product of two subgroups $A$ and $B$. By using Sylow numbers of $A$ and $B$, we present some new bounds of the $p$-length $l_p(G)$ of a $p$-solvable group $G$ and the nilpotent…

Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…

We propose a new unsupervised learning method for clustering a large number of time series based on a latent factor structure. Each cluster is characterized by its own cluster-specific factors in addition to some common factors which impact…