The finite-size corrections, central chargesc, and scaling dimensionsx of tricritical hard squares and critical hard hexagons are calculated analytically. This is achieved by solving the special functional equation or inversion identity satisfied by the commuting row transfer matrices of these lattice models at criticality. The results are expressed in terms of Rogers dilogarithms. For tricritical hard squares we obtainc=7/10,x=3/40, 1/5, 7/8, 6/5 and for hard hexagons we obtainc=4/5,x=2/15, 4/5, 17/15, 4/3, 9/5, in accord with the predictions of conformal and modular invariance. 相似文献
We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations
are quantified by parameters that are subject to the ``concentration of measure' phenomenon, meaning that on a large-probability
set these parameters are close to their expectation. For the entropy of entanglement, this has the counterintuitive consequence
that there exist large subspaces in which all pure states are close to maximally entangled. This, in turn, implies the existence
of mixed states with entanglement of formation near that of a maximally entangled state, but with negligible quantum mutual
information and, therefore, negligible distillable entanglement, secret key, and common randomness. It also implies a very
strong locking effect for the entanglement of formation: its value can jump from maximal to near zero by tracing over a number
of qubits negligible compared to the size of the total system. Furthermore, such properties are generic. Similar phenomena
are observed for random multiparty states, leading us to speculate on the possibility that the theory of entanglement is much
simplified when restricted to asymptotically generic states. Further consequences of our results include a complete derandomization
of the protocol for universal superdense coding of quantum states. 相似文献
In this paper we consider a special optimization problem withtwo objectives which arises in antenna theory. It is shown that thisabstract bicriterial optimization problem has at least one solution.Discretized versions of this problem are also discussed, and therelationships between these finite dimensional problems and the infinitedimensional problem are investigated. Moreover, we presentnumerical results for special parameters using a multiobjectiveoptimization method. 相似文献
Summary We study a countable system of interacting diffusions on the interval [0,1], indexed by a hierarchical group. A particular choice of the interaction guaranties, we are in the diffusive clustering regime. This means clusters of components with values either close to 0 or close to 1 grow on various different scales. However, single components oscillate infinitely often between values close to 0 and close to 1 in such a way that they spend fraction one of their time together and close to the boundary. The processes in the whole class considered and starting with a shift-ergodic initial law have the same qualitative properties (universality). 相似文献
Summary In the present paper we study truncated projections for the fanbeam geometry in computerized tomography. First we derive consistency conditions for the divergent beam transform. Then we study a singular value decomposition for the case where only the interior rays in the fan are provided, as for example in region-of-interest tomography. We show that the high angular frequency components of the searched-for densities are well determined and we present reconstructions from real data where the missing information is approximated based on the singular value decomposition.The work of the authors was supported by the Deutsche Forschungsgemeinschaft under grant Lo 310/2-4 相似文献
This work is aimed at the optimization of the yield and purity of non-symmetrical trialkyl sulfonium halide salts. The effects of parameters such as solvent, temperature and concentration were studied. The products were carefully analyzed and the crystal structure of [{n-CH3(CH2)15}(CH3)2S]Br determined. The overall aim of the present study is future syntheses of low-dimensional magnetic materials. 相似文献
A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.
In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.
In this paper we study a subclass of dynamic process graphs called
-output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is
-complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a
-complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion. 相似文献