نتایج جستجو برای: cyclically presented group

تعداد نتایج: 1563164  

Journal: :Annals of Pure and Applied Logic 2018

Journal: :Physical review research 2022

The interface separating a liquid from its vapor phase is diffuse; the composition varies continuously one to other over finite length. Recent experiments on dynamic jamming fronts in two dimensions [Waitukaitis et al., Europhys. Lett. 102, 44001 (2013)] identified diffuse between jammed and unjammed disks. In both cases, thickness of diverges as critical transition approached. We investigate g...

Journal: :IEEE Trans. Information Theory 2006
Hong Xu Wen-Feng Qi

Let a be an l-sequence generated by a feedback-with-carry shift register with connection integer q = pe, where p is an odd prime and e 1. Goresky and Klapper conjectured that when pe = 2 f5; 9; 11; 13g, all decimations of a are cyclically distinct. When e = 1 and p > 13, they showed that the set of distinct decimations is large and, in some cases, all deciamtions are distinct. In this article, ...

2010
R. S. STEVENS

Continuing after the previous papers of this series, attention is devoted to RR-systems having two towns (i.e., to compact 3-manifolds with spines corresponding to group presentations having two generators). An interesting kind of symmetry is noted and then used to derive some useful results. Specifically, the following theorems are proved: Theorem 1. Let tf> be a group presentation correspondi...

1997
Heinz H. Bauschke Jonathan M. Borwein

The convex feasibility problem, that is, finding a point in the intersection of finitely many closed convex sets in Euclidean space, arises in various areas of mathematics and physical sciences. It can be solved by the classical method of cyclic orthogonal projections, where, by projecting cyclically onto the sets, a sequence is generated that converges to a point in the intersection. In 1967, ...

Journal: :Eur. J. Comb. 2014
Marien Abreu Domenico Labbate Romeo Rizzi John Sheehan

A snark is a cubic cyclically 4–edge connected graph with edge chromatic number four and girth at least five. We say that a graph G is odd 2–factored if for each 2–factor F of G each cycle of F is odd. In this paper, we present a method for constructing odd 2–factored snarks. In particular, we construct two new odd 2–factored snarks that disprove a conjecture by some of the authors. Moreover, w...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید