Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Cyril Banderier"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 2, Permutation..., Iss Special issues (2021)
Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based sorting algorithms and leads to many links with permutation patterns. We present several structu
Externí odkaz:
https://doaj.org/article/c3648c4bc7f24e8abe2f8e6fb2f42ff7
Autor:
Cyril Banderier, Michael Wallner
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 1, Iss Analysis of Algorithms (2017)
In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not have the sa
Externí odkaz:
https://doaj.org/article/739335e786824710a84b103d55fcc533
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 18 no. 2, Permutation..., Iss Permutation Patterns (2017)
We study the iteration of the process "a particle jumps to the right" in permutations. We prove that the set of permutations obtained in this model after a given number of iterations from the identity is a class of pattern avoiding permutations. We c
Externí odkaz:
https://doaj.org/article/bab87146066d4c41a4c6c42eed68e5ce
Autor:
Cyril Banderier, Michael Drmota
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
This paper studies the coefficients of algebraic functions. First, we recall the too-little-known fact that these coefficients $f_n$ have a closed form. Then, we study their asymptotics, known to be of the type $f_n \sim C A^n n^{\alpha}$. When the f
Externí odkaz:
https://doaj.org/article/c1f2d2230c4c48398d8449c07c37f877
Autor:
Cyril Banderier, Bernhard Gittenberger
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AG,..., Iss Proceedings (2006)
This paper tackles the enumeration and asymptotics of the area below directed lattice paths (walks on $\mathbb{N}$ with a finite set of jumps). It is a nice surprise (obtained via the "kernel method'') that the generating functions of the moments of
Externí odkaz:
https://doaj.org/article/0f338f41bf314161bd01351161390a4e
Autor:
Enrique Treviño, Florian Luca, Francesco Pappalardi, Carlos Alexis Gómez Ruiz, Cyril Banderier
Publikováno v:
Revista de la Unión Matemática Argentina
Revista de la Unión Matemática Argentina, Unión Matemática Argentina, 2021, 62 (1), pp.257-274. ⟨10.33044/revuma.1798⟩
Revista de la Unión Matemática Argentina, Unión Matemática Argentina, 2021, 62 (1), pp.257-274. ⟨10.33044/revuma.1798⟩
International audience; Let a a, n, be positive integers that are relatively prime. We say that a/n can be represented as an Egyptian fraction of length k if there exist positive integers m(1), ..., m(k) such that a/n= 1/m(1) + ... + 1/m(k). Let A(k)
Publikováno v:
Algorithmica. 82:386-428
In this article we develop a vectorial kernel method—a powerful method which solves in a unified framework all the problems related to the enumeration of words generated by a pushdown automaton. We apply it for the enumeration of lattice paths that
Autor:
Massimiliano Goldwurm, Cyril Banderier
Publikováno v:
Beyond the Horizon of Computability
Beyond the Horizon of Computability, pp.251-263, 2020, ⟨10.1007/978-3-030-51466-2_22⟩
Lecture Notes in Computer Science ISBN: 9783030514655
CiE
Beyond the Horizon of Computability, pp.251-263, 2020, ⟨10.1007/978-3-030-51466-2_22⟩
Lecture Notes in Computer Science ISBN: 9783030514655
CiE
We present some asymptotic properties on the average number of prefixes in trace languages. Such languages are characterized by an alphabet and a set of commutation rules, also called concurrent alphabet, which can be encoded by an independency graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd335b284b42f95e453a7e2d24682d09
https://hal.archives-ouvertes.fr/hal-03104003
https://hal.archives-ouvertes.fr/hal-03104003
Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based sorting algorithms and leads to many links with permutation patterns. We present several structu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18fcd80043ae7eeb767e07b2444eaa54
Autor:
Cyril Banderier, Michael Wallner
Publikováno v:
Lattice Path Combinatorics and Applications
Lattice Path Combinatorics and Applications, pp.119-154, 2019, Lattice Path Combinatorics and Applications, ⟨10.1007/978-3-030-11102-1_7⟩
Lattice Path Combinatorics and Applications ISBN: 9783030111014
Lattice Path Combinatorics and Applications, pp.119-154, 2019, Lattice Path Combinatorics and Applications, ⟨10.1007/978-3-030-11102-1_7⟩
Lattice Path Combinatorics and Applications ISBN: 9783030111014
We analyze some enumerative and asymptotic properties of lattice paths below a line of rational slope. We illustrate our approach with Dyck paths under a line of slope 2 / 5. This answers Knuth’s problem #4 from his “Flajolet lecture” during th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7790683315bad94cf43267a53d7a642b
https://hal.archives-ouvertes.fr/hal-02414080
https://hal.archives-ouvertes.fr/hal-02414080