25 citations · 33 across the 11 of their papers we have counts for
13 papers
Counting stringy points on a family of character varieties
Lucas de Amorin, Martin Mereb
We provided explicit formulas for the number of stringy points over finite fields of parabolic type A character varieties with generic semisimple monodromy. This leads to formulas…
Poisson genericity in numeration systems with exponentially mixing probabilities
Nicolás Álvarez, Verónica Becher, Eda Cesaratto +3
We define Poisson genericity for infinite sequences in any finite or countable alphabet with an invariant exponentially-mixing probability measure. A sequence is Poisson generic if…
Representations of Yokonuma--Hecke algebras
Emiliano Liwski, Martín Mereb
The Iwahori--Hecke and Yokonuma--Hecke algebras have played crucial roles in algebraic combinatorics and the representation theory of finite groups. In this work, we use classical…
De Bruijn Sequences with Minimum Discrepancy
Nicolás Álvarez, Verónica Becher, Martín Mereb +2
The discrepancy of a binary string is the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string.…
On extremal factors of de Bruijn-like graphs
Nicolás Álvarez, Verónica Becher, Martín Mereb +2
In 1972 Mykkeltveit proved that the maximum number of vertex-disjoint cycles in the de Bruijn graphs of order is attained by the pure cycling register rule, as conjectured by G…
Determinants of matrices related to the Pascal triangle
Martín Mereb
In this note we prove an assertion made by M. Levin in 1999: the Pascal matrix modulo 2 has the property that each of the square sub-matrices laying on the upper border or on the l…