13,970 research outputs found
Kakucs-Balla-domb. A Case Study in the Absolute and Relative Chronology of the Vatya Culture
The present study hopes to contribute to Middle Bronze Age studies in two specific areas: first, by publishing a new series of radiocarbon dates for a period from which there are few absolute dates, and second, by describing a less known area in the Vatya distribution based on the investigations at Kakucs
Disentanglement and decoherence in two-spin and three-spin systems under dephasing
We compare disentanglement and decoherence rates within two-spin and
three-spin entangled systems subjected to all possible combinations of local
and collective pure dephasing noise combinations. In all cases, the bipartite
entanglement decay rate is found to be greater than or equal to the
dephasing-decoherence rates and often significantly greater. This sharpens
previous results for two-spin systems [T. Yu and J. H. Eberly Phys. Rev. B 68,
165322 (2003)] and extends them to the three-spin context.Comment: 17 page
Normal edge-colorings of cubic graphs
A normal -edge-coloring of a cubic graph is an edge-coloring with
colors having the additional property that when looking at the set of colors
assigned to any edge and the four edges adjacent it, we have either exactly
five distinct colors or exactly three distinct colors. We denote by
the smallest , for which admits a normal
-edge-coloring. Normal -edge-colorings were introduced by Jaeger in order
to study his well-known Petersen Coloring Conjecture. More precisely, it is
known that proving for every bridgeless cubic graph is
equivalent to proving Petersen Coloring Conjecture and then, among others,
Cycle Double Cover Conjecture and Berge-Fulkerson Conjecture. Considering the
larger class of all simple cubic graphs (not necessarily bridgeless), some
interesting questions naturally arise. For instance, there exist simple cubic
graphs, not bridgeless, with . On the other hand, the known
best general upper bound for was . Here, we improve it by
proving that for any simple cubic graph , which is best
possible. We obtain this result by proving the existence of specific no-where
zero -flows in -edge-connected graphs.Comment: 17 pages, 6 figure
Examination of the Circle Spline Routine
The Circle Spline routine is currently being used for generating both two and three dimensional spline curves. It was developed for use in ESCHER, a mesh generating routine written to provide a computationally simple and efficient method for building meshes along curved surfaces. Circle Spline is a parametric linear blending spline. Because many computerized machining operations involve circular shapes, the Circle Spline is well suited for both the design and manufacturing processes and shows promise as an alternative to the spline methods currently supported by the Initial Graphics Specification (IGES)
- âŠ