72 research outputs found
The Parameterized Complexity of Graph Cyclability
The cyclability of a graph is the maximum integer for which every
vertices lie on a cycle. The algorithmic version of the problem, given a graph
and a non-negative integer decide whether the cyclability of is at
least is {\sf NP}-hard. We study the parametrized complexity of this
problem. We prove that this problem, parameterized by is {\sf
co\mbox{-}W[1]}-hard and that its does not admit a polynomial kernel on planar
graphs, unless {\sf NP}\subseteq{\sf co}\mbox{-}{\sf NP}/{\sf poly}. On the
positive side, we give an {\sf FPT} algorithm for planar graphs that runs in
time . Our algorithm is based on a series of
graph-theoretical results on cyclic linkages in planar graphs
The kernel and the injectivity of the EPRL map
In this paper we prove injectivity of the EPRL map for |\gamma|<1, filling
the gap of our previous paper.Comment: 17 pages, 3 figure
Forbidding Kuratowski graphs as immersions
The immersion relation is a partial ordering relation on graphs that is weaker than the topological minor relation in the sense that if a graph G contains a graph H as a topological minor, then it also contains it as an immersion but not vice versa. Kuratowski graphs, namely K 5 and K 3,3 , give a precise characterization of planar graphs when excluded as topological minors. In this note we give a structural characterization of the graphs that exclude Kuratowski graphs as immersions. We prove that they can be constructed by applying consecutive i-edge-sums, for i ≤ 3, starting from graphs that are planar sub-cubic or of branchwidth at most 10
The EPRL intertwiners and corrected partition function
Do the SU(2) intertwiners parametrize the space of the EPRL solutions to the
simplicity constraint? What is a complete form of the partition function
written in terms of this parametrization? We prove that the EPRL map is
injective for n-valent vertex in case when it is a map from SO(3) into
SO(3)xSO(3) representations. We find, however, that the EPRL map is not
isometric. In the consequence, in order to be written in a SU(2) amplitude
form, the formula for the partition function has to be rederived. We do it and
obtain a new, complete formula for the partition function. The result goes
beyond the SU(2) spin-foam models framework.Comment: RevTex4, 15 pages, 5 figures; theorem of injectivity of EPRL map
correcte
On disconnected cuts and separators
Abstract. For a connected graph G = (V, E), a subset U ⊆ V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. A natural condition is to impose that for any u ∈ U the subgraph induced by (V \U ) ∪ {u} is connected. In that case U is called a minimal disconnected cut. We show that the problem of testing whether a graph has a minimal disconnected cut is NP-complete. We also show that the problem of testing whether a graph has a disconnected cut separating two specified vertices s and t is NP-complete
One vertex spin-foams with the Dipole Cosmology boundary
We find all the spin-foams contributing in the first order of the vertex
expansion to the transition amplitude of the Bianchi-Rovelli-Vidotto Dipole
Cosmology model. Our algorithm is general and provides spin-foams of
arbitrarily given, fixed: boundary and, respectively, a number of internal
vertices. We use the recently introduced Operator Spin-Network Diagrams
framework.Comment: 23 pages, 30 figure
Atrial expression of the CCN1 and CCN2 proteins in chronic heart failure
Previous studies have reported the upregulation of CCN proteins early after acute heart injury. The aim of the present work was to evaluate the expression of the CCN1 and CCN2 proteins and their regulation by angiotensin II in the atrial myocardium of a chronically failing heart. Male adult mice were subjected to ligation of the left coronary artery to produce myocardial infarction (the MI group), and 16 of them were treated for 12 weeks with the AT1 receptor antagonist telmisartan (the MI-Tel group). Sham-operated mice served as controls. The expression of proteins was evaluated by immunohistochemistry 12 weeks after the operation. In shamoperated mice, stainings for CCN1 and CCN2 proteins were positive within atrial cardiomyocytes. CCN1-positive reaction revealed diffused cytoplasmic localization, while CCN2 was present mainly within the perinuclear cytoplasm. CCN1 was upregulated in the MI group, while CCN2 remained at basal level. Telmisartan prevented the upregulation of CCN1 and decreased CCN2 level. We compared the experimental data with the expression of CCN1 and CCN2 proteins in human right atrial appendages. We found an inverse, but not significant, relation between the level of either protein and the left ventricular ejection fraction. This suggests a similar atrial regulation of CCN1 and CCN2 expression also in humans. We conclude that in the murine atria, CCN1 and CCN2 proteins are expressed constitutively. In chronic heart failure, CCN proteins tend to be upregulated, which may be related to the action of angiotensin II
Feynman diagrammatic approach to spin foams
"The Spin Foams for People Without the 3d/4d Imagination" could be an
alternative title of our work. We derive spin foams from operator spin network
diagrams} we introduce. Our diagrams are the spin network analogy of the
Feynman diagrams. Their framework is compatible with the framework of Loop
Quantum Gravity. For every operator spin network diagram we construct a
corresponding operator spin foam. Admitting all the spin networks of LQG and
all possible diagrams leads to a clearly defined large class of operator spin
foams. In this way our framework provides a proposal for a class of 2-cell
complexes that should be used in the spin foam theories of LQG. Within this
class, our diagrams are just equivalent to the spin foams. The advantage,
however, in the diagram framework is, that it is self contained, all the
amplitudes can be calculated directly from the diagrams without explicit
visualization of the corresponding spin foams. The spin network diagram
operators and amplitudes are consistently defined on their own. Each diagram
encodes all the combinatorial information. We illustrate applications of our
diagrams: we introduce a diagram definition of Rovelli's surface amplitudes as
well as of the canonical transition amplitudes. Importantly, our operator spin
network diagrams are defined in a sufficiently general way to accommodate all
the versions of the EPRL or the FK model, as well as other possible models. The
diagrams are also compatible with the structure of the LQG Hamiltonian
operators, what is an additional advantage. Finally, a scheme for a complete
definition of a spin foam theory by declaring a set of interaction vertices
emerges from the examples presented at the end of the paper.Comment: 36 pages, 23 figure
Operator Spin Foam Models
The goal of this paper is to introduce a systematic approach to spin foams.
We define operator spin foams, that is foams labelled by group representations
and operators, as the main tool. An equivalence relation we impose in the set
of the operator spin foams allows to split the faces and the edges of the
foams. The consistency with that relation requires introduction of the
(familiar for the BF theory) face amplitude. The operator spin foam models are
defined quite generally. Imposing a maximal symmetry leads to a family we call
natural operator spin foam models. This symmetry, combined with demanding
consistency with splitting the edges, determines a complete characterization of
a general natural model. It can be obtained by applying arbitrary (quantum)
constraints on an arbitrary BF spin foam model. In particular, imposing
suitable constraints on Spin(4) BF spin foam model is exactly the way we tend
to view 4d quantum gravity, starting with the BC model and continuing with the
EPRL or FK models. That makes our framework directly applicable to those
models. Specifically, our operator spin foam framework can be translated into
the language of spin foams and partition functions. We discuss the examples: BF
spin foam model, the BC model, and the model obtained by application of our
framework to the EPRL intertwiners.Comment: 19 pages, 11 figures, RevTex4.
- …