Lecture

Cyclic Sequences: Counting and Equivalence

Description

This lecture covers the definition of linear sequences in an alphabet, the concept of equivalence relation for linear sequences, and the notion of cyclic sequences with periods. It explains how to count the number of linear and cyclic sequences of a certain length and period in an alphabet. The lecture also introduces the Mobius inversion formula for computing the total number of cyclic sequences. Examples and exercises are provided to illustrate the concepts and techniques discussed.

Official source

https://mediaspace.epfl.ch/media/0_3wvvka89

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Number theory: Topics in number theory

Related lectures (23)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.