Perfil del autor: Portillo Fernández, José Ramón
Datos institucionales
| Nombre | Portillo Fernández, José Ramón |
| Departamento | Matemática Aplicada I |
| Área de conocimiento | Matemática Aplicada |
| Categoría profesional | Profesor Titular de Universidad |
| Correo electrónico | Solicitar |
 |
|
Estadísticas
-
Nº publicaciones
31
-
Nº visitas
2629
-
Nº descargas
4183
| Publicaciones |
|---|
Trabajo Fin de Grado
 Sistemas dinámicos, grafos y redes biológicas
(2023)
El uso de grafos para representar sistemas dinámicos nos permite describir múltiples fenómenos en diferentes áreas de la ... |
Artículo
Graph-theoretic approach to Bell experiments with low detection efficiency
(Cornell University, 2023)
Bell inequality tests where the detection efficiency is below a certain threshold ηcrit can be simulated with local ... |
Artículo
Fuzzy logic programs as hypergraphs. Termination results
(Elsevier, 2022)
Graph theory has been a useful tool for logic programming in many aspects. In this paper, we propose an equivalent ... |
Artículo
Global structural stability and the role of cooperation in mutualistic systems
(Public Library of Science (Plos), 2022)
Dynamical systems on graphs allow to describe multiple phenomena from different areas of Science. In particular, many ... |
Artículo
A network approach to analyze neuronal lineage and layer innervation in the Drosophila optic lobes
(Public Library of Science, 2020)
The optic lobes of the fruit fly Drosophila melanogaster form a highly wired neural network composed of roughly 130.000 ... |
Capítulo de Libro
Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
(Springer, 2019)
The representation of a logic program by a graph is a useful procedure in order to obtain interesting properties of the ... |
Artículo
Informational structures: A dynamical system approach for integrated information
(Public Library of Science, 2018)
Integrated Information Theory (IIT) has become nowadays the most sensible general theory of consciousness. In addition to ... |
Artículo
Irreductible Triangulations of the Once-Punctured Torus
(Sobolev Institute of Mathematics, 2018)
A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex ... |
Artículo
Minimal true-implies-false and true-implies-true sets of propositions in noncontextual hidden-variable theories
(American Physical Society, 2018)
An essential ingredient in many examples of the conflict between quantum theory and noncontextual hidden variables (e.g., ... |
Artículo
Quantum state-independent contextuality requires 13 rays
(IOP Science, 2016)
We show that, regardless of the dimension of the Hilbert space, there exists no set of rays revealing state-independent ... |
Artículo
Monochromatic geometric k-factors for bicolored point sets with auxiliary points
(2014)
Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We ... |
Artículo
Kochen-Specker set with seven contexts
(American Physical Society, 2014)
The Kochen-Specker (KS) theorem is a central result in quantum theory and has applications in quantum information. Its ... |
Artículo
Basic exclusivity graphs in quantum correlations
(American Physical Society, 2013)
A fundamental problem is to understand why quantum theory only violates some noncontextuality (NC) inequalities and identify ... |
Ponencia
An algorithm that constructs irreducible triangulations of once-punctured surfaces
(2013)
A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the ... |
Artículo
Quantum social networks
(IOP Science, 2012)
We introduce a physical approach to social networks (SNs) in which each actor is characterized by a yes–no test on a ... |
Artículo
Experimental fully contextual correlations
(American Physical Society, 2012)
Quantum correlations are contextual yet, in general, nothing prevents the existence of even more contextual correlations. ... |
Artículo
Cover contact graphs
(2012)
We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) by ... |
Artículo
A sufficient degree condition for a graph to contain all trees of size k
(Springer, 2011)
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 contains all trees of ... |
Artículo
Optimal preparation of graph states
(American Physical Society, 2011)
We show how to prepare any graph state of up to 12 qubits with (a) the minimum number of controlled-Z gates and (b) the ... |
| Artículo |
Artículo
Compact set of invariants characterizing graph states of up to eight qubits
(American Physical Society, 2009)
The set of entanglement measures proposed by Hein, Eisert, and Briegel for n-qubit graph states [Phys. Rev. A 69, 062311 ... |
Artículo
Entanglement in eight-qubit graph states
(Elsevier, 2009)
Any 8-qubit graph state belongs to one of the 101 equivalence classes under local unitary operations within the Clifford ... |
Artículo
Monochromatic geometric k-factors in red-blue sets with white and Steiner points
(2009)
We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible ... |
Tesis Doctoral
Sobre algunas clases polinomiales de satisfacibilidad : Aplicaciones a la resolución de problemas geométricos
(2009)
La Geometría Computacional posee un vasto campo de aplicaciones en las áreas de las Ciencias de Información Geográfica, ... |
Artículo
Cover Contact Graphs
(2007)
We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) ... |
Ponencia
PURL: A new polynomial-time solvable class of satisfiability
(Universidad de Cádiz, 2007)
In this work a new polynomial-time solvable class of satisfiability PURL ( PropUnit RemoveLiterals) is presented, based ... |
Artículo
Single bend wiring on surfaces
(2002)
The following problem of rectilinear routing is studied: given pairs of points on a surface and a set of permissible ... |
Tesis Doctoral
Problemas de conexiones ortogonales
(2002)
El área de investigación sobre dibujos de grafos constituye una importante conexión entre diversos campos de la Matemática, ... |
Ponencia
Conexiones ortogonales con vértices prefijados
(Alberto Márquez, 2002)
|
Ponencia
NP-completitud fuerte y débil en problemas de etiquetado
(Alberto Márquez, 2002)
|
Capítulo de Libro
Labeling Subway Lines
(2001)
Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to ... |