Question

Find the number of ways to move along the grid from $(0,0)$ to $(n,n)$ such that one is always in the region $x \geq y$.

score 65 · Answer 1 · 2020-06-11 03:38:57

65

Views

Find the number of ways to move along the grid from $(0,0)$ to $(n,n)$ such that one is always in the region $x \geq y$.

Published on 11 Jun 2020 - 3:38

score 118 · Answer 2 · 2020-06-11 12:02:41

118

Views

Use Catalan number to solve voters problem

Published on 11 Jun 2020 - 12:02

score 56 · Answer 3 · 2020-06-13 14:15:21

56

Views

Complicated recurrence relation of catalan number(from combinatorics test)

Published on 13 Jun 2020 - 14:15

score 260 · Answer 4 · 2020-06-15 05:55:21

260

Views

Find a bijection between the $(n-1)$ paths and the $n$-paths which have no downramps of even length.

Published on 15 Jun 2020 - 5:55

score 469 · Answer 5 · 2020-06-15 09:04:00

469

Views

Lattice paths with avoiding a group of points

Published on 15 Jun 2020 - 9:04

score 741 · Answer 6 · 2020-06-16 03:54:26

741

Views

Generalizing Catalan numbers: number of ways where we cross the diagonal $k$ times.

Published on 16 Jun 2020 - 3:54

score 399 · Answer 7 · 2020-06-17 06:57:12

399

Views

Given a binary tree with N labelled leaves, is it possible to find its unique number in the Catalan range?

Published on 17 Jun 2020 - 6:57

score 134 · Answer 8 · 2020-06-17 08:11:26

134

Views

lattice paths with maximum vertical height

Published on 17 Jun 2020 - 8:11

score 95 · Answer 9 · 2020-06-18 03:29:47

95

Views

Converting recurrence involving binomial terms and generating functions to closed form.

Published on 18 Jun 2020 - 3:29

score 44 · Answer 10 · 2020-06-19 18:26:26

44

Views

Counting Dyck-like Paths?

Published on 19 Jun 2020 - 18:26

score 154 · Answer 11 · 2020-06-28 21:20:03

154

Views

Generating function for Catalan numbers using the "Analytic combinatorics" approach.

Published on 28 Jun 2020 - 21:20

score 143 · Answer 12 · 2020-07-04 18:35:56

143

Views

Dyck paths : binary trees :: Ballot paths : forests?

Published on 04 Jul 2020 - 18:35

score 257 · Answer 13 · 2020-07-04 23:44:19

257

Views

Paths on a grid that don't go below $0$ or above $l$ before reaching their target.

Published on 04 Jul 2020 - 23:44

score 147 · Answer 14 · 2020-07-05 21:58:04

147

Views

How many number of paths are there

Published on 05 Jul 2020 - 21:58

score 148 · Answer 15 · 2020-07-06 17:33:52

148

Views

Prove that $\frac{\binom{2n}{n}}{n+1}$ is an integer.

Published on 06 Jul 2020 - 17:33

List Question

Find the number of ways to move along the grid from $(0,0)$ to $(n,n)$ such that one is always in the region $x \geq y$.

Use Catalan number to solve voters problem

Complicated recurrence relation of catalan number(from combinatorics test)

Find a bijection between the $(n-1)$ paths and the $n$-paths which have no downramps of even length.

Lattice paths with avoiding a group of points

Generalizing Catalan numbers: number of ways where we cross the diagonal $k$ times.

Given a binary tree with N labelled leaves, is it possible to find its unique number in the Catalan range?

lattice paths with maximum vertical height

Converting recurrence involving binomial terms and generating functions to closed form.

Counting Dyck-like Paths?

Generating function for Catalan numbers using the "Analytic combinatorics" approach.

Dyck paths : binary trees :: Ballot paths : forests?

Paths on a grid that don't go below $0$ or above $l$ before reaching their target.

How many number of paths are there

Prove that $\frac{\binom{2n}{n}}{n+1}$ is an integer.

Trending Questions

Popular # Hahtags

Popular Questions