Search results for "Combinatorics"

showing 10 items of 1770 documents

On List Coloring with Separation of the Complete Graph and Set System Intersections

2022

We consider the following list coloring with separation problem: Given a graph $G$ and integers $a,b$, find the largest integer $c$ such that for any list assignment $L$ of $G$ with $|L(v)|= a$ for any vertex $v$ and $|L(u)\cap L(v)|\le c$ for any edge $uv$ of $G$, there exists an assignment $\varphi$ of sets of integers to the vertices of $G$ such that $\varphi(u)\subset L(u)$ and $|\varphi(v)|=b$ for any vertex $u$ and $\varphi(u)\cap \varphi(v)=\emptyset$ for any edge $uv$. Such a value of $c$ is called the separation number of $(G,a,b)$. Using a special partition of a set of lists for which we obtain an improved version of Poincar\'e's crible, we determine the separation number of the c…

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]FOS: Computer and information sciences[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]05C15 05C25Discrete Mathematics (cs.DM)FOS: MathematicsMathematics - CombinatoricsCombinatorics (math.CO)Computer Science - Discrete Mathematics
researchProduct

Asymptotic bit frequency in Fibonacci words

2021

It is known that binary words containing no $k$ consecutive 1s are enumerated by $k$-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length $n$ having this property.

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]FOS: Computer and information sciences[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Mathematics::CombinatoricsDiscrete Mathematics (cs.DM)[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsMathematics - CombinatoricsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Combinatorics (math.CO)[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

Counting Prefixes of Skew Dyck Paths

2021

We present enumerative results on prefixes of skew Dyck paths by giving recursive relations, Riordan arrays, and generating functions, as well as closed formulas to count the total number of these paths with respect to the length, the height of its endpoint and the number of left steps.

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]Riordan arrayLagrange inversionSkew Dyck pathGenerating function
researchProduct

Fibonacci q-decreasing words: enumerative results and Gray codes

2022

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
researchProduct

Gray code for permutations with a fixed number of left-to-right minima

2013

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]ComputingMilieux_MISCELLANEOUS
researchProduct

Q-bonacci words and numbers

2022

We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer we rediscover classical multi-step Fibonacci numbers: Fibonacci, Tribonacci, Tetranacci, etc. When $q$ is not an integer, obtained recurrence relations are connected to certain restricted integer compositions. We also discuss Gray codes for these words, and a possibly novel generalization of the golden ratio.

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
researchProduct

Packing coloring and subsets preserving path distance

2016

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]ComputingMilieux_MISCELLANEOUS
researchProduct

Pattern avoiding permutations modulo pure descent

2017

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]ComputingMilieux_MISCELLANEOUS
researchProduct

Qubonacci words

2021

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]ComputingMilieux_MISCELLANEOUS
researchProduct

Prise de décision dynamique dans la sélection des maintenances des tournées de techniciens

2022

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO]optimisation combinatoiretournée de techniciensprogrammation linéairesélection de maintenanceheuristiques
researchProduct