The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We prove a quantitative version of a result of Furstenberg [20] and Deligne [14] stating that the diagonal of a multivariate algebraic power series with coefficients in a field of positive characteristic is algebraic. As a consequence, we obtain that for every prime the reduction modulo of the diagonal of a multivariate algebraic power series with integer coefficients is an algebraic power series of degree at most and height at most , where is an effective constant that only depends on...
In this article, we study the complexity of
drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equivalently generated by a
substitution over a countable alphabet of constant length, have
complexity functions equivalent to n(log2n)2 when n goes to
infinity.
Currently displaying 1 –
3 of
3