Sets Represented as the Length-n Factors of a Word

In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such subsets are represented by words of length t? For the first problem, we give upper and lower bounds of the form alpha^(2^n) in the binary case. For the second problem, we give a weak upper bound and some experimental data. For the third problem, we give a closed-form formula in the case where n <= t < 2n. Algorithmic variants of these problems have previously been studied under the name "shortest common superstring"

Shape computations without compositions

Parametric CAD supports design explorations through generative methods which compose and transform geometric elements. This paper argues that elementary shape computations do not always correspond to valid compositional shape structures. In many design cases generative rules correspond to compositional structures, but for relatively simple shapes and rules it is not always possible to assign a corresponding compositional structure of parts which account for all operations of the computation. This problem is brought into strong relief when design processes generate multiple compositions according to purpose, such as product structure, assembly, manufacture, etc. Is it possible to specify shape computations which generate just these compositions of parts or are there additional emergent shapes and features? In parallel, combining two compositions would require the associated combined computations to yield a valid composition. Simple examples are presented which throw light on the issues in integrating different product descriptions (i.e. compositions) within parametric CAD

On Quasiperiodic Morphisms

Weakly and strongly quasiperiodic morphisms are tools introduced to study quasiperiodic words. Formally they map respectively at least one or any non-quasiperiodic word to a quasiperiodic word. Considering them both on finite and infinite words, we get four families of morphisms between which we study relations. We provide algorithms to decide whether a morphism is strongly quasiperiodic on finite words or on infinite words.Comment: 12 page

The Kervaire-Laudenbach conjecture and presentations of simple groups

The statement ``no nonabelian simple group can be obtained from a nonsimple group by adding one generator and one relator" 1) is equivalent to the Kervaire--Laudenbach conjecture; 2) becomes true under the additional assumption that the initial nonsimple group is either finite or torsion-free. Key words: Kervaire--Laudenbach conjecture, relative presentations, simple groups, car motion, cocar comotion. AMS MSC: 20E32, 20F05, 20F06.Comment: 20 pages, 13 figure

On the local-indicability cohen–lyndon theorem

For a group H and a subset X of H, we let HX denote the set {hxh?1 | h ? H, x ? X}, and when X is a free-generating set of H, we say that the set HX is a Whitehead subset of H. For a group F and an element r of F, we say that r is Cohen–Lyndon aspherical in F if F{r} is a Whitehead subset of the subgroup of F that is generated by F{r}. In 1963, Cohen and Lyndon (D. E. Cohen and R. C. Lyndon, Free bases for normal subgroups of free groups, Trans. Amer. Math. Soc. 108 (1963), 526–537) independently showed that in each free group each non-trivial element is Cohen–Lyndon aspherical. Their proof used the celebrated induction method devised by Magnus in 1930 to study one-relator groups. In 1987, Edjvet and Howie (M. Edjvet and J. Howie, A Cohen–Lyndon theorem for free products of locally indicable groups, J. Pure Appl. Algebra 45 (1987), 41–44) showed that if A and B are locally indicable groups, then each cyclically reduced element of A*B that does not lie in A ? B is Cohen–Lyndon aspherical in A*B. Their proof used the original Cohen–Lyndon theorem. Using Bass–Serre theory, the original Cohen–Lyndon theorem and the Edjvet–Howie theorem, one can deduce the local-indicability Cohen–Lyndon theorem: if F is a locally indicable group and T is an F-tree with trivial edge stabilisers, then each element of F that fixes no vertex of T is Cohen–Lyndon aspherical in F. Conversely, by Bass–Serre theory, the original Cohen–Lyndon theorem and the Edjvet–Howie theorem are immediate consequences of the local-indicability Cohen–Lyndon theorem. In this paper we give a detailed review of a Bass–Serre theoretical form of Howie induction and arrange the arguments of Edjvet and Howie into a Howie-inductive proof of the local-indicability Cohen–Lyndon theorem that uses neither Magnus induction nor the original Cohen–Lyndon theorem. We conclude with a review of some standard applications of Cohen–Lyndon asphericit

Hubungan Karakteristik Petani dan Tingkat Adopsi Teknologi pada USAhatani Bawang Merah di Desa Tonsewer, Kecamatan Tompaso

This study aims to analyze the relationship between the characteristics of farmers with the level of adoption and application of technological innovation in onion farming in Tonsewer Village, Tompaso Subdistrict, Minahasa Regency, North Sulawesi Province. This research was conducted from February to March 2017. This research used primary and secondary data. Primary data were collected by interviewing onion farmers using questionnaires. Sampling of 48 people. Analysis method using Descriptive Analysis. The study found that the technological adoption rate in Tonsewer village is very high and has adopted the technology. Factors influencing the adoption rate are land area, farming, income, formal education, non-formal education, age, and cosmopolitan level. Spearman\u27s correlation value of land area, income, formal education, non-formal education and cosmopolitan level shows the direction of positive correlation, while age shows the direction of negative correlation to the adoption rate of onion technology

Groebner-Shirshov basis for HNN extensions of groups and for the alternating group

In this paper, we generalize the Shirshov's Composition Lemma by replacing the monomial order for others. By using Groebner-Shirshov bases, the normal forms of HNN extension of a group and the alternating group are obtained

Free subgroups of one-relator relative presentations

Suppose that G is a nontrivial torsion-free group and w is a word over the alphabet G\cup\{x_1^{\pm1},...,x_n^{\pm1}\}. It is proved that for n\ge2 the group \~G= always contains a nonabelian free subgroup. For n=1 the question about the existence of nonabelian free subgroups in \~G is answered completely in the unimodular case (i.e., when the exponent sum of x_1 in w is one). Some generalisations of these results are discussed.Comment: V3: A small correction in the last phrase of the proof of Theorem 1. 4 page