Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Generalized Artin-Schreier polynomials  [PDF]
Natalio H. Guersenzvaig,Fernando Szechtman
Mathematics , 2013,
Abstract: Let $F$ be a field of prime characteristic $p$ containing $F_{p^n}$ as a subfield. We refer to $q(X)=X^{p^n}-X-a\in F[X]$ as a generalized Artin-Schreier polynomial. Suppose that $q(X)$ is irreducible and let $C_{q(X)}$ be the companion matrix of $q(X)$. Then $ad\, C_{q(X)}$ has such highly unusual properties that any $A\in{\mathfrak{ gl}}(m)$ such that $ad\, A$ has like properties is shown to be similar to the companion matrix of an irreducible generalized Artin-Schreier polynomial. We discuss close connections with the decomposition problem of the tensor product of indecomposable modules for a 1-dimensional Lie algebra over a field of characteristic $p$, the problem of finding an explicit primitive element for every intermediate field of the Galois extension associated to an irreducible generalized Artin-Schreier polynomial, and the problem of finding necessary and sufficient conditions for the irreducibility of a family of polynomials.
Group Codes and the Schreier matrix form  [PDF]
Kenneth M. Mackenthun Jr
Mathematics , 2011,
Abstract: In a group trellis, the sequence of branches that split from the identity path and merge to the identity path form two normal chains. The Schreier refinement theorem can be applied to these two normal chains. The refinement of the two normal chains can be written in the form of a matrix, called the Schreier matrix form, with rows and columns determined by the two normal chains. Based on the Schreier matrix form, we give an encoder structure for a group code which is an estimator. The encoder uses the important idea of shortest length generator sequences previously explained by Forney and Trott. In this encoder the generator sequences are shown to have an additional property: the components of the generators are coset representatives in a chain coset decomposition of the branch group B of the code. Therefore this encoder appears to be a natural form for a group code encoder. The encoder has a register implementation which is somewhat different from the classical shift register structure. This form of the encoder can be extended. We find a composition chain of the branch group B and give an encoder which uses coset representatives in the composition chain of B. When B is solvable, the generators are constructed using coset representatives taken from prime cyclic groups.
On invariant Schreier structures  [PDF]
Jan Cannizzo
Mathematics , 2013,
Abstract: Schreier graphs, which possess both a graph structure and a Schreier structure (an edge-labeling by the generators of a group), are objects of fundamental importance in group theory and geometry. We study the Schreier structures with which unlabeled graphs may be endowed, with emphasis on structures which are invariant in some sense (e.g. conjugation-invariant, or sofic). We give proofs of a number of "folklore" results, such as that every regular graph of even degree admits a Schreier structure, and show that, under mild assumptions, the space of invariant Schreier structures over a given invariant graph structure is very large, in that it contains uncountably many ergodic measures. Our work is directly connected to the theory of invariant random subgroups, a field which has recently attracted a great deal of attention.
On the complemented subspaces of the Schreier spaces  [PDF]
I. Gasparis,D. H. Leung
Mathematics , 1999,
Abstract: It is shown that the Schreier space X admits a set of continuum cardinality whose elements are mutually incomparable complemented subspaces spanned by subsequences of the natural Schauder basis of X.
Schreier graphs: transitivity and coverings  [PDF]
Paul-Henry Leemann
Mathematics , 2015,
Abstract: We give a characterization of isomorphisms between Schreier graphs in terms of the groups, subgroups and generating systems. This characterization may be thought as a graph analog of Mostow's rigidity theorem for hyperbolic manifolds. This allows us to give a transitivity criterion for Schreier graphs. Finally, we show that Tarski monsters satisfy a strong simplicity criterion.
Ergodic properties of boundary actions and Nielsen--Schreier theory  [PDF]
Rostislav Grigorchuk,Vadim A. Kaimanovich,Tatiana Nagnibeda
Mathematics , 2009,
Abstract: We study the basic ergodic properties (ergodicity and conservativity) of the action of an arbitrary subgroup $H$ of a free group $F$ on the boundary $\partial F$ with respect to the uniform measure. Our approach is geometrical and combinatorial, and it is based on choosing a system of Nielsen--Schreier generators in $H$ associated with a geodesic spanning tree in the Schreier graph $X=H\backslash F$. We give several (mod 0) equivalent descriptions of the Hopf decomposition of the boundary into the conservative and the dissipative parts. Further we relate conservativity and dissipativity of the action with the growth of the Schreier graph $X$ and of the subgroup $H$ ($\equiv$ cogrowth of $X$), respectively. We also construct numerous examples illustrating connections between various relevant notions.
Hierarchy of Protein Loop-Lock Structures: A New Server for the Decomposition of a Protein Structure into a Set of Closed Loops  [PDF]
Simon Kogan, Zakharia Frenkel, Oleg Kupervasser, Zeev Volkovich
Computational Molecular Bioscience (CMB) , 2013, DOI: 10.4236/cmb.2013.31001

HoPLLS (Hierarchy of protein loop-lock structures) (http://leah.haifa.ac.il/~skogan/Apache/mydata1/main.html) is a web server that identifies closed loops-a structural basis for protein domain hierarchy. The server is based on the loop-and-lock theory for structural organisation of natural proteins. We describe this web server, the algorithms for the decomposition of a 3D protein into loops and the results of scientific investigations into a structural “alphabet” of loops and locks.

Notes on the Schreier graphs of the Grigorchuk group  [PDF]
Yaroslav Vorobets
Mathematics , 2011,
Abstract: The paper is concerned with the space of the marked Schreier graphs of the Grigorchuk group and the action of the group on this space. In particular, we describe an invariant set of the Schreier graphs corresponding to the action on the boundary of the binary rooted tree and dynamics of the group action restricted to this invariant set.
Polynomials on Schreier's space  [PDF]
Manuel González,Joaquín M. Gutiérrez
Mathematics , 2000,
Abstract: We introduce a weakened version of the Dunford-Pettis property, and give examples of Banach spaces with this property. In particular, we show that every closed subspace of Schreier's space $S$ enjoys it. As an application, we characterize the weak polynomial convergence of sequences, show that every closed subspace of $S$ has the polynomial Dunford-Pettis property of Bistr\"om et al. and give other polynomial properties of $S$.
Groebner-Shirshov bases for Schreier extensions of groups  [PDF]
Yuqun Chen
Mathematics , 2008, DOI: 10.1080/00927870701869899
Abstract: In this paper, by using the Groebner-Shirshov bases, we give characterizations of the Schreier extensions of groups when the group is presented by generators and relations. An algorithm to find the conditions of a group to be a Schreier extension is obtained. By introducing a special total order, we obtain the structure of the Schreier extension by an HNN group.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.