Further Results on Pure Summing Registers and Complementary Ones

11/18/2020
by   Jianrui Xie, et al.
0

We decide completely the cycle structure of pure summing register (PSR) and complementary summing register (CSR). Based on the state diagram of CSR, we derive an algorithm to generate de Bruijn cycles from CSR inspired by Tuvi Etzion's publication in 1984. We then point out the limitation in generalizations of extended representation we use in the algorithm proposed, with a proof of the fact that only PSR and CSR contain pure cycles all dividing n+1.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2021

Complementary cycles of any length in regular bipartite tournaments

Let D be a k-regular bipartite tournament on n vertices. We show that, f...
research
11/15/2019

General Criteria for Successor Rules to Efficiently Generate Binary de Bruijn Sequences

We put forward new general criteria to design successor rules that gener...
research
01/06/2021

Transformation à la Foata for special kinds of descents and excedances

A pure excedance in a permutation π=π_1π_2…π_n is a position i<π_i such ...
research
04/25/2023

Is deep learning a useful tool for the pure mathematician?

A personal and informal account of what a pure mathematician might expec...
research
12/14/2017

Volume Optimal Cycle: Tightest representative cycle of a generator on persistent homology

This paper shows a mathematical formalization, algorithms and computatio...
research
08/23/2023

Demystifying our Grandparent's De Bruijn Sequences with Concatenation Trees

Some of the most interesting de Bruijn sequences can be constructed in s...
research
11/19/2012

Storing cycles in Hopfield-type networks with pseudoinverse learning rule: admissibility and network topology

Cyclic patterns of neuronal activity are ubiquitous in animal nervous sy...

Please sign up or login with your details

Forgot password? Click here to reset