A Time Domain Characterization of 2-Microlocal Spaces

In Kolwankar and Lévy Véhel, new functional spaces, denoted $K^{s,s}_{x_0}$, were introduced. These spaces characterize the fine local regularity of functions, much in the spirit of 2-microlocal spaces $C^{s,s}_{x_0}$. In contrast with $\C^{s,s}_{x_0}$ spaces, however, $K^{s,s}_{x_0}$ spaces are defined through simple estimations on the pointwise values of the functions. In this work, we generalize the definition of $K^{s,s}_{x_0}$ spaces and prove the equality $C^{s,s}_{x_0}=K^{s,s}_{x_0}$ for $s+s>0$, $s>0$. Using this result, we propose an algorithm able to estimate a part of the 2-microlocal frontier. Experiments on sampled data show that reasonable accuracy is achieved even for difficult functions such as continuous but nowhere differentiable ones. As a by-product, robust estimators of both the pointwise and the local exponents are obtained.     

Powers of the Euler product and commutative subalgebras of a complex simple Lie algebra

If is a complex simple Lie algebra, and k does not exceed the dual Coxeter number of , then the absolute value of the k^th coefficient of the power of the Euler product may be given by the dimension of a subspace of defined by all abelian subalgebras of of dimension k. This has implications for all the coefficients of all the powers of the Euler product. Involved in the main results are Dale Petersons 2^rank theorem on the number of abelian ideals in a Borel subalgebra of , an element of type and my heat kernel formulation of Macdonalds -function theorem, a set D_alcove of special highest weights parameterized by all the alcoves in a Weyl chamber (generalizing Young diagrams of null m-core when ), and the homology and cohomology of the nil radical of the standard maximal parabolic subalgebra of the affine Kac–Moody Lie algebra.     

On Aperiodic Relational Morphisms

We characterize aperiodic relational morphisms as those that are injective on regular $\H$-classes. This result is applied to obtain simple proofs and generalizations of McAlisters results on joins of aperiodic semigroups and groups. Also, we show that if $\pv H$ is a proper, non-trivial pseudovariety of groups, then \[\pv A\ast \pv H\subsetneq (\pv A\ast \pv G)\cap \ov {\pv H}.\] We provide coordinate-free formulations and proofs of Rhodess Presentation Lemma and generalizations. As an application, we give simpler proofs of Tilsons theorem on the complexity of semigroups with at most $2$ non-zero $\J$-classes and Rhodess theorem that complexity is not local.     

Almost Connected Orders

One of the standard axioms for semiorders states that no three-point chain is incomparable to a fourth point. We refer to asymmetric relations satisfying this axiom as almost connected orders or ac-orders. It turns out that any relation lying between two weak orders, one of which covers the other for inclusion, is an ac-order (albeit of a special kind). Every ac-order is bracketed in a natural way by two weak orders, one the maximum in the set of weak orders included in the ac-order, and the other minimal, but not necessarily the minimum, in the set of weak orders that include the ac-order. The family of ac-orders on a finite set with at least five elements is not well graded (in the sense of Doignon and Falmagne, 1997). However, such a family is both upgradable and downgradable, as every nonempty ac-order contains a pair whose deletion defines an ac-order on the same set, and for every ac-order which is not a chain, there is a pair whose addition gives an ac-order.     

Optimal transformations for prediction in continuous-time stochastic processes: finite past and future

In the classical Wiener-Kolmogorov linear prediction problem, one fixes a linear functional in the future of a stochastic process, and seeks its best predictor (in the L²-sense). In this paper we treat a variant of the prediction problem, whereby we seek the most predictable non-trivial functional of the future and its best predictor; we refer to such a pair (if it exists) as an optimal transformation for prediction. In contrast to the Wiener-Kolmogorov problem, an optimal transformation for prediction may not exist, and if it exists, it may not be unique. We prove the existence of optimal transformations for finite past and future intervals, under appropriate conditions on the spectral density of a weakly stationary, continuous-time stochastic process. For rational spectral densities, we provide an explicit construction of the transformations via differential equations with boundary conditions and an associated eigenvalue problem of a finite matrix.This research was partially supported by ARO (MURI grant) DAAH04-96-1-0445, NSF grant DMS-0074276, and CNPq grant 301179/00-0.     

On the addition of convex sets in the hyperbolic plane

Analogue to the definition $K + L := \bigcup_{x\in K}(x + L)$ of the Minkowski addition in the euclidean geometry it is proposed to define the (noncommutative) addition $K \vdash L := \bigcup_{0\, \leqsl\, \rho\,\leqsl\, a(\varphi),0\,\leqsl\,\varphi\,<\, 2\pi}T_{\rho}^{(\varphi)}(L)$ for compact, convex and smoothly bounded sets K and L in the hyperbolic plane $\Omega$ (Kleins model). Here $\rho = a(\varphi)$ is the representation of the boundary $\partial$ K in geodesic polar coordinates and $T_{\rho}^{(\varphi)}$ is the hyperbolic translation of $\Omega$ of length $\rho$ along the line through the origin o of direction $\varphi$. In general this addition does not preserve convexity but nevertheless we may prove as main results: (1) $o \in$ int $K, o \in$ int L and K,L horocyclic convex imply the strict convexity of $K \vdash L$, and (2) in this case there exists a hyperbolic mixed volume $V_h(K,L)$ of K and L which has a representation by a suitable integral over the unit circle.     

Constructive Axiomatic Approach to the Determination of the Orbit Spaces of Coregular Compact Linear Groups

We review the proposal of a constructive axiomatic approach to the determination of the orbit spaces of all the real compact linear groups, obtained through the computation of a metric matrix , which is defined only in terms of the scalar products between the gradients p₁(x),...,p_q(x) of the elements of a minimal integrity basis (MIB) for the ring [ⁿ]^G of G-invariant polynomials. The domain of semi-positivity of is known to realize the orbit space ⁿ/G of G as a semi-algebraic variety in the space ^q spanned by the variables p₁,...,p_q. The matrices can be obtained from the solutions of a universal differential equation (master equation), which satisfy convenient initial conditions. The master equation and the initial conditions involve as free parameters only the degrees d_a of the p_a(x)s. This approach tries to bypass the actual impossibility of explicitly determining a set of basic polynomial invariants for each group. Our results may be relevant in physical contexts where the study of covariant or invariant functions is important, like in the determination of patterns of spontaneous symmetry breaking in quantum field theory, in the analysis of phase spaces and structural phase transitions (Landaus theory), in covariant bifurcation theory, in crystal field theory and so on. Mathematics Subject Classifications (2000) 14L24, 13A50, 14L30.This paper is partially supported by INFN and MURST 40% and 60%.     

Weyl’s Theorem for Algebraically Paranormal Operators

Let T be an algebraically paranormal operator acting on Hilbert space. We prove : (i) Weyls theorem holds for f(T) for every f $\in$ H((T)); (ii) a-Browders theorem holds for f(S) for every S $\prec$ T and f $\in$ H((S)); (iii) the spectral mapping theorem holds for the Weyl spectrum of T and for the essential approximate point spectrum of T.     

Almost Integer Translates. Do Nice Generators Exist?

It has been shown earlier by the first author that for any nonzero perturbation of the integers $\lambda_n=n+o(1), \lambda_n\ne n$, there is a \textit{generator,} that is a function $\varphi\in L^2(\mathbf{R})$ such that the system of translates $\{\varphi(x-\lambda_n)\}$ is complete in $L^2(\mathbf{R})$. We ask if $\varphi$ can be chosen with fast decay. We prove that in general it cannot. On the other hand, if the perturbations are quasianalytically small, than it can, and this decay restriction is sharp. A certain class of complex measures which we call shrinkable is introduced, and it is shown that the zeros sets of such measures do dot admit generators with fast decay.     

Imperfect and Nonideal Clutters: A Common Approach

We prove three theorems. First, Lovászs theorem about minimal imperfect clutters, including also Padbergs corollaries. Second, Lehmans result on minimal nonideal clutters. Third, a common generalization of these two. The endeavor of working out a common denominator for Lovászs and Lehmans theorems leads, besides the common generalization, to a better understanding and simple polyhedral proofs of both.* Visiting of the French Ministry of Research and Technology, laboratoire LEIBNIZ, Grenoble, November 1995—April 1996.     

Covering Things with Things

An abstract NP-hard covering problem is presented and fixed-parameter tractable algorithms for this problem are described. The running times of the algorithms are expressed in terms of three parameters: $n$, the number of elements to be covered, $k$, the number of sets allowed in the covering, and $d$, the combinatorial dimension of the problem. The first algorithm is deterministic and has a running time of $O(k^{dk}n)$. The second algorithm is also deterministic and has a running time of $O(k^{d(k+1)}+n^{d+1})$. The third is a Monte-Carlo algorithm that runs in time $O(\runtime)$ and is correct with probability $1-n^{-c}$. Here, the $O$ notation hides factors that are polynomial in $d$. These algorithms lead to fixed-parameter tractable algorithms for many geometric and non-geometric covering problems.     

Some New Transversality Properties

The theorems of Ceva and Menelaus are concerned with cyclic products of ratios of lengths of collinear segments of triangles or more general polygons. These segments have one endpoint at a vertex of the polygon and one at the intersection point of a side with a suitable line. To these classical results we have recently added a selftransversality theorem in which the suitable line is determined by two other vertices. Here we present additional transversality properties in which the suitable line is determined either by a vertex and the intersection point of two diagonals, or by the intersection points of two pairs of such diagonals. Unexpectedly it turns out that besides several infinite families of systematic cases there are also a few sporadic cases.     

A commutativity criterion for certain algebras of invariant differential operators on nilpotent homogeneous spaces

Let G be a connected, simply connected real nilpotent Lie group with Lie algebra , H a connected closed subgroup of G with Lie algebra and f a linear form on satisfying f([, ]) = {0} Let _f be the unitary character of H with differential at the origin. Let _f be the unitary representation of G induced from the character _f of H. We consider the algebra (, , f) of differential operators invariant under the action of G on the bundle with basis G/H associated to these data. We show that (, , f) is commutative if and only if _f is of finite multiplicities. This proves a conjecture of Corwin-Greenleaf and Duflo. Mathematics Subject Classification (1991):43A80, 43A85, 22E25, 22E27, 22E30UMR n 7539 du CNRS, Analyse, Géométrie et Applications.UMR n 7586 du CNRS, Théorie des Groupes, Représentations, Applications.     

On the Solvability and Asymptotics of Solutions of One Functional Differential Equation with Singularity

We prove the existence of continuously differentiable solutions with required asymptotic properties as t +0 and determine the number of solutions of the following Cauchy problem for a functional differential equation:

An extension of Willard’s Finite Basis Theorem: Congruence meet-semidistributive varieties of finite critical depth

Ross Willard proved that every congruence meet-semidistributive variety of algebras that has a finite residual bound and a finite signature can be axiomatized by some finite set of equations. We offer here a simplification of Willards proof, avoiding its use of Ramseys Theorem. This simplification also extends Willards theorem by replacing the finite residual bound with a weaker condition.In Celebration of the Sixtieth Birthday of Ralph N. McKenzieReceived February 26, 2004; accepted in final form August 2, 2004.     

Produktintegration mit nicht-äquidistanten Stützstellen

Summary For the numerical evaluation of , 0<<1 andx smooth, product integration rules are applied. It is known that high-order rules, e.g. Gauss-Legendre quadrature, become normal-order rules in this case. In this paper it is shown that the high order is preserved by a nonequidistant spacing. Furthermore, the leading error terms of this product integration method and numerical examples are given.

     

Subsemigroups of Completely Simple Semigroups and Weak Convergence of Convolution Products of Probability Measures

Let $S$ be a completely simple semigroup with a \underline{given} Rees product structure $A\times B\times C$. A subsemigroup of $S$ will be called a product subsemigroup of $A\times B\times C$ if it can be represented as $A\times B\times C$, where $A\subset A$, $B\subset B$ and $C\subset C$. Such subsemigroups appear when we look into the question of weak convergence of convolution products of (not necessarily identical) probability measures on certain topological semigroups. The reason is that the supports of tail-idempotents in the set of weak limit points of these convolution products are completely simple subsemigroups. The main result of this paper, Theorem 3.3, gives general sufficient conditions for the weak convergence of convolution products.     

Détecteur de tridents dans les émulsions photographiques nucléaires

Summary The direct creation of an electron-positron pair by a high-energy charged particle manifests itself in a certain type of track configuration which is known as a trident. A device for automatic scanning and detection of tridents in nuclear emulsion is described. The device consists of two main parts: a TV camera which analyses the magnified image of the emulsion and a logical detection unit which counts all the observed tracks and also counts the track configurations which may correspond to tridents. The performance of the apparatus is discussed.     

‘Outside’ as a primitive notion in constructive projective geometry

In intuitionistic (or constructive) geometry there are positive counterparts, apart and outside, of the relations = and incident. In this paper it is shown that the relation outside suffices to define incident, apart and equality. The equivalence of the new system with Heyting's system is shown and as a simple corollary one obtains duality for intuitionistic projective geometry.     

Statistical ensemble error bounds for homogenized microheterogeneous solids

Typically, in order to characterize the homogenized effective macroscopic response of new materials possessing random heterogeneous microstructure, a relation between averages is sought, where and where and are the stress and strain tensor fields within a statistically representative volume element (SRVE) of volume ||. The quantity, is known as the effective property, and is the elasticity tensor used in usual macroscale analyses. In order to generate homogenized responses computationally, a series of detailed boundary value representations resolving the heterogeneous microstructure, posed over the SRVEs domain, must be solved. This requires an enormous numerical effort that can overwhelm most computational facilities. A natural way of generating an approximation to the SRVEs response is by first computing the response of smaller (subrepresentative) samples, each with a different random realization of the microstructural type under investigation, and then to ensemble average the results afterwards. Compared to a direct simulation of an SRVE, testing many small samples is a computationally inexpensive process since the number of floating point operations is greatly reduced, as well as the fact that the samples responses can be computed trivially in parallel. However, there is an inherent error in this process. Clearly the populations ensemble average is not the SRVEs response. However, as shown in this work, the moments on the distribution of the population can be used to generate rigorous upper and lower error bounds on the quality of the ensemble-generated response. Two-sided bounds are given on the SRVE response in terms of the ensemble average, its standard deviation and its skewness.Received: December 11, 2001