Résultats de recherche pour « Invariant Set Theory »

The functional Schrodinger picture formulation of quantum field theory and the variational Gaussian approximation method based on the formulation are briefly reviewed. After presenting recent attempts to improve the variational approximation, we introduce a new systematic method based on the background field method, which enables one to compute the order-by-order correction terms to the Gaussian approximation of the effective action.

The Jupiter-Saturn 2:5 near-commensurability is analyzed in a fully analytic Hamiltonian planetary theory. Computations for the Sun-Jupiter-Saturn system, extending to the third order of the masses and to the 8th degree in the eccentricities and inclinations, reveal an unexpectedly sensitive dependence of the solution on initial data and its likely nonconvergence. The source of the sensitivity and apparent lack of convergence is this near-commensurability, the so-called great inequality. This indicates that simple averaging, still common in current semi-analytic planetary theories, may not be an adequate technique to obtain information on the long-term dynamics of the Solar System. Preliminary results suggest that these difficulties can be overcome by using resonant normal forms.

It is a fundamental result in commutative algebra and invariant theory that a finitely generated graded module over a commutative finitely generated graded algebra has rational Hilbert series, and consequently the Hilbert series of the algebra of polynomial invariants of a group of linear transformations is rational, whenever this algebra is finitely generated. This basic principle is applied here to prove rationality of Hilbert series of algebras of invariants that are neither commutative nor finitely generated. Our main focus is on linear groups acting on certain factor algebras of the tensor algebra that arise naturally in the theory of polynomial identities.

We begin with a context more general than set theory. The basic ingredients are essentially the object and functor primitives of category theory, and the logic is weak, requiring neither the Law of Excluded Middle nor quantification. Inside this we find "relaxed" set theory, which is much easier to use with full precision than traditional axiomatic theories. There is also an implementation of the Zermillo-Fraenkel-Choice axioms that is maximal in the sense that any other implementation uniquely embeds in it.

The simplest toroidally compactified string theories exhibit a duality between large and small radii: compactification on a circle, for example, is invariant under R goes to 1/R. Compactification on more general Lorentzian lattices (i.e. toroidal compactification in the presence of background metric, antisymmetric tensor, and gauge fields) yields theories for which large-small invariance is not so simple. Here an equivalence is demonstrated between large and small geometries for all toroidal compactifications. By repeatedly transforming the momentum mode corresponding to the smallest winding length to another mode on the lattice, it is possible to increase the volume to exceed a finite lower bound.

Abstract Motivated by the study of recurrent orbits and dynamics within a Morse set of a Morse decomposition we introduce the concept of Morse predecomposition of an isolated invariant set within the setting of both combinatorial and classical dynamical systems. While Morse decomposition summarizes solely the gradient part of a dynamical system, the developed generalization extends to the recurrent component as well. In particular, a chain recurrent set, which is indecomposable in terms of Morse decomposition, can be represented more finely in the Morse predecomposition framework. This generalization is achieved by forgoing the poset structure inherent to Morse decomposition and relaxing the notion of connection between Morse sets (elements of Morse decomposition) in favor of what we term ’links’. We prove that a Morse decomposition is a special case of Morse predecomposition indexed by a poset. Additionally, we show how a Morse predecomposition may be condensed back to retrieve a Morse decomposition.