Buscar
Mostrando ítems 1-10 de 15
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 physical system. This allows us to consider SNs beyond those originated by interactions based on ...
Artículo
Irreducible 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 while remaining in the category of simplicial complexes and preserving the topology of the surface. A ...
Artículo
Minimum gradation in greyscales of graphs
(Elsevier, 2023-05)
In this paper we present the notion of greyscale of a graph as a colouring of its vertices that uses colours from the real interval [0,1]. Any greyscale induces another colouring by assigning to each edge the non-negative ...
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 (2004)] fails to distinguish between inequivalent classes under local Clifford operations if n≥7. On ...
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 group. For each of these classes we obtain a representative which requires the minimum number of ...
Artículo
On partitions with K corners not containing the staircase with one more corner
(Elsevier, 2022)
We give three proofs of the following result conjectured by Carriegos, De Castro-García and Muñoz Castañeda in their work on enumeration of control systems: when ( k+1 2 ) ≤ n < ( k+2 2 ) , there are as many ...
Artículo
Multi-objective integration of timetables, vehicle schedules and user routings in a transit network
(Elsevier, 2017)
The Transit Network Timetabling and Scheduling Problem (TNTSP) aims at determining anoptimal timetable for each line of a transit network by establishing departure and arrivaltimes at each station and allocating a vehicle ...
Artículo
Modelling and planning public cultural schedules for efficient use of resources
(Elsevier, 2015)
This paper addresses a decision making problem concerning the planning of cultural schedules. The model maximizes the overall welfare of the entire system by integrating the different parties involved in the process (artistic ...
Artículo
Discussion on different numerical treatments on the loss of hyperbolicity for the two-layer shallow water system
(Elsevier, 2023)
This paper focus on the numerical approximation of two-layer shallow water system. First, a new approximation of the eigenvalues of the system is proposed, which satisfies some interesting properties. From this approximation, ...
Artículo
Locating optimal timetables and vehicle schedules in a transit line
(Springer, 2014)
This paper deals with the Transit Network Timetabling and Scheduling Problem (TNTSP) in a public transit line. The TNTSP aims at determining optimal timetables for each line in a transit network by establishing departure ...