Boolean spaces with countable base but uncountably many orbits

We construct two Boolean spaces with countable bases which have continuum many orbits. Two points are in the same orbit iff there is a homeomorphism of the space which carries one to the other. One of our examples is a primitive Boolean space. J. Donald Monk posed these problems. We don't know if there is a countably based Boolean space with exactly ₁ orbits.Presented by R. S. Pierce.     

Universal categories of uniform and metric locales

Recall that a category is called universal if it contains an isomorphic copy of any concrete category as a full subcategory. In particular, if is universal then every monoid can be represented as the endomorphism monoid of an object in . A major obstacle to universality in categories of topological nature are the constant maps (which prevent, for instance, representing nontrivial groups as endomorphism monoids). Thus, to obtain, say, a universal category of uniform spaces, the constants have to be prohibited by artificial additional conditions (for instance, conditions of an openness type). Since in generalized spaces (locales) we do not necessarily have points, the question naturally arises as to whether we can get rid of surplus conditions in search of universality there. In this paper we prove that the category of uniform locales with all uniform morphisms is universal. Indeed we establish the universality already for the subcategory of very special uniform locales, namely Boolean metric ones. Moreover, universality is also obtained for more general morphisms, such as Cauchy morphisms, as well as for special metric choices of morphisms (contractive, Lipschitz). The question whether one can avoid uniformities remains in general open: we do not know whether the category of all locales with all localic morphisms is universal. However, the answer is final for the Boolean case: by a result of McKenzie and Monk ([10], see Section 4) one cannot represent groups by endomorphisms of Boolean algebras without restriction by an additional structure.We use only basic categorical terminology, say, that from the introductory chapters of [9]. All the necesasary facts concerning generalized spaces (frames, locales) and universality are explicitly stated. More detail on frames (locales) can be found in [8] and on universality and embeddings of categories in [11].Presented by E. Fried.     

Higher order asymptotics in estimation for two-sided Weibull type distributions

We consider the estimation problem of a location parameter on a sample of size n from a two-sided Weibull type density % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiiYdd9qrFfea0dXdf9vqai-hEir8Ve% ea0de9qq-hbrpepeea0db9q8as0-LqLs-Jirpepeea0-as0Fb9pgea% 0lrP0xe9Fve9Fve9qapdbaqaaeGacaGaaiaabeqaamaabaabcaGcba% GaamOzaiaacIcacaWG4bGaeyOeI0IaeqiUdeNaaiykaiabg2da9iaa% doeacaGGOaGaeqySdeMaaiykaiGacwgacaGG4bGaaiiCaiaacIcacq% GHsislcaGG8bGaamiEaiabgkHiTiabeI7aXjaacYhadaahaaWcbeqa% aiabeg7aHbaakiaacMcaaaa!52AD!\[f(x - \theta ) = C(\alpha )\exp ( - |x - \theta |^\alpha )\] for –<x<, –<< and 1<a<3/2, where % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiiYdd9qrFfea0dXdf9vqai-hEir8Ve% ea0de9qq-hbrpepeea0db9q8as0-LqLs-Jirpepeea0-as0Fb9pgea% 0lrP0xe9Fve9Fve9qapdbaqaaeGacaGaaiaabeqaamaabaabcaGcba% Gaam4qaiaacIcacqaHXoqycaGGPaGaeyypa0JaeqySdeMaai4laiaa% cUhacaaIYaGaeu4KdCKaaiikaiaaigdacaGGVaGaeqySdeMaaiykai% aac2haaaa!4B0E!\[C(\alpha ) = \alpha /\{ 2\Gamma (1/\alpha )\} \]. Then the bound for the distribution of asymptotically median unbiased estimators is obtained up to the 2a-th order, i.e., the order % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiiYdd9qrFfea0dXdf9vqai-hEir8Ve% ea0de9qq-hbrpepeea0db9q8as0-LqLs-Jirpepeea0-as0Fb9pgea% 0lrP0xe9Fve9Fve9qapdbaqaaeGacaGaaiaabeqaamaabaabcaGcba% GaamOBamaaCaaaleqabaGaeyOeI0IaaiikaiaaikdacqaHXoqycqGH% sislcaaIXaGaaiykaiaac+cacaaIYaaaaaaa!4444!\[n^{ - (2\alpha - 1)/2} \]. The asymptotic distribution of a maximum likelihood estimator (MLE) is also calculated up to the 2a-th order. It is shown that the MLE is not 2a-th order asymptotically efficient. The amount of the loss of asymptotic information of the MLE is given.     

Products of regular cardinals and cardinal invariants of products of Boolean algebras

We answer some questions of Monk, and give some information on others concerning cardinal invariants of Boolean algebras under ultraproducts and products. The author would like to thank the United States-Israel Binational Science Foundation for partially supporting this research, and Alice Leonhardt for the beautful typing. Publication no. 345. §1–4 of this paper are essentially the letters which the author sent in December 1987 to Monk solving problems from his notes on cardinal invariants of B.A.; §8 and §9 were written for §4; the other sections, §§5, 6 and 7, were completed in March 1988. Concerning §§5–9, for further results see Abstracts of AMS and subsequent papers. §10 was written during the Arcata meeting, summer 1985, and §11 in January 1986, after questions of Todorcevic.     

On ultraproducts of Boolean algebras and irr

1. Consistent inequality [We prove the consistency of irrirr(B_i)/D where D is an ultrafilter on and each B_i is a Boolean algebra and irr(B) is the maximal size of irredundant subsets of a Boolean algebra B, see full definition in the text. This solves the last problem, 35, of this form from Monk's list of problems in [M2]. The solution applies to many other properties, e.g. Souslinity.] 2. Consistency for small cardinals [We get similar results with =₁ (easily we cannot have it for =₀) and Boolean algebras B_i (i<) of cardinality .] This article continues Magidor Shelah [MgSh:433] and Shelah Spinas [ShSi:677], but does not rely on them: see [M2] for the background. I would like to thank Alice Leonhardt for the beautiful typing. This research was partially supported by the Israel Science Foundation. Publication 703     

An Upper Bound on the Number of Iterations for Transforming a Boolean Function of Degree Greater or Equal Than 4 to a Function of Degree 3

The difficulty involved in characterizing the weight distribution of all Boolean functions of degree 3 is well-known [2, p. 446]. In [1] the author introduces a transformation on Boolean functions which changes their weights in a way that is easy to follow, and which, when iterated, reduces the degree of the function to 2 or 3. He concludes that it is just as difficult to characterize the weight of any function of degree 3 as it is for any other degree. The application of this transformation on a Boolean function defined on , increases the number of its variables by two. On the other hand, in order to reduce the degree of a function to 2 or 3 it is necessary to apply the tranformation a number of times that grows exponentially with respect to m. In this paper, a factorization method on Boolean functions that allows the establishment of an upper bound for the number of applications of the transformation is presented. It shows that, in general, it is possible to significantly decrease the number of iterations in this process of degree reduction.     

A characterization of certain discrete exponential families

For independent random variables X and Y, define % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiaabofaruWrL9MCNLwyaGqbciaa-bcacqGHHjIUcaWFGaGaa8hw% aiaa-TcacaWFzbaaaa!4551!\[{\rm{S}} \equiv X + Y\]. When the conditional expectations % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiaadweacaGGBbqefCuzVj3zPfgaiuGajaaqcaWFNbGccaGGOaGa% amiwaiaacMcacaGG8bGaam4uaiaac2facqGHHjIUcaWGHbGaaiikai% aadofacaGGPaaaaa!4BC4!\[E[g(X)|S] \equiv a(S)\]and % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiaadweacaGGBbGaamiAaiaacIcacaWGybGaaiykaiaacYhacaWG% tbGaaiyxaiabggMi6kaadkgacaGGOaGaam4uaiaacMcaaaa!4894!\[E[h(X)|S] \equiv b(S)\]are given, then under certain assumptions, the density function of X has the form of u(x)k()e^ax, where u(x) is uniquely determined by the functions a(·) and b(·).     

Commutators and decompositions of orthomodular lattices

We show that in any complete OML (orthomodular lattice) there exists a commutatorc such that [0,c ] is a Boolean algebra. This fact allows us to prove that a complete OML satisfying the relative centre property is isomorphic to a direct product [0,a] × [0,a ] wherea is a join of two commutators, [0,a] is an OML without Boolean quotient and [0,a ] is a Boolean algebra. The proof uses a new characterization of the relative centre property in complete OMLs. In a final section, we specify the previous direct decomposition in the more particular case of locally modular OMLs.     

Global well-posedness of the critical Burgers equation in critical Besov spaces

We make use of the method of modulus of continuity [A. Kiselev, F. Nazarov, R. Shterenberg, Blow up and regularity for fractal Burgers equation, Dyn. Partial Differ. Equ. 5 (2008) 211-240] and Fourier localization technique [H. Abidi, T. Hmidi, On the global well-posedness of the critical quasi-geostrophic equation, SIAM J. Math. Anal. 40 (1) (2008) 167-185] [H. Abidi, T. Hmidi, On the global well-posedness of the critical quasi-geostrophic equation, SIAM J. Math. Anal. 40 (1) (2008) 167-185] to prove the global well-posedness of the critical Burgers equation t_∂u+ux_∂u+Λu=0 in critical Besov spaces with p∈[1,∞), where .     

Nonlinear optimization: Characterization of structural stability

We study global stability properties for differentiable optimization problems of the type: % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9qq-f0-yqaqVeLsFr0-vr% 0-vr0db8meaabaqaciGacaGaaeqabaWaaeaaeaaakeaacaWGqbGaai% ikaGqaaiaa-jzacaGGSaGaamisaiaacYcacaqGGaGaam4raiaacMca% caGG6aGaaeiiaiaab2eacaqGPbGaaeOBaiaabccacaWFsgGaaeikai% aadIhacaqGPaGaaeiiaiaab+gacaqGUbGaaeiiaiaad2eacaGGBbGa% amisaiaacYcacaWGhbGaaiyxaiabg2da9iaacUhacaWG4bGaeyicI4% CeeuuDJXwAKbsr4rNCHbacfaGae4xhHe6aaWbaaSqabeaacaWGUbaa% aOGaaiiFaiaabccacaWGibGaaiikaiaadIhacaGGPaGaeyypa0JaaG% imaiaacYcacaqGGaGaam4raiaacIcacaWG4bGaaiykamaamaaabaGa% eyyzImlaaiaaicdacaGG9bGaaiOlaaaa!6B2E!\[P(f,H,{\text{ }}G):{\text{ Min }}f{\text{(}}x{\text{) on }}M[H,G] = \{ x \in \mathbb{R}^n |{\text{ }}H(x) = 0,{\text{ }}G(x)\underline \geqslant 0\} .\] Two problems are called equivalent if each lower level set of one problem is mapped homeomorphically onto a corresponding lower level set of the other one. In case that P(% MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9qq-f0-yqaqVeLsFr0-vr% 0-vr0db8meaabaqaciGacaGaaeqabaWaaeaaeaaakeaaieaaceWFsg% GbaGaacaWFSaGaa8hiaiqadIeagaacaiaacYcacaWFGaGabm4rayaa% iaaaaa!3EBF!\[\tilde f, \tilde H, \tilde G\]) is equivalent with P(f, H, GG) for all (% MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9qq-f0-yqaqVeLsFr0-vr% 0-vr0db8meaabaqaciGacaGaaeqabaWaaeaaeaaakeaaieaaceWFsg% GbaGaacaWFSaGaa8hiaiqadIeagaacaiaacYcacaWFGaGabm4rayaa% iaaaaa!3EBF!\[\tilde f, \tilde H, \tilde G\]) in some neighbourhood of (f, H, G) we call P(f, H, G) structurally stable; the topology used takes derivatives up to order two into account. Under the assumption that M[H, G] is compact we prove that structural stability of P(f, H, GG) is equivalent with the validity of the following three conditions:

1. The Mangasarian-Fromovitz constraint qualification is satisfied at every point of M[H, G].
2. Every Kuhn-Tucker point of P(f, H, GG) is strongly stable in the sense of Kojima.
3. Different Kuhn-Tucker points have different (f-)values.

     

Unions of dihedral groups

By the following simple formula (1) $$\forall x \exists y (x = xyy, y = xyx)$$ We characterize semigroups from the title. Considering a local property of their ?-classes we get bands and Boolean groups as extreme cases of semigroups with that property. We also provide a construction showing that ?-classes can be sufficiently complicated (at least as Abelian groups are). Then we permute right-hand sides of identities in (1) getting Boolean semigroups (x³=x) and so-called anti-inverse semigroups. Finally we show that Boolean semigroups are a proper subclass of the intersection of anti-inverse semigroups and unions of dihedral groups.     

The preservation of Sahlqvist equations in completions of Boolean algebras with operators

Monk [1970] extended the notion of the completion of a Boolean algebra to Boolean algebras with operators. Under the assumption that the operators of such an algebra are completely additive, he showed that the completion of always exists and is unique up to isomorphisms over . Moreover, strictly positive equations are preserved under completions a strictly positive equation that holds in must hold in the completion of . In this paper we extend Monk’s preservation theorem by proving that certain kinds of Sahlqvist equations (as well as some other types of equations and implications) are preserved under completions. An example is given that shows that arbitrary Sahlqvist equations need not be preserved. Received May 3, 1998; accepted in final form October 7, 1998.     

Asymptotics for Amitsur's Capelli-type polynomials and verbally prime PI-algebras

We consider associativePI-algebras over a field of characteristic zero. The main goal of the paper is to prove that the codimensions of a verbally prime algebra [11] are asymptotically equal to the codimensions of theT-ideal generated by some Amitsur's Capelli-type polynomialsE _M,L ^* [1]. We recall that two sequencesa _n,b _nare asymptotically equal, and we writea _n ≃b _n,if and only if lim _n→∞(a _n/b _n)=1.In this paper we prove that % MathType!End!2!1!, whereG is the Grassmann algebra. These results extend to all verbally primePI-algebras a theorem of A. Giambruno and M. Zaicev [9] giving the asymptotic equality % MathType!End!2!1! between the codimensions of the matrix algebraM _k(F) and the Capelli polynomials. The second author is partially supported by grants RFFI 04-01-00739a, E02-2.0-26.     

RADIUS OF S-TARLIKENESS FOR THE CLASS S（a,n）

Abstract. In this paper we shall investigate the bound of staxlikvness r for the class     

The completeness of the isomorphism relation for countable Boolean algebras

We show that the isomorphism relation for countable Boolean algebras is Borel complete, i.e., the isomorphism relation for arbitrary countable structures is Borel reducible to that for countable Boolean algebras. This implies that Ketonen's classification of countable Boolean algebras is optimal in the sense that the kind of objects used for the complete invariants cannot be improved in an essential way. We also give a stronger form of the Vaught conjecture for Boolean algebras which states that, for any complete first-order theory of Boolean algebras that has more than one countable model up to isomorphism, the class of countable models for the theory is Borel complete. The results are applied to settle many other classification problems related to countable Boolean algebras and separable Boolean spaces. In particular, we will show that the following equivalence relations are Borel complete: the translation equivalence between closed subsets of the Cantor space, the isomorphism relation between ideals of the countable atomless Boolean algebra, the conjugacy equivalence of the autohomeomorphisms of the Cantor space, etc. Another corollary of our results is the Borel completeness of the commutative AF -algebras, which in turn gives rise to similar results for Bratteli diagrams and dimension groups.

     

Finite Euclidean graphs and Ramanujan graphs

We consider finite analogues of Euclidean graphs in a more general setting than that considered in [A. Medrano, P. Myers, H.M. Stark, A. Terras, Finite analogues of Euclidean space, J. Comput. Appl. Math. 68 (1996) 221-238] and we obtain many new examples of Ramanujan graphs. In order to prove these results, we use the previous work of [W.M. Kwok, Character tables of association schemes of affine type, European J. Combin. 13 (1992) 167-185] calculating the character tables of certain association schemes of affine type. A key observation is that we can obtain better estimates for the ordinary Kloosterman sum K(a,b;q). In particular, we always achieve , and in many (but not all) of the cases, instead of the well known . Also, we use the ideas of controlling association schemes, and the Ennola type dualities, in our previous work on the character tables of commutative association schemes. The method in this paper will be used to construct many more new examples of families of Ramanujan graphs in the subsequent paper.     

Baxter permutations

Chung et al. (1978) have proved that the number of Baxter permutations on [n] is

Viennot (1981) has then given a combinatorial proof of this formula, showing this sum corresponds to the distribution of these permutations according to their number of rises.

Cori et al. (1986), by making a correspondence between two families of planar maps, have shown that the number of alternating Baxter permutations on [2n+δ] is c_n+δc_n where c_n = (2n)!/(n + 1)!n! is the nth Catalan number.

In this paper, we establish a new one-to-one correspondence between Baxter permutations and three non-intersecting paths, which unifies Viennot (1981) and Cori et al. (1986). Moreover, we obtain more precise results for the enumeration of (alternating or not) Baxter permutations according to various parameters. So, we give a combinatorial interpretation of Mallows's formula (1979).     

Random graph approach to Gibbs processes with pair interaction

This study was motivated by the observation that, in a broad class of cases, the distribution of classical Gibbs point processes in R ^d governed by pair potential, can be obtained as the equilibrium distribution of a Markov chain of point processes in R ^d. Our analysis of this Markov chain is based on its imbedding in an infinite random graph. A condition of ergodicity of the chain is given in terms of the absence of percolation in the graph, and this can be checked in simpler cases. The embedding also suggests a stochastic construction for the equilibrium distribution in question.These constructions (which can also be of independent interest) are related to Gibbs processes by means of the results obtained in a recent paper of R. V. Ambartzumian and H. S. Sukiasian [1] where the existence of a new class of stationary point processes in R ^d was established which have density (correlation) functions of the form % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaqdbaWexLMBb50ujb% qegi0BVTgib5gDPfxDHbacfiGae8NKbmOae8hkaGIae8hEaG3aaSba% a4qaaiaabgdaaeqaa0Gaaiilaiaac6cacaGGUaGaaiOlaiaacYcaca% WG4bWaaSbaa4qaaiaad6gaaeqaa0GaaiykaiaabccacqGH9aqpcaqG% GaGaamOyamaaCaaaoeqabaGaamOBaaaanmaarababaGaamiAaiaacI% cacaWG4bWaaSbaa4qaaiaadMgaaeqaaaqaaiaad6gaaeqaniabg+Gi% vdGaeyOeI0IaamiEamaaBaaaoeaacaWGQbaabeaaniaacMcaaaa!56B6!\[f(x_{\text{1}} ,...,x_n ){\text{ }} = {\text{ }}b^n \prod\nolimits_n {h(x_i } - x_j )\] (here and below, % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaqdbaWaaebaaeaada% WgaaGdbaGaamOBaaqabaaabeqab0Gaey4dIunaaaa!38CA!\[\prod {_n } \] denotes a product taken over all two-subsets {i, j} {1,..., n}).