scholarly journals L systems of finite index

1977 ◽  
pp. 430-439 ◽  
Author(s):  
G. Rozenberg ◽  
D. Vermeir
Keyword(s):  
Finite Index ◽  
L Systems

On metalinear ETOL systems

1980 ◽  
Vol 3 (1) ◽  
pp. 15-36
Author(s):  
Grzegorz Rozenberg ◽  
Dirk Vermeir
Keyword(s):  
Finite Index ◽  
Closure Properties ◽  
Pumping Lemma ◽  
L Systems ◽  
Structural Characterizations

The concept of metalinearity in ETOL systems is investigated. Some structural characterizations, a pumping lemma and the closure properties of the resulting class of languages are established. Finally, some applications in the theory of L systems of finite index are provided.

Automorphisms of finite order of nilpotent groups II

2014 ◽  
Vol 51 (4) ◽  
pp. 547-555 ◽  
Author(s):  
B. Wehrfritz
Keyword(s):  
Nilpotent Group ◽  
Finite Order ◽  
Finite Index ◽  
Nilpotent Groups ◽  
Finitely Generated

Let G be a nilpotent group with finite abelian ranks (e.g. let G be a finitely generated nilpotent group) and suppose φ is an automorphism of G of finite order m. If γ and ψ denote the associated maps of G given by \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\gamma :g \mapsto g^{ - 1} \cdot g\phi and \psi :g \mapsto g \cdot g\phi \cdot g\phi ^2 \cdots \cdot \cdot g\phi ^{m - 1} for g \in G,$$ \end{document} then Gγ · kerγ and Gψ · ker ψ are both very large in that they contain subgroups of finite index in G.

Optimal Land Use Analysis Using Lindenmayer Grammars

2013 ◽  
Vol 8 (2) ◽  
pp. 163-175
Author(s):  
Urszula Żukowska ◽  
Grażyna Kalewska
Keyword(s):  
Land Use ◽  
Urban Development ◽  
Computer Program ◽  
L System ◽  
L Systems ◽  
The City

In today's world, when it is so important to use every piece of land for a particular purpose, both economically and ecologically, identifying optimal land use is a key issue. For this reason, an analysis of the optimal land use in a section of the city of Olsztyn, using the L-system Urban Development computer program, was chosen as the aim of this paper. The program uses the theories of L-systems and the cartographic method to obtain results in the form of sequences of productions or maps. For this reason, the first chapters outline both theories, i.e. the cartographic method to identify optimal land use and Lindenmayer grammars (called L-systems). An analysis based on a fragment of the map of Olsztyn was then carried out. Two functions were selected for the analysis: agricultural and forest-industrial. The results are presented as maps and sequences in individual steps.

On locally graded barely transitive groups

2013 ◽  
Vol 11 (7) ◽  
Author(s):  
Cansu Betin ◽  
Mahmut Kuzucuoğlu
Keyword(s):  
Finite Index ◽  
Cyclic Subgroup ◽  
Transitive Group ◽  
Transitive Groups ◽  
Point Stabilizer

AbstractWe show that a barely transitive group is totally imprimitive if and only if it is locally graded. Moreover, we obtain the description of a barely transitive group G for the case G has a cyclic subgroup 〈x〉 which intersects non-trivially with all subgroups and for the case a point stabilizer H of G has a subgroup H 1 of finite index in H satisfying the identity χ(H 1) = 1, where χ is a multi-linear commutator of weight w.

scholarly journals Multidimensional Multiplicative Combinatorial Properties of Dynamical Syndetic Sets

2021 ◽  
Author(s):  
Jiahao Qiu ◽  
Jianjie Zhao
Keyword(s):  
Normal Subgroup ◽  
Finite Index ◽  
Minimal System ◽  
Combinatorial Properties ◽  
Return Times ◽  
Residual Set ◽  
Closed Sets ◽  
Open Set ◽  
Geometric Progressions ◽  
Set Of Points

AbstractIn this paper, it is shown that for a minimal system (X, G), if H is a normal subgroup of G with finite index n, then X can be decomposed into n components of closed sets such that each component is minimal under H-action. Meanwhile, we prove that for a residual set of points in a minimal system with finitely many commuting homeomorphisms, the set of return times to any non-empty open set contains arbitrarily long geometric progressions in multidimension, extending a previous result by Glasscock, Koutsogiannis and Richter.

Information Retrieval Systems, an Algebraic Approach I1

1981 ◽  
Vol 4 (3) ◽  
pp. 551-603
Author(s):  
Zbigniew Raś
Keyword(s):  
Information Retrieval ◽  
Boolean Algebra ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Algebraic Approach ◽  
Partially Ordered ◽  
Retrieval Systems ◽  
Information Retrieval Systems ◽  
Present Part ◽  
L Systems

This paper is the first of the three parts of work on the information retrieval systems proposed by Salton (see [24]). The system is defined by the notions of a partially ordered set of requests (A, ⩽), the set of objects X and a monotonic retrieval function U : A → 2X. Different conditions imposed on the set A and a function U make it possible to obtain various classes of information retrieval systems. We will investigate systems in which (A, ⩽) is a partially ordered set, a lattice, a pseudo-Boolean algebra and Boolean algebra. In my paper these systems are called partially ordered information retrieval systems (po-systems) lattice information retrieval systems (l-systems); pseudo-Boolean information retrieval systems (pB-systems) and Boolean information retrieval systems (B-systems). The first part concerns po-systems and 1-systems. The second part deals with pB-systems and B-systems. In the third part, systems with a partial access are investigated. The present part discusses the method for construction of a set of attributes. Problems connected with the selectivity and minimalization of a set of attributes are investigated. The characterization and the properties of a set of attributes are given.

Sign in / Sign up

Export Citation Format

Share Document