The structure of invertible substitutions on a three-letter alphabet

We study the structure of invertible substitutions on three-letter alphabet. We show that there exists a finite set of invertible substitutions such that any invertible substitution can be written as I_wσ₁σ₂σ_k, where I_w is the inner automorphism associated with w, and for 1jk. As a consequence, M is the matrix of an invertible substitution if and only if it is a finite product of non-negative elementary matrices.     

Incompatibility networks as models of scale-free small-world graphs

We make a mapping from Sierpinski fractals to a new class of networks, the incompatibility networks, which are scale-free, small-world, disassortative, and maximal planar graphs. Some relevant characteristics of the networks such as degree distribution, clustering coefficient, average path length, and degree correlations are computed analytically and found to be peculiarly rich. The method of network representation can be applied to some real-life systems making it possible to study the complexity of real networked systems within the framework of complex network theory.     

Computing the partial word avoidability indices of ternary patterns

We study pattern avoidance in the context of partial words. The problem of classifying the avoidable binary patterns has been solved, so we move on to ternary and more general patterns. Our results, which are based on morphisms (iterated or not), determine all the ternary patternsʼ avoidability indices or at least give bounds for them.     

Recursive weighted treelike networks

We propose a geometric growth model for weighted scale-free networks, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks, which are partially determined by the parameters. Analytical results indicate that the resulting networks have power-law distributions of degree, strength, weight and betweenness, a scale-free behavior for degree correlations, logarithmic small average path length and diameter with network size. The obtained properties are in agreement with empirical data observed in many real-life networks, which shows that the presented model may provide valuable insight into the real systems.     

Marcus contextual languages consisting of primitive words

In this paper we prove that the language of all primitive (strongly primitive) words over a nontrivial alphabet can be generated by certain types of Marcus contextual grammars.     

Characterization of complex networks by higher order neighborhood properties

A concept of higher order neighborhood in complex networks, introduced previously [Phys. Rev. E 73, 046101 (2006)], is systematically explored to investigate larger scale structures in complex networks. The basic idea is to consider each higher order neighborhood as a network in itself, represented by a corresponding adjacency matrix, and to settle a plenty of new parameters in order to obtain a best characterization of the whole network. Usual network indices are then used to evaluate the properties of each neighborhood. The identification of high order neighborhoods is also regarded as intermediary step towards the evaluation of global network properties, like the diameter, average shortest path between node, and network fractal dimension. Results for a large number of typical networks are presented and discussed.     

Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems

In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigzag inequalities because they cut off fractional solutions containing a zigzag associated with variables with 0.5 value. Two different types of inequalities, the Odd Zigzag and the Even Zigzag inequalities, are presented. Finally, their application to other known Arc Routing Problems is discussed.     

Another class of balanced graph designs: balanced circuit designs

A block considered as a set of elements together with its adjacency matrix A is called a C-block if A is the adjacency matrix of a circuit. A balanced circuit design with parameters v, b, r, k, λ (briefly, BCD(v, k, λ)) is an arrangement of v elements into bC-blocks such that each C-block contains k elements, each element occurs in exactly rC-blocks and any two distinct elements are linked in exactly λ C-blocks.We investigate conditions for the existence of BCD and show, in particular, that if the block-size k ? 6 and the trivial necessary conditions are satisfied, then the corresponding BCD exists.     

On the lifetime behavior of a discrete time shock model

In this article, we study a shock model in which the shocks occur according to a binomial process, i.e. the interarrival times between successive shocks follow a geometric distribution with mean 1/p$1/p$. According to the model, the system fails when the time between two consecutive shocks is less than a prespecified level. This is the discrete time version of the so-called δ$\delta$-shock model which has been previously studied for the continuous case. We obtain the probability mass function and probability generating function of the system’s lifetime. We also present an extension of the results to the case where the shock occurrences are dependent in a Markovian fashion.