Results 181 to 190 of about 6,017,875 (219)
Some of the next articles are maybe not open access.
Perturbations of Shifts of Finite Type
SIAM Journal on Discrete Mathematics, 1989Summary: Shifts of finite type describe the infinite trips on a labeled graph, and provide theoretical models for data storage and transmission. The consequences of forbidding a fixed word to occur, which can be considered as a small change or perturbation in the system, are investigated.
openaire +2 more sources
Chaos for Subshifts of Finite Type
Acta Mathematica Sinica, English Series, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Huo Yun, Xiong, Jin Cheng
openaire +1 more source
Results in Mathematics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kreuzer, Alexander, Sörensen, Kay
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kreuzer, Alexander, Sörensen, Kay
openaire +2 more sources
A characterisation of blocks of finite type
Archiv der Mathematik, 2014Let \(F\) be a field of characteristic \(p>0\), and let \(H\) be a cyclic \(p\)-subgroup of a finite group \(G\). Moreover, let \(W\) be the direct sum of all indecomposable \(FH\)-modules, and let \(M\) be the induced \(FG\)-module \(FG\otimes_{FH}W\).
openaire +2 more sources
Classification of Subshifts of Finite Type
The Annals of Mathematics, 1973Introduction 120 1. Definitions 122 2. Statement of results 126 3. Markov partitions and maps of 1-sided shifts 128 4. Existence and uniqueness of 1-sided shifts 132 5. Subdivision matrices and the proof of Theorems H and I ... 137 6. Ladder maps and conjugacies ........ 142 7. Shift equivalence = strong shift equivalence ......
openaire +1 more source
Projective Ideals of Finite Type
Canadian Journal of Mathematics, 1969The main results in this paper relate the concepts of flatness and projectiveness for finitely generated ideals in a commutative ring with unity. In this discussion the idea of a multiplicative ideal is used.Definition.An ideal Jis multiplicative if and only if whenever I is an ideal with I ⊂ J there exists an ideal Csuch that I = JC.Throughout this ...
openaire +1 more source
Finite-Type Invariants of Cubic Complexes
Acta Applicandae Mathematica, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matveev, S., Polyak, M.
openaire +2 more sources
Predicative recurrence in finite types
1994We consider the functionals defined using an extension to higher types of predicative recurrence, introduced in [Lei90b, BC92, Lei93b]. Three styles of predicative recurrence over a free algebra A are examined: equational recurrence, applicative programs with recurrence operators, and purely applicative higher-type programs.
openaire +1 more source
A note on equality in finite‐type arithmetic
Mathematical Logic Quarterly, 2017AbstractWe present a version of arithmetic in all finite types based on a systematic use of an internally definable notion of observational equivalence for dealing with equalities at higher types. For this system both intensional and extensional models are possible, the deduction theorem holds and the soundness of the Dialectica interpretation is ...
openaire +3 more sources
Quadrics of Coordinate Finite Type
2023 International Conference on Information Technology (ICIT), 2023Mohammad Al-kafaween +2 more
openaire +1 more source

