Displaying 621 – 640 of 660

Showing per page

Drunken man infinite words complexity

Marion Le Gonidec (2008)

RAIRO - Theoretical Informatics and Applications

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.


Dualité de Langlands quantique

Vadim Schechtman (2014)

Annales de la faculté des sciences de Toulouse Mathématiques

Un survol des conjectures de Drinfeld, Beilinson, Gaitsgory et al. et de résultats de Gaitsgory sur la correspondance de Langlands quantique.

Duality triads of higher rank: Further properties and some examples

Matthias Schork (2006)

Open Mathematics

It is shown that duality triads of higher rank are closely related to orthogonal matrix polynomials on the real line. Furthermore, some examples of duality triads of higher rank are discussed. In particular, it is shown that the generalized Stirling numbers of rank r give rise to a duality triad of rank r.

Dualization in algebraic K-theory and the invariant e¹ of quadratic forms over schemes

Marek Szyjewski (2011)

Fundamenta Mathematicae

In the classical Witt theory over a field F, the study of quadratic forms begins with two simple invariants: the dimension of a form modulo 2, called the dimension index and denoted e⁰: W(F) → ℤ/2, and the discriminant e¹ with values in k₁(F) = F*/F*², which behaves well on the fundamental ideal I(F)= ker(e⁰). Here a more sophisticated situation is considered, of quadratic forms over a scheme and, more generally, over an exact category with duality. Our purposes are: ...

Durfee polynomials.

Canfield, E.Rodney, Corteel, Sylvie, Savage, Carla D. (1998)

The Electronic Journal of Combinatorics [electronic only]

Currently displaying 621 – 640 of 660