Zobrazeno 1 - 10
of 179
pro vyhledávání: '"Frosini, Andrea"'
Given a 3-uniform hypergraph H, its 2-intersection graph G has for vertex set the hyperedges of H and ee' is an edge of G whenever e and e' have exactly two common vertices in H. Di Marco et al. prove that deciding wether a graph G is the 2-intersect
Externí odkaz:
http://arxiv.org/abs/2305.13932
Autor:
Ascolese, Michela, Frosini, Andrea
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have specific int
Externí odkaz:
http://arxiv.org/abs/2305.04626
In this paper we study the number $r_{bwt}$ of equal-letter runs produced by the Burrows-Wheeler transform ($BWT$) when it is applied to purely morphic finite words, which are words generated by iterating prolongable morphisms. Such a parameter $r_{b
Externí odkaz:
http://arxiv.org/abs/2202.02609
Autor:
Dulio, Paolo, Frosini, Andrea
Publikováno v:
In Discrete Applied Mathematics 15 December 2024 358:302-319
Publikováno v:
In Theoretical Computer Science 12 December 2024 1020
Autor:
Secci, Sara, Liuzzi, Piergiuseppe, Hakiki, Bahia, Burali, Rachele, Draghi, Francesca, Romoli, Anna Maria, di Palma, Azzurra, Scarpino, Maenia, Grippo, Antonello, Cecchi, Francesca, Frosini, Andrea, Mannini, Andrea
Publikováno v:
In Clinical Neurophysiology July 2024 163:197-208
Autor:
Ascolese, Michela, Frosini, Andrea
Publikováno v:
In Discrete Applied Mathematics 15 June 2024 350:71-83
Autor:
Dulio, Paolo, Frosini, Andrea
In the usual aim of discrete tomography, the reconstruction of an unknown discrete set is considered, by means of projection data collected along a set $U$ of discrete directions. Possible ambiguous reconstructions can arise if and only if switching
Externí odkaz:
http://arxiv.org/abs/2012.08332
Recently a permutation on Dyck paths, related to the chip firing game, was introduced and studied by Barnabei et al.. It is called $\gamma$-operator, and uses symmetries and reflections to relate Dyck paths having the same length. A relevant research
Externí odkaz:
http://arxiv.org/abs/1911.04795
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.