Zobrazeno 1 - 10
of 10 649
pro vyhledávání: '"Navarro G"'
We study geometric monodromy groups $G_{\geo,\sF_q}$ of the local systems $\sF_q$ on the affine line over $\F_2$ of rank $D=\sqrt{q}(q-1)$, $q=2^{2n+1}$, constructed in \cite{Ka-ERS}. The main result of the paper shows that $G_{\geo,\sF_q}$ is either
Externí odkaz:
http://arxiv.org/abs/2305.03168
Autor:
Orts-Grau, S., Alfonso-Gil, J.C., Balaguer-Herrero, P., Martínez-Navarro, G., Gimeno-Sales, F.J.
Publikováno v:
In International Journal of Electrical Power and Energy Systems June 2024 157
Publikováno v:
In Forest Ecology and Management 1 October 2024 569
Autor:
Duran-Toscano, A.A., Díaz de León-Hernández, J.N., Fuentes-Moyado, S., Medina-Martínez, J.A., Hernández-Torres, J., García-González, L., Martínez-Castillo, J., Guzmán-Navarro, G., Domínguez-Nicolás, S.M., Hernández-Quiroz, T.
Publikováno v:
In Nano-Structures & Nano-Objects May 2024 38
Publikováno v:
In Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena February 2024 179
Publikováno v:
In Digital Signal Processing January 2024 144
We consider the algorithmic problem of computing a primitive idempotent of a central simple algebra over the field of rational functions over a finite field. The algebra is given by a set of structure constants. The problem is reduced to the computat
Externí odkaz:
http://arxiv.org/abs/2006.12116
Finding the minimum distance of linear codes is an NP-hard problem. Traditionally, this computation has been addressed by means of the design of algorithms that find, by a clever exhaustive search, a linear combination of some generating matrix rows
Externí odkaz:
http://arxiv.org/abs/2002.12330
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.