[图书][B] The joint spectral radius: theory and applications

R Jungers - 2009 - books.google.com
This monograph is based on the Ph. D. Thesis of the author [58]. Its goal is twofold: First, it
presents most researchwork that has been done during his Ph. D., or at least the part of the …

[图书][B] Mathematical thinking and problem solving

AH Schoenfeld, AH Sloane - 2016 - taylorfrancis.com
In the early 1980s there was virtually no serious communication among the various groups
that contribute to mathematics education--mathematicians, mathematics educators …

The ring of k-regular sequences

JP Allouche, J Shallit - Theoretical Computer Science, 1992 - Elsevier
The automatic sequence is the central concept at the intersection of formal language theory
and number theory. It was introduced by Cobham (1969, 1972), and has been extensively …

Recounting the rationals

N Calkin, HS Wilf - The American Mathematical Monthly, 2000 - Taylor & Francis
It is well known (indeed, as Paul Erdos might have said, every child knows) that the rationals
are countable. However, the standard presentations of this fact do not give an explicit …

[图书][B] Combinatorics, automata and number theory

V Berthé, M Rigo - 2010 - books.google.com
This collaborative volume presents recent trends arising from the fruitful interaction between
the themes of combinatorics on words, automata and formal language theory, and number …

Exact computation of joint spectral characteristics of linear operators

N Guglielmi, V Protasov - Foundations of Computational Mathematics, 2013 - Springer
We address the problem of the exact computation of two joint spectral characteristics of a
family of linear operators, the joint spectral radius (JSR) and the lower spectral radius (LSR) …

[图书][B] Combinatorics and number theory of counting sequences

I Mezo - 2019 - api.taylorfrancis.com
Combinatorics and Number Theory of Counting Sequences is an introduction to the theory
of finite set partitions and to the enumeration of cycle decompositions of permutations. The …

Numeration systems, linear recurrences, and regular sets

J Shallit - Information and Computation, 1994 - Elsevier
A numeration system based on a strictly increasing sequence of positive integers u 0= 1, u 1,
u 2,... expresses a non-negative integer n as a sum n=∑ ij= 0 aju j. In this case we say the …

Joint spectral characteristics of matrices: a conic programming approach

VY Protasov, RM Jungers, VD Blondel - SIAM Journal on Matrix Analysis and …, 2010 - SIAM
We propose a new method to compute the joint spectral radius and the joint spectral
subradius of a set of matrices. We first restrict our attention to matrices that leave a cone …

Efficient algorithms for deciding the type of growth of products of integer matrices

RM Jungers, V Protasov, VD Blondel - Linear Algebra and its Applications, 2008 - Elsevier
Efficient algorithms for deciding the type of growth of products of integer matrices Page 1
Linear Algebra and its Applications 428 (2008) 2296–2311 www.elsevier.com/locate/laa …