# On a problem of arrangements

@article{Chowla1939OnAP,
title={On a problem of arrangements},
journal={Proceedings of the Indian Academy of Sciences - Section A},
year={1939},
volume={9},
pages={419-421}
}
• S. Chowla
• Published 1 May 1939
• Mathematics
• Proceedings of the Indian Academy of Sciences - Section A
109 Citations
De-Bruijn-Folgen und Zauberei
• Mathematische Semesterberichte
• 2020
De-Bruijn-Folgen in der Zauberkunst wurden bereits von mehreren Autoren vorgeschlagen und auch mit Erfolg auf der Bühne eingesetzt (siehe z. B. [ 2 , 4 , 11 ]). Insbesondere gibt es dazu einen
A Graph Joining Greedy Approach to Binary de Bruijn Sequences
• Computer Science
ArXiv
• 2020
An algorithm is proposed, named GPO algorithm, which includes all prior greedy algorithms as specific instances, excluding the application of the Fleury Algorithm on the de Bruijn graph, to produce all binary periodic sequences with nonlinear complexity greater than one.
The Greedy Gray Code Algorithm
We reinterpret classic Gray codes for binary strings, permutations, combinations, binary trees, and set partitions using a simple greedy algorithm. The algorithm begins with an initial object and an
An analysis of one-dimensional schelling segregation
• Economics
STOC '12
• 2012
This analysis is the first rigorous analysis of the Schelling dynamics of segregation in which a society of n individuals live in a ring and the average size of monochromatic neighborhoods in the final stable state is considered.
Maximal Complexity of Finite Words
• Mathematics
ArXiv
• 2010
The subword complexity of a finite word $w$ of length $N$ is a function which associates to each $n\le N$ the number of all distinct subwords of $w$ having the length $n$. We define the \emph{maximal
Properties of the complexity function for finite words
• Mathematics
• 2004
The subword complexity function $$p_{w}$$ of a finite word $$w$$ over a finite alphabet $$A$$ with $$\operatorname*{card}A=q\geq1$$ is defined by $$p_{w}(n)=\operatorname*{card}(F(w)\cap A^{n})$$ for
77.19 A problem in arrangements with adjacency restrictions
77.19 A problem in arrangements with adjacency restrictions Two recent articles in this journal [1,2] considered special cases of the following problem: "Given a random arrangement of n = n^ + nx +
We introduce $\delta$-cliffs, a generalization of permutations and increasing trees depending on a range map $\delta$. We define a first lattice structure on these objects and we establish general