El uso de grafos para representar sistemas dinámicos nos permite describir múltiples fenómenos en diferentes áreas de la ...

Bell inequality tests where the detection efficiency is below a certain threshold ηcrit can be simulated with local ...

Graph theory has been a useful tool for logic programming in many aspects. In this paper, we propose an equivalent ...

Dynamical systems on graphs allow to describe multiple phenomena from different areas of Science. In particular, many ...

The optic lobes of the fruit fly Drosophila melanogaster form a highly wired neural network composed of roughly 130.000 ...

The representation of a logic program by a graph is a useful procedure in order to obtain interesting properties of the ...

Integrated Information Theory (IIT) has become nowadays the most sensible general theory of consciousness. In addition to ...

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex ...

An essential ingredient in many examples of the conflict between quantum theory and noncontextual hidden variables (e.g., ...

We show that, regardless of the dimension of the Hilbert space, there exists no set of rays revealing state-independent ...

Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We ...

The Kochen-Specker (KS) theorem is a central result in quantum theory and has applications in quantum information. Its ...

A fundamental problem is to understand why quantum theory only violates some noncontextuality (NC) inequalities and identify ...

A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the ...

We introduce a physical approach to social networks (SNs) in which each actor is characterized by a yes–no test on a ...

Quantum correlations are contextual yet, in general, nothing prevents the existence of even more contextual correlations. ...

We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) by ...

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 ...

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 ...

The set of entanglement measures proposed by Hein, Eisert, and Briegel for n-qubit graph states [Phys. Rev. A 69, 062311 ...

Any 8-qubit graph state belongs to one of the 101 equivalence classes under local unitary operations within the Clifford ...

We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible ...

La Geometría Computacional posee un vasto campo de aplicaciones en las áreas de las Ciencias de Información Geográfica, ...

We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) ...

In this work a new polynomial-time solvable class of satisfiability PURL ( PropUnit RemoveLiterals) is presented, based ...

The following problem of rectilinear routing is studied: given pairs of points on a surface and a set of permissible ...

El área de investigación sobre dibujos de grafos constituye una importante conexión entre diversos campos de la Matemática, ...

Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to ...