11 citations · 15 across the 18 of their papers we have counts for
4 papers · 1 filter
Singularly cospectral circulant graphs
Cristian M. Conde, Ezequiel Dratman, Luciano N. Grippo +1
Two graphs having the same spectrum are said to be cospectral. Two graphs such that the absolute values of their nonzero eigenvalues coincide are singularly cospectral graphs. Cosp…
Playing through a noisy channel (and knowing it)
Nicolas Capitelli, Melina Privitelli
In this note we discuss a theory of combinatorial games that involve transmitting the moves through a noisy channel that can introduce errors during the transmission. Players are a…
Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field
Nardo Giménez, Guillermo Matera, Mariana Pérez +1
We analyze the behavior of the Euclidean algorithm applied to pairs (g,f) of univariate nonconstant polynomials over a finite field F_q of q elements when the highest-degree polyno…
Factorization patterns on nonlinear families of univariate polynomials over a finite field
Guillermo Matera, Mariana Pérez, Melina Privitelli
We estimate the number of elements on a nonlinear family of monic polynomials of of degree having factorization p…