Zobrazeno 1 - 10
of 91
pro vyhledávání: '"Michele Elia"'
Autor:
Michele Elia
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2003, Iss 63, Pp 3995-4006 (2003)
A geometry problem is to find an (n−1)-dimensional simplex in ℝn of minimal volume with vertices on the positive coordinate axes, and constrained to pass through a given point A in the first orthant. In this paper, it is shown that the optimal si
Externí odkaz:
https://doaj.org/article/da213a2a2f1241c39df97bcfe9744915
Autor:
Michele Elia
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 27, Iss 8, Pp 457-469 (2001)
This paper presents a construction of m-by-m irreducible Fibonacci matrices for any even m. The proposed technique relies on matrix representations of algebraic number fields which are an extension of the golden section field. The explicit constructi
Externí odkaz:
https://doaj.org/article/577ad1833bef4f53aa7286de40d50bb7
Autor:
Michele Elia, J. Carmelo Interlando
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 25:83-95
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0571eca2adcdeb7502bcf314517177d2
https://doi.org/10.1080/09720529.2021.1961891
https://doi.org/10.1080/09720529.2021.1961891
Autor:
Michele Elia, Elisa Gorla
Publikováno v:
JP Journal of Algebra, Number Theory and Applications. 45:13-28
The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right representation of G; i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ac334a6cbcf9f5ae0a24cf836d9a376
https://doi.org/10.17654/nt045010013
https://doi.org/10.17654/nt045010013
Autor:
Michele Elia, Federico Pintore
Publikováno v:
JP Journal of Algebra, Number Theory and Applications. 40:165-179
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f622ea2c5ec05b5793a79f8814e8291
https://doi.org/10.17654/nt040020165
https://doi.org/10.17654/nt040020165
Publikováno v:
Applied Mathematics and Computation. 409:125537
In this paper, we highlight that the point group structure of elliptic curves, over finite or infinite fields, may be also observed on reducible cubics with an irreducible quadratic component. Starting from this, we introduce in a very general way a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56538a79b63016cd81a580d8932ff1b9
https://doi.org/10.1016/j.amc.2020.125537
https://doi.org/10.1016/j.amc.2020.125537
Publikováno v:
Molecular Genetics and Metabolism. 132:S332-S333
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f28cdf858879924695d8c884d25ba1e9
https://doi.org/10.1016/s1096-7192(21)00593-x
https://doi.org/10.1016/s1096-7192(21)00593-x
Autor:
Michele Elia
It is shown that a partition $\mathfrak A\cup \mathfrak B$ of the set $\mathbb F_{p^m}^*=\mathbb F_{p^m}-\{0 \}$, with $|\mathfrak A|=|\mathfrak B|$, is the separation into squares and non squares, if and only if the elements of $\mathfrak A$ and $\m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::affe73d035ee0cef80f14f35aa4558ae
http://arxiv.org/abs/1903.00169
http://arxiv.org/abs/1903.00169
Publikováno v:
ITA
A theory leading to the design of line group codes generated by Coxeter matrix groups was presented in [1]. With these codes, resistance to common-mode noise is obtained by using codewords whose components sum to zero, simultaneous switching output n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ec5c1c17f5faba9c42ca56e67ea5877
https://doi.org/10.1109/ita.2018.8503222
https://doi.org/10.1109/ita.2018.8503222
Autor:
Michele Elia
Publikováno v:
Applied Mathematics and Computational Intelligence ISBN: 9783319757919
Based on the geometry of finite projective planes, a secret-key encryption scheme which offers an exactly computable degree of secrecy is described. This target is achieved at the cost of an encryption rate equal to \(\frac{1}{2}\), as in one-time-pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::264587363aef0f5184486a0d59099911
https://doi.org/10.1007/978-3-319-75792-6_29
https://doi.org/10.1007/978-3-319-75792-6_29