Consistent solutions in exchange economies: A characterization of the price mechanism

We characterize the Walrasian allocations correspondence by means offour axioms: consistency, replica invariance, individual rationality andPareto optimality. It is shown that for any given class of exchange economiesany solution that satisfies the axioms is a selection from the Walrasianallocations with slack. Preferences are assumed to be smooth, but may besatiated and non--convex. A class of economies is defined as all economieswhose agents' preferences belong to an arbitrary family (finite or infinite)of types. The result can be modified to characterize equal budget Walrasianallocations with slack by replacing individual rationality with individualrationality from equal division. The results are valid also for classes ofeconomies in which core--Walras equivalence does not hold.

A Variant of Higher-Order Anti-Unification

We present a rule-based Huet’s style anti-unification algorithm for simply-typed lambda-terms in ɳ long β normal form, which computes a least general higher-order pattern generalization. For a pair of arbitrary terms of the same type, such a generalization always exists and is unique modulo α equivalence and variable renaming. The algorithm computes it in cubic time within linear space. It has been implemented and the code is freely available

On the dimension of the core of the assignment game

The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the dimension of the core of the assignment game. This result provides an easy procedure to determine the dimension of the core directly from the entries of the assignment matrix and shows that the dimension of the core is not as much determined by the number of optimal matchings as by their relative position in the assignment matrix.

Gauge transformations in the Lagrangian and Hamilton formalisms of generally covariant theories

We study spacetime diffeomorphisms in the Hamiltonian and Lagrangian formalisms of generally covariant systems. We show that the gauge group for such a system is characterized by having generators which are projectable under the Legendre map. The gauge group is found to be much larger than the original group of spacetime diffeomorphisms, since its generators must depend on the lapse function and shift vector of the spacetime metric in a given coordinate patch. Our results are generalizations of earlier results by Salisbury and Sundermeyer. They arise in a natural way from using the requirement of equivalence between Lagrangian and Hamiltonian formulations of the system, and they are new in that the symmetries are realized on the full set of phase space variables. The generators are displayed explicitly and are applied to the relativistic string and to general relativity.

Classical solutions of the leading-logarithm approximation with non-trivial topology

Exact solutions of the classical equations corresponding to the leading-logarithm approximation are obtained. They are classified by an (integer) topological number.

Batalin-Vilkovisky analysis of covariant and noncovariant actions

The equivalence between the covariant and the noncovariant versions of a constrained system is shown to hold after quantization in the framework of the field-antifield formalism. Our study covers the cases of electromagnetism and Yang-Mills fields and sheds light on some aspects of the Faddeev-Popov method, for both the covariant and noncovariant approaches, which have not been fully clarified in the literature.

Equivalence Between the Lagrangian and Hamiltonian Formalisms for Constrained Systems

The equivalence between the Lagrangian and Hamiltonian formalism is studied for constraint systems. A procedure to construct the Lagrangian constraints from the Hamiltonian constraints is given. Those Hamiltonian constraints that are first class with respect to the Hamiltonian constraints produce Lagrangian constraints that are FL-projectable.

Batalin-Vilkovisky analysis of covariant and noncovariant actions

The equivalence between the covariant and the noncovariant versions of a constrained system is shown to hold after quantization in the framework of the field-antifield formalism. Our study covers the cases of electromagnetism and Yang-Mills fields and sheds light on some aspects of the Faddeev-Popov method, for both the covariant and noncovariant approaches, which have not been fully clarified in the literature.

Statistical description of rotating Kaluza-Klein black holes

We extend the recent microscopic analysis of extremal dyonic Kaluza-Klein (D0-D6) black holes to cover the regime of fast rotation in addition to slow rotation. Fastly rotating black holes, in contrast to slow ones, have nonzero angular velocity and possess ergospheres, so they are more similar to the Kerr black hole. The D-brane model reproduces their entropy exactly, but the mass gets renormalized from weak to strong coupling, in agreement with recent macroscopic analyses of rotating attractors. We discuss how the existence of the ergosphere and superradiance manifest themselves within the microscopic model. In addition, we show in full generality how Myers-Perry black holes are obtained as a limit of Kaluza-Klein black holes, and discuss the slow and fast rotation regimes and superradiance in this context.

Synchronization reveals topological scales in complex networks

We study the relationship between topological scales and dynamic time scales in complex networks. The analysis is based on the full dynamics towards synchronization of a system of coupled oscillators. In the synchronization process, modular structures corresponding to well-defined communities of nodes emerge in different time scales, ordered in a hierarchical way. The analysis also provides a useful connection between synchronization dynamics, complex networks topology, and spectral graph analysis.

Pattern selection in a lattice of pulse-coupled oscillators

We study spatio-temporal pattern formation in a ring of N oscillators with inhibitory unidirectional pulselike interactions. The attractors of the dynamics are limit cycles where each oscillator fires once and only once. Since some of these limit cycles lead to the same pattern, we introduce the concept of pattern degeneracy to take it into account. Moreover, we give a qualitative estimation of the volume of the basin of attraction of each pattern by means of some probabilistic arguments and pattern degeneracy, and show how they are modified as we change the value of the coupling strength. In the limit of small coupling, our estimative formula gives a pefect agreement with numerical simulations.

Synchronization, diversity, and topology of networks of integrate and fire oscillators

We study synchronization dynamics of a population of pulse-coupled oscillators. In particular, we focus our attention on the interplay between topological disorder and synchronization features of networks. First, we analyze synchronization time T in random networks, and find a scaling law which relates T to network connectivity. Then, we compare synchronization time for several other topological configurations, characterized by a different degree of randomness. The analysis shows that regular lattices perform better than a disordered network. This fact can be understood by considering the variability in the number of links between two adjacent neighbors. This phenomenon is equivalent to having a nonrandom topology with a distribution of interactions and it can be removed by an adequate local normalization of the couplings.

Strange nonchaotic attractors in Harper maps

We study the existence of strange nonchaotic attractors (SNA) in the family of Harper maps. We prove that for a set of parameters of positive measure, the map possesses a SNA. However, the set is nowhere dense. By changing the parameter arbitrarily small amounts, the attractor is a smooth curve and not a SNA.

On the dimension of the core of the assignment game

The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the dimension of the core of the assignment game. This result provides an easy procedure to determine the dimension of the core directly from the entries of the assignment matrix and shows that the dimension of the core is not as much determined by the number of optimal matchings as by their relative position in the assignment matrix.

Backflow-induced asymmetric collapse of disclination lines in liquid crystals

We present experiments where opposed pairs of planar parallel disclination lines of topological strength s=±1 move due to their mutual attraction. Our measurements show that their motion is clearly asymmetric, with +1 defects moving up to twice as fast as -1 ones. This is a clear indication of backflow, given the intrinsic isotropic elasticity of our system. A phenomenological model is able to account for the experimental observations by renormalizing the orientational diffusivity estimated from the velocity of each defect.