6,677 research outputs found
Complexity of links in 3-manifolds
We introduce a natural-valued complexity c(X) for pairs X=(M,L), where M is a
closed orientable 3-manifold and L is a link contained in M. The definition
employs simple spines, but for well-behaved X's we show that c(X) equals the
minimal number of tetrahedra in a triangulation of M containing L in its
1-skeleton. Slightly adapting Matveev's recent theory of roots for graphs, we
carefully analyze the behaviour of c under connected sum away from and along
the link. We show in particular that c is almost always additive, describing in
detail the circumstances under which it is not. To do so we introduce a certain
(0,2)-root for a pair X, we show that it is well-defined, and we prove that X
has the same complexity as its (0,2)-root. We then consider, for links in the
3-sphere, the relations of c with the crossing number and with the hyperbolic
volume of the exterior, establishing various upper and lower bounds. We also
specialize our analysis to certain infinite families of links, providing rather
accurate asymptotic estimates.Comment: 24 pages, 6 figure
Zeros of the Partition Function for Higher--Spin 2D Ising Models
We present calculations of the complex-temperature zeros of the partition
functions for 2D Ising models on the square lattice with spin , 3/2, and
2. These give insight into complex-temperature phase diagrams of these models
in the thermodynamic limit. Support is adduced for a conjecture that all
divergences of the magnetisation occur at endpoints of arcs of zeros protruding
into the FM phase. We conjecture that there are such arcs for , where denotes the integral part of .Comment: 8 pages, latex, 3 uuencoded figure
The Yang Lee Edge Singularity on Feynman Diagrams
We investigate the Yang-Lee edge singularity on non-planar random graphs,
which we consider as the Feynman Diagrams of various d=0 field theories, in
order to determine the value of the edge exponent.
We consider the hard dimer model on phi3 and phi4 random graphs to test the
universality of the exponent with respect to coordination number, and the Ising
model in an external field to test its temperature independence. The results
here for generic (``thin'') random graphs provide an interesting counterpoint
to the discussion by Staudacher of these models on planar random graphs.Comment: LaTeX, 6 pages + 3 figure
Evaluation of Data Transmission at 80MHz and 160MHz Over Backplane, Copper and Optical Links
The bunch clock frequency of the LHC accelerator at CERN is specified as 40.07897 MHz [1]. Most of the LHC experiments will utilize this frequency, its multiples or derivatives as the main frequency of data transmission for their synchronous Trigger and DAQ electronic systems. For example, the triggering system of the Cathode Strip Chamber (CSC) sub-detector at the CMS experiment comprises the onchamber anode and cathode electronics, the off-chamber boards housed in 9U crates mounted on the periphery of the Endcap iron disks, and one Track Finder (TF) crate located in the underground counting room (Fig.1). Due to the significant amount of data from the front end, the trigger patterns are multiplexed and sent from the CSC chambers over copper cables using the LVDS standard at 80 MHz. For the same reason the data patterns transmitted over backplanes in the peripheral and TF crates are also multiplexed and sent at 80MHz using the GTLP standard. Optical links from the peripheral crates to the TF are operated at 80 MHz as well. Finally, the parallel LVDS links to the Global Muon Trigger (GMT) run at 40 MHz
Inelastic Processes in the Collision of Relativistic Highly Charged Ions with Atoms
A general expression for the cross sections of inelastic collisions of fast
(including relativistic) multicharged ions with atoms which is based on the
genelazition of the eikonal approximation is derived. This expression is
applicable for wide range of collision energy and has the standard
nonrelativistic limit and in the ultrarelativistic limit coincides with the
Baltz's exact solution ~\cite{art13} of the Dirac equation. As an application
of the obtained result the following processes are calculated: the excitation
and ionization cross sections of hydrogenlike atom; the single and double
excitation and ionization of heliumlike atom; the multiply ionization of neon
and argon atoms; the probability and cross section of K-vacancy production in
the relativistic collision. The simple analytic formulae
for the cross sections of inelastic collisions and the recurrence relations
between the ionization cross sections of different multiplicities are also
obtained. Comparison of our results with the experimental data and the results
of other calculations are given.Comment: 25 pages, latex, 7 figures avialable upon request,submitted to PR
Effective action and interaction energy of coupled quantum dots
We obtain the effective action of tunnel-coupled quantum dots, by modeling
the system as a Luttinger liquid with multiple barriers. For a double dot
system, we find that the resonance conditions for perfect conductance form a
hexagon in the plane of the two gate voltages controlling the density of
electrons in each dot. We also explicitly obtain the functional dependence of
the interaction energy and peak-splitting on the gate voltage controlling
tunneling between the dots and their charging energies. Our results are in good
agreement with recent experimental results, from which we obtain the Luttinger
interaction parameter .Comment: 5 pgs,latex,3 figs,revised version to be publshed in Phys.Rev.
Some New Results on Complex-Temperature Singularities in Potts Models on the Square Lattice
We report some new results on the complex-temperature (CT) singularities of
-state Potts models on the square lattice. We concentrate on the problematic
region (where ) in which CT zeros of the partition function
are sensitive to finite lattice artifacts. From analyses of low-temperature
series expansions for , we establish the existence, in this
region, of complex-conjugate CT singularities at which the magnetization and
susceptibility diverge. From calculations of zeros of the partition function,
we obtain evidence consistent with the inference that these singularities occur
at endpoints of arcs protruding into the (complex-temperature
extension of the) FM phase. Exponents for these singularities are determined;
e.g., for , we find , consistent with .
By duality, these results also imply associated arcs extending to the (CT
extension of the) symmetric PM phase. Analytic expressions are suggested for
the positions of some of these singularities; e.g., for , our finding is
consistent with the exact value . Further discussions of
complex-temperature phase diagrams are given.Comment: 26 pages, latex, with eight epsf figure
Proof of projective Lichnerowicz conjecture for pseudo-Riemannian metrics with degree of mobility greater than two
We prove an important partial case of the pseudo-Riemannian version of the
projective Lichnerowicz conjecture stating that a complete manifold admitting
an essential group of projective transformations is the round sphere (up to a
finite cover).Comment: 32 pages, one .eps figure. The version v1 has a misprint in Theorem
1: I forgot to write the assumption that the degree of mobility is greater
than two. The versions v3, v4 have only cosmetic changes wrt v
Computing Matveev's complexity via crystallization theory: the orientable case
By means of a slight modification of the notion of GM-complexity introduced in [Casali, M.R., Topol. Its Appl., 144: 201-209, 2004], the present paper performs a graph-theoretical approach to the computation of (Matveev's) complexity for closed orientable 3-manifolds. In particular, the existing crystallization catalogue C-28 available in [Lins, S., Knots and Everything 5, World Scientific, Singapore, 1995] is used to obtain upper bounds for the complexity of closed orientable 3-manifolds triangulated by at most 28 tetrahedra. The experimental results actually coincide with the exact values of complexity, for all but three elements. Moreover, in the case of at most 26 tetrahedra, the exact value of the complexity is shown to be always directly computable via crystallization theory
- …