Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Enric Cosme Llópez"'
Autor:
Raúl Fernández Llopez, Ana María De Benito Trigueros, Enric Cosme Llópez, Carlos Pablos Abella
Publikováno v:
European Journal of Human Movement, Vol 43 (2019)
The object of this study was to find out the evaluation and reliability of an inertial movement unit (IMU), based on the TITAN (rO2 Sport Technology and Consulting, Valencia, Spain) system, measuring the variables of sports performance. A linear enco
Externí odkaz:
https://doaj.org/article/50d3f151028d4f6b9b1b541c7768b5d8
Publikováno v:
Cosme i Llópez, Enric Ruiz Mora, Raúl Tamarit, Núria 2022 A comic page for the first isomorphism theorem Journal of Mathematics and the Arts 16 1-2 29 56
RODERIC. Repositorio Institucional de la Universitat de Valéncia
instname
RODERIC. Repositorio Institucional de la Universitat de Valéncia
instname
Given a homomorphism between algebras, there exists an isomorphism between the quotient of the domain by its kernel and the subalgebra in the codomain given by its image. This theorem, commonly known as the first isomorphism theorem, is a fundamental
Autor:
Enric Cosme Llópez, Juan Climent Vidal
Publikováno v:
Logic Journal of the IGPL.
After proving, in a purely categorial way, that the inclusion functor $\textrm {In}_{\textbf {Alg}(\varSigma )}$ from $\textbf {Alg}(\varSigma )$, the category of many-sorted $\varSigma $-algebras, to $\textbf {PAlg}(\varSigma )$, the category of man
Publikováno v:
Ballester-Bolinches, Adolfo Cosme i Llópez, Enric Jiménez-Seral, P. 2019 Some Contributions to the Theory of Transformation Monoids Journal of Algebra 522 31 60
RODERIC. Repositorio Institucional de la Universitat de Valéncia
instname
RODERIC. Repositorio Institucional de la Universitat de Valéncia
instname
The aim of this paper is to present some contributions to the theory of finite transformation monoids. The dominating influence that permutation groups have on transformation monoids is used to describe and characterise transitive transformation mono
Publikováno v:
Science China Mathematics. 60:439-448
The principal aim of this paper is to study the regular and transitive subgroup functors in the universe of all finite soluble groups. We prove that they form a complemented and non-modular lattice containing two relevant sublattices. This is the ans
Publikováno v:
Ballester-Bolinches, Adolfo Cosme i Llópez, Enric Esteban Romero, Ramón Rutten, J.J.M.M. 2015 Formations of monoids, congruences, and formal languages Scientific Annals of Computer Science 25 2 171 209
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
RODERIC. Repositorio Institucional de la Universitat de Valéncia
Scientific Annals of Computer Science, Vol XXV, Iss 2, Pp 171-209 (2015)
CWI Technical Report report ; R 1504. Amsterdam : CWI. Formal Methods [FM]
CWI Technical Report report ; R 1504
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
RODERIC. Repositorio Institucional de la Universitat de Valéncia
Scientific Annals of Computer Science, Vol XXV, Iss 2, Pp 171-209 (2015)
CWI Technical Report report ; R 1504. Amsterdam : CWI. Formal Methods [FM]
CWI Technical Report report ; R 1504
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and developed in [3] to prove a general version of the Eilenberg-type theorem presented in [4]. Our principal results confirm the existence of a bijective cor
Publikováno v:
Open Mathematics, Vol 11, Iss 11, Pp 1914-1922 (2013)
Ballester Bolinches, Adolfo Cosme Llópez, Enric Esteban Romero, Ramón 2013 Algorithms for permutability in finite groups Central European Journal Of Mathematics 11 11 1914 1922
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
RODERIC. Repositorio Institucional de la Universitat de Valéncia
Ballester Bolinches, Adolfo Cosme Llópez, Enric Esteban Romero, Ramón 2013 Algorithms for permutability in finite groups Central European Journal Of Mathematics 11 11 1914 1922
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
RODERIC. Repositorio Institucional de la Universitat de Valéncia
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutabil
Publikováno v:
Scientific Annals of Computer Science 'Alexandru Ioan Cuza' University of Iasi, 16, 123-124
Scientific Annals of Computer Science 'Alexandru Ioan Cuza' University of Iasi, 16, 1, pp. 123-124
Scientific Annals of Computer Science, Vol XXVI, Iss 1, Pp 123-124 (2016)
Scientific Annals of Computer Science 'Alexandru Ioan Cuza' University of Iasi, 16, 1, pp. 123-124
Scientific Annals of Computer Science, Vol XXVI, Iss 1, Pp 123-124 (2016)
[1] A. Ballester-Bolinches, E. Cosme-Llópez, R. Esteban Romero, and J.J.M.M. Rutten. Formations of monoids, congruences, and formal languages. Scientific Annals of Computer Science, 25(2):171–209, 2015. doi:10.7561/SACS.2015.2.171.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51f8c93869e6e70fbe7e2ade741df97a
http://hdl.handle.net/2066/161397
http://hdl.handle.net/2066/161397
Publikováno v:
Ballester-Bolinches, Adolfo Cosme i Llópez, Enric Esteban Romero, Ramón 2016 Group Extensions and Graphs Expositiones Mathematicae 34 3 327 334
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
RODERIC. Repositorio Institucional de la Universitat de Valéncia
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
RODERIC. Repositorio Institucional de la Universitat de Valéncia
A classical result of Gaschütz affirms that given a finite A-generated group G and a prime p, there exists a group G# and an epimorphism phi: G# ---> G whose kernel is an elementary abelian p-group which is universal among all groups satisfying this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::52fdd1e3baef9742784c747ea6e1bb42
http://hdl.handle.net/10550/68724
http://hdl.handle.net/10550/68724
Publikováno v:
Information and Computation, 244, 49-75
Information and Computation, 244, October, pp. 49-75
Information and Computation, 244, October, pp. 49-75
The transition structure α : X ? X A of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. We use this algebra-coalgebra duality as a common perspective for the study of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13fa06a544cfa6d895eb1518a544bfd7
https://hdl.handle.net/https://repository.ubn.ru.nl/handle/2066/147286
https://hdl.handle.net/https://repository.ubn.ru.nl/handle/2066/147286