Frame Multiplication Theory and a Vector-Valued DFT and Ambiguity Function

Vector-valued discrete Fourier transforms (DFTs) and ambiguity functions are defined. The motivation for the definitions is to provide realistic modeling of multi-sensor environments in which a useful time–frequency analysis is essential. The definition of the DFT requires associated uncertainty principle inequalities. The definition of the ambiguity function requires a component that leads to formulating a mathematical theory in which two essential algebraic operations can be made compatible in a natural way. The theory is referred to as frame multiplication theory. These definitions, inequalities, and theory are interdependent, and they are the content of the paper with the centerpiece being frame multiplication theory. The technology underlying frame multiplication theory is the theory of frames, short time Fourier transforms, and the representation theory of finite groups. The main results have the following form: frame multiplication exists if and only if the finite frames that arise in the theory are of a certain type, e.g., harmonic frames, or, more generally, group frames. In light of the complexities and the importance of the modeling of time-varying and dynamical systems in the context of effectively analyzing vector-valued multi-sensor environments, the theory of vector-valued DFTs and ambiguity functions must not only be mathematically meaningful, but it must have constructive implementable algorithms, and be computationally viable. This paper presents our vision for resolving these issues, in terms of a significant mathematical theory, and based on the goal of formulating and developing a useful vector-valued theory.

     

Relativistically Covariant Quantum Field Theory of the Maslov Complex Germ

We consider an explicitly covariant formulation of the quantum field theory of the Maslov complex germ (semiclassical field theory) in the example of a scalar field. The main object in the theory is the “semiclassical bundle” whose base is the set of classical states and whose fibers are the spaces of states of the quantum theory in an external field. The respective semiclassical states occurring in the Maslov complex germ theory at a point and in the theory of Lagrangian manifolds with a complex germ are represented by points and surfaces in the semiclassical bundle space. We formulate semiclassical analogues of quantum field theory axioms and establish a relation between the covariant semiclassical theory and both the Hamiltonian formulation previously constructed and the axiomatic field theory constructions Schwinger sources, the Bogoliubov S-matrix, and the Lehmann-Symanzik-Zimmermann R-functions. We propose a new covariant formulation of classical field theory and a scheme of semiclassical quantization of fields that does not involve a postulated replacement of Poisson brackets with commutators.__________Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 144, No. 3, pp. 492–512, September, 2005.     

Beyond elementary catastrophe theory

We give a brief discussion of the relations between elementary catastrophe theory, general catastrophe theory, singularity theory, bifurcation theory, and topological dynamics. This is intended to clarify the status, and potential applicability, of “catastrophe theory,” a phrase used by different authors and at different times with different meanings. Catastrophe theory has often been criticized for (supposed) applicability only to gradient systems of differential equations; but properly speaking this criticism can apply only to the elementary version of the theory (where it is in any case wrong). Roughly speaking, elementary catastrophe theory deals with the singularities of real-valued functions, general catastrophe theory with singularities of flows. Between these lies singularity theory, which deals with vector-valued functions. All relate strongly to bifurcation theory and topological dynamics. The issue is more subtle than it appears to be, and we describe an example where elementary catastrophe theory has been used to solve a long-standing problem about nongradient flows: degenerate Hopf bifurcation.     

A consistent second-order plate theory for monotropic material

Mathematical homogenization (or averaging) of composite materials, such as fibre laminates, often leads to non-isotropic homogenized (averaged) materials. Especially the upcoming importance of these materials increases the need for accurate mechanical models of non-isotropic shell-like structures. We present a second-order (or: Reissner-type) theory for the elastic deformation of a plate with constant thickness for a homogeneous monotropic material. It is equivalent to Kirchhoff's plate theory as a first-order theory for the special case of isotropy and, furthermore, shear-deformable and equivalent to R. Kienzler's theory as a second-order theory for isotropy, which implies further equivalences to established shear-deformable theories, especially the Reissner-Mindlin theory and Zhilin's plate theory. Details of the derivation of the theory will be published in a forthcoming paper [3]. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

An Interpretation of the Zermelo-Fraenkel Set Theory and the Kelley-Morse Set Theory in a Positive Theory

An interesting positive theory is the GPK theory. The models of this theory include all hyperuniverses (see [5] for a definition of these ones). Here we add a form of the axiom of infinity and a new scheme to obtain GPK_∞⁺. We show that in these conditions, we can interprete the Kelley-Morse theory (KM) in GPK_∞⁺ (Theorem 3.7). This needs a preliminary property which give an interpretation of the Zermelo-Fraenkel set theory (ZF) in GPK_∞⁺. We also see what happens in the original GPK theory. Before doing this, we first need to study the basic properties of the theory. This is done in the first two sections.     

Some fixed point results on a metric space with a graph

Combining some branches is a typical activity in different fields of science, especially in mathematics. Naturally, it is notable in fixed point theory. Over the past few decades, there have been a lot of activity in fixed point theory and another branches in mathematics such differential equations, geometry and algebraic topology. In 2006, Espinola and Kirk made a useful contribution on combining fixed point theory and graph theory. Recently, Reich and Zaslavski studied a new inexact iterative scheme for fixed points of contractive and nonexpansive multifunctions. In this paper, by using main idea of their work and the idea of combining fixed point theory and graph theory, we present some iterative scheme results for G-contractive and G-nonexpansive mappings on graphs.     

An asymptotic derivation of weakly nonlinear ray theory

Using a method of expansion similar to Chapman-Enskog expansion, a new formal perturbation scheme based on high frequency approximation has been constructed. The scheme leads to an eikonal equation in which the leading order amplitude appears. The transport equation for the amplitude has been deduced with an errorO(ε²) where ε is the small parameter appearing in the high frequency approximation. On a length scale over which Choquet-Bruhat’s theory is valid, this theory reduces to the former. The theory is valid on a much larger length scale and the leading order terms give the weakly nonlinear ray theory (WNLRT) of Prasad, which has been very successful in giving physically realistic results and also in showing that the caustic of a linear theory is resolved when nonlinear effects are included. The weak shock ray theory with infinite system of compatibility conditions also follows from this theory.     

Local set theory

In 1945, Eilenberg and MacLane introduced the new mathematical notion of category. Unfortunately, from the very beginning, category theory did not fit into the framework of either Zermelo—Fraenkel set theory or even von Neumann—Bernays—Gödel set-class theory. For this reason, in 1959, MacLane posed the general problem of constructing a new, more flexible, axiomatic set theory which would be an adequate logical basis for the whole of naïve category theory. In this paper, we give axiomatic foundations for local set theory. This theory might be one of the possible solutions of the MacLane problem.     

A minimalist two-level foundation for constructive mathematics

We present a two-level theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin.One level is given by an intensional type theory, called Minimal type theory. This theory extends a previous version with collections.The other level is given by an extensional set theory that is interpreted in the first one by means of a quotient model.This two-level theory has two main features: it is minimal among the most relevant foundations for constructive mathematics; it is constructive thanks to the way the extensional level is linked to the intensional one which fulfills the “proofs-as-programs” paradigm and acts as a programming language.     

Effectiveness in RPL, with applications to continuous logic

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of ?ukasiewicz logic) and continuous logic, and prove effective versions of some related theorems in model theory. We show how to reduce continuous logic to rational Pavelka logic. We also define notions of computability and decidability of a model for logics with computable, but uncountable, set of truth values; we show that provability degree of a formula with respect to a linear theory is computable, and use this to carry out an effective Henkin construction. Therefore, for any effectively given consistent linear theory in continuous logic, we effectively produce its decidable model. This is the best possible, since we show that the computable model theory of continuous logic is an extension of computable model theory of classical logic. We conclude with noting that the unique separable model of a separably categorical and computably axiomatizable theory (such as that of a probability space or an L^p Banach lattice) is decidable.     

Classification and statistics of finite index subgroups in free products

The principal theme of this paper is the enumeration of finite index subgroups Δ in a free product Γ of finite groups under various restrictions on the isomorphism type of Δ. In particular, we completely resolve the realization, asymptotic, and distribution problems for free products Γ of cyclic groups of prime order (prior to this work, these questions were wide open even in the case of the classical modular group). This complex of problems, usually referred to as Poincaré-Klein Problem, originally arose around 1880 out of the work of Klein and Poincaré on automorphic functions and related number theory, but has also grown roots in geometric function theory and, more recently, in the theory of subgroup growth. Ideas and techniques from the theory of generalized permutation representations (an enumerative theory of wreath product representations recently developed by the first named author) play a fundamental role here. Other tools come from analytic number theory, combinatorics, and probability theory.     

Local set theory

In 1945, Eilenberg and MacLane introduced the new mathematical notion of category. Unfortunately, from the very beginning, category theory did not fit into the framework of either Zermelo—Fraenkel set theory or even von Neumann—Bernays—Gödel set-class theory. For this reason, in 1959, MacLane posed the general problem of constructing a new, more flexible, axiomatic set theory which would be an adequate logical basis for the whole of naïve category theory. In this paper, we give axiomatic foundations for local set theory. This theory might be one of the possible solutions of the MacLane problem.Translated from Matematicheskie Zametki, vol. 77, no. 2, 2005, pp. 194–212.Original Russian Text Copyright © 2005 by V. K. Zakharov.This revised version was published online in April 2005 with a corrected issue number.     

Universal theory of dynamical chaos in nonlinear dissipative systems of differential equations

The article presents a new universal theory of dynamical chaos in nonlinear dissipative systems of differential equations, including autonomous and nonautonomous ordinary differential equations (ODE), partial differential equations, and delay differential equations. The theory relies on four remarkable results: Feigenbaum’s period doubling theory for cycles of one-dimensional unimodal maps, Sharkovskii’s theory of birth of cycles of arbitrary period up to cycle of period three in one-dimensional unimodal maps, Magnitskii’s theory of rotor singular point in two-dimensional nonautonomous ODE systems, acting as a bridge between one-dimensional maps and differential equations, and Magnitskii’s theory of homoclinic bifurcation cascade that follows the Sharkovskii cascade. All the theoretical propositions are rigorously proved and illustrated with numerous analytical examples and numerical computations, which are presented for all classical chaotic nonlinear dissipative systems of differential equations.     

On the decision problem for theories of finite models

An infinite extension of the elementary theory of Abelian groups is constructed, which is proved to be decidable, while the elementary theory of its finite models is shown to be undecidable. Tarski’s proof of undecidability for the elementary theory of Abelian cancellation semigroups is presented in detail. Szmielew’s proof of the decidability of the elementary theory of Abelian groups is used to prove the decidability of the elementary theory of finite Abelian groups, and an axiom system for this theory is exhibited. It follows that the elementary theory of Abelian cancellation semigroups, while undecidable, has a decidable theory of finite models.     

Non-Deterministic Closure Theory and Universal Arrows

Traditional closure theory discusses the closure operations on orders with graph-theoretic methods, or the reflectors on skeletal categories with category-theoretic methods. Both approaches are confined, like most of classical mathematics, to total and deterministic operations. So traditional closure theory makes it possible to define the semantics of the while-do commands only for terminating and deterministic programming. This paper outlines a closure theory for relations which transcend totality and determinism. For the sake of conciseness, the language used is that of graph theory but the methods are category-theoretic and some hints are offered for a possible translation into the language of category theory. Our basic idea is that closure relations consist of universal arrows in the sense of category theory. The new closure theory is appropriate for defining a semantics of the while-do commands both for terminating, deterministic programming and for non-terminating, non-deterministic programming.     

Algebraic cobordism revisited

We define a cobordism theory in algebraic geometry based on normal crossing degenerations with double point singularities. The main result is the equivalence of double point cobordism to the theory of algebraic cobordism previously defined by Levine and Morel. Double point cobordism provides a simple, geometric presentation of algebraic cobordism theory. As a corollary, the Lazard ring given by products of projective spaces rationally generates all nonsingular projective varieties modulo double point degenerations. Double point degenerations arise naturally in relative Donaldson–Thomas theory. We use double point cobordism to prove all the degree 0 conjectures in Donaldson–Thomas theory: absolute, relative, and equivariant.     

Reliability analysis in uncertain random system

Reliability analysis of a system based on probability theory has been widely studied and used. Nevertheless, it sometimes meets with one problem that the components of a system may have only few or even no samples, so that we cannot estimate their probability distributions via statistics. Then reliability analysis of a system based on uncertainty theory has been proposed. However, in a general system, some components of the system may have enough samples while some others may have no samples, so the reliability of the system cannot be analyzed simply based on probability theory or uncertainty theory. In order to deal with this type systems, this paper proposes a method of reliability analysis based on chance theory which is a generalization of both probability theory and uncertainty theory. In order to illustrate the method, some common systems are considered such as series system, parallel system, k-out-of-n system and bridge system.     

Lie algebras and recurrence relations I

We study representations of the Heisenberg-Weyl algebra and a variety of Lie algebras, e.g., su(2), related through various aspects of the spectral theory of self-adjoint operators, the theory of orthogonal polynomials, and basic quantum theory. The approach taken here enables extensions from the one-variable case to be made in a natural manner. Extensions to certain infinite-dimensional Lie algebras (continuous tensor products, q-analogs) can be found as well. Particularly, we discuss the relationship between generating functions and representations of Lie algebras, spectral theory for operators that lead to systems of orthogonal polynomials and, importantly, the precise connection between the representation theory of Lie algebras and classical probability distributions is presented via the notions of quantum probability theory. Coincidentally, our theory is closed connected to the study of exponential families with quadratic variance in statistical theory.     

On the computational complexity of the theory of Abelian groups

We develop a series of Ehrenfeucht games and prove the following results:

• 1.(i) The first order theory of the divisible and indecomposable p-group, the first order theory of the group of rational numbers with denominators prime to p and the first order theory of a cyclic group of prime power order can be decided in 2^{2cn log n} Turing time.
• 2.(ii) The first order theory of the direct sum of countably many infinite cyclic groups, the first order theory of finite Abelian groups and the first order theory of all Abelian groups can be decided in 2^2dn Turing space.