Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Samuele Giraudo"'
Autor:
Samuele Giraudo
Publikováno v:
Journal of Creative Music Systems, Vol 8, Iss 1 (2024)
We introduce the notion of multi-pattern, a combinatorial abstraction of polyphonic musical phrases. The interest of this approach to encode musical phrases lies in the fact that it becomes possible to compose multi-patterns in order to produce new o
Externí odkaz:
https://doaj.org/article/3103a84530f845e6b35ac00660481026
Autor:
Samuele Giraudo
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AR,..., Iss Proceedings (2012)
We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar combinatorial obje
Externí odkaz:
https://doaj.org/article/5e9115e9fba5454cb797de668b8e8433
Autor:
Samuele Giraudo
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AO,..., Iss Proceedings (2011)
We give a new construction of a Hopf subalgebra of the Hopf algebra of Free quasi-symmetric functions whose bases are indexed by objects belonging to the Baxter combinatorial family (\emphi.e. Baxter permutations, pairs of twin binary trees, \emphetc
Externí odkaz:
https://doaj.org/article/5d6ddeec26e34448bff2a5f7664b8c0b
Autor:
Samuele Giraudo
Publikováno v:
Mathematical Structures in Computer Science. 32:271-299
We study combinatorial and order theoretic structures arising from the fragment of combinatory logic spanned by the basic combinator ${\bf M}$. This basic combinator, named as the Mockingbird by Smullyan, is defined by the rewrite rule ${\bf M} x_1 \
Autor:
Samuele Giraudo
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2019, ⟨10.1016/j.disc.2019.02.008⟩
Discrete Mathematics, Elsevier, 2019, ⟨10.1016/j.disc.2019.02.008⟩
We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous grammars,
Autor:
Samuele Giraudo
Publikováno v:
Annals of Combinatorics
Annals of Combinatorics, Springer Verlag, 2021
Annals of Combinatorics, Springer Verlag, 2021
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer partitions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95b3526b5525a5e8cdad2459d244fe86
https://hal.archives-ouvertes.fr/hal-03668975
https://hal.archives-ouvertes.fr/hal-03668975
Autor:
Camille Combe, Samuele Giraudo
Publikováno v:
Combinatorial Theory
Combinatorial Theory, eScholarship, 2022, 2 (1), pp.6. ⟨10.5070/C62156878⟩
Combinatorial Theory, eScholarship, 2022, 2 (1), pp.6. ⟨10.5070/C62156878⟩
We introduce $��$-cliffs, a generalization of permutations and increasing trees depending on a range map $��$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we describe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56a2f9f219d187a018d63c0cabdd938c
Publikováno v:
TAMC
TAMC, Apr 2019, Kitakyushu, Japan. pp.242-261, ⟨10.1007/978-3-030-14812-6_15⟩
Lecture Notes in Computer Science ISBN: 9783030148119
TAMC, Apr 2019, Kitakyushu, Japan. pp.242-261, ⟨10.1007/978-3-030-14812-6_15⟩
Lecture Notes in Computer Science ISBN: 9783030148119
Given permutations \(\pi \), \(\sigma _1\) and \(\sigma _2\), the permutation \(\pi \) (viewed as a string) is said to be a shuffle of \(\sigma _1\) and \(\sigma _2\), in symbols Open image in new window , if \(\pi \) can be formed by interleaving th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff5fa16dc20cb992e4f859a5df44ec8e
https://hal.archives-ouvertes.fr/hal-02304028
https://hal.archives-ouvertes.fr/hal-02304028
Autor:
Samuele Giraudo
Publikováno v:
Journal of Combinatorial Theory, Series A
Journal of Combinatorial Theory, Series A, Elsevier, 2020, ⟨10.1016/j.jcta.2020.105285⟩
Journal of Combinatorial Theory, Series A, Elsevier, 2020, ⟨10.1016/j.jcta.2020.105285⟩
A syntax tree is a planar rooted tree where internal nodes are labeled on a graded set of generators. There is a natural notion of occurrence of contiguous pattern in such trees. We describe a way, given a set of generators $\mathfrak{G}$ and a set o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b388e5a4a77fa68ae8b0b5736085cf2f
http://arxiv.org/abs/1903.00677
http://arxiv.org/abs/1903.00677
Publikováno v:
Advances in Applied Mathematics
Advances in Applied Mathematics, Elsevier, 2016, 75, pp.56-93. ⟨10.1016/j.aam.2016.01.002⟩
Advances in Applied Mathematics, Elsevier, 2016, 75, pp.56-93. ⟨10.1016/j.aam.2016.01.002⟩
We generalize the construction of multitildes in the aim to provide multitilde operators for regular languages. We show that the underliying algebraic structure involves the action of some operads. An operad is an algebraic structure that mimics the