Colored operads,series on colored operads,and combinatorial generating systems

We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous grammars, allowing us to work with all these generating systems in a unified way. The theory of bud generating systems uses colored operads. Indeed, an object is generated by a bud generating system if it satisfies a certain equation in a colored operad. To compute the generating series of the languages of bud generating systems, we introduce formal power series on colored operads and several operations on these. Series on colored operads are crucial to express the languages specified by bud generating systems and allow us to enumerate combinatorial objects with respect to some statistics. Some examples of bud generating systems are constructed; in particular to specify some sorts of balanced trees and to obtain recursive formulas enumerating these.     

The stack of formal groups in stable homotopy theory

We construct the algebraic stack of formal groups and use it to provide a new perspective onto a recent result of M. Hovey and N. Strickland on comodule categories for Landweber exact algebras. This leads to a geometric understanding of their results as well as to a generalisation.     

基于三角范数的模糊逻辑中的三Ⅰ方法

三I推理方法是一种新的模糊推理方法,通过已有的研究成果表明,在许多方面它优于传统的CRI推理方法,它将成为模糊系统和人工智能的理论和应用研究中一个比较理想的推理机制。最近,国外学者提出了一个新的模糊逻辑形式系统,叫做Monoidal t-norm based logics(简记为MTL),已经证明这个形式系统是所有基于左连续三角范数的模糊逻辑的共同形式化。本文基于这类逻辑将三I推理方法形式化,从而在这些逻辑系统中为三推理方法找到了可靠的逻辑依据。     

线性逻辑和态极逻辑引论(Ⅱ)

本文是《线性逻辑和态极逻辑引论》一文的第二部分。文章致力于证明网(第1节)和态极逻辑(第2,3,4和5节)证明网部分尽管局限于其积线性逻辑框架,但仍不失其重要性。线性逻辑和态极逻辑均为Girard所创建,近期所发展起来的态极逻辑旨在于进一步揭示计算和逻辑的基本交互作用的本质。我们希望本文能对这一新的理论带来一些计算机科学方面的启示。     

Software Tools for Geometrical Problem Solving: Potentials and Pitfalls

Dynamic geometry software provides tools for students to construct and experiment with geometrical objects and relationships. On the basis of their experimentation, students make conjectures that can be tested with the tools available. In this paper, we explore the role of software tools in geometry problem solving and how these tools, in interaction with activities that embed the goals of teachers and students, mediate the problem solving process. Through analysis of successful student responses, we show how dynamic software tools can not only scaffold the solution process but also help students move from argumentation to logical deduction. However, by reference to the work of less successful students, we illustrate how software tools that cannot be programmed to fit the goals of the students may prevent them from expressing their (correct) mathematical ideas and thus impede their problem solution.This revised version was published online in September 2005 with corrections to the Cover Date.     

A partition-based approach towards constructing Galois (concept) lattices

Galois lattices and formal concept analysis of binary relations have proved useful in the resolution of many problems of theoretical or practical interest. Recent studies of practical applications in data mining and software engineering have put the emphasis on the need for both efficient and flexible algorithms to construct the lattice. Our paper presents a novel approach for lattice construction based on the apposition of binary relation fragments. We extend the existing theory to a complete characterization of the global Galois (concept) lattice as a substructure of the direct product of the lattices related to fragments. The structural properties underlie a procedure for extracting the global lattice from the direct product, which is the basis for a full-scale lattice construction algorithm implementing a divide-and-conquer strategy. The paper provides a complexity analysis of the algorithm together with some results about its practical performance and describes a class of binary relations for which the algorithm outperforms the most efficient lattice-constructing methods.     

On perturbations of strongly admissible prior distributions

Consider a parametric statistical model, P(dx|θ), and an improper prior distribution, ν(dθ), that together yield a (proper) formal posterior distribution, Q(dθ|x). The prior is called strongly admissible if the generalized Bayes estimator of every bounded function of θ is admissible under squared error loss. Eaton [M.L. Eaton, A statistical diptych: Admissible inferences-recurrence of symmetric Markov chains, Annals of Statistics 20 (1992) 1147–1179] used the Blyth–Stein Lemma to develop a sufficient condition, call it , for strong admissibility of ν. Our main result says that, under mild regularity conditions, if ν satisfies and g(θ) is a bounded, non-negative function, then the perturbed prior distribution g(θ)ν(dθ) also satisfies and is therefore strongly admissible. Our proof has three basic components: (i) Eaton's [M.L. Eaton, A statistical diptych: Admissible inferences-recurrence of symmetric Markov chains, Annals of Statistics 20 (1992) 1147–1179] result that the condition is equivalent to the local recurrence of the Markov chain whose transition function is R(dθ|η)=∫Q(dθ|x)P(dx|η); (ii) a new result for general state space Markov chains giving conditions under which local recurrence is equivalent to recurrence; and (iii) a new generalization of Hobert and Robert's [J.P. Hobert, C.P. Robert, Eaton's Markov chain, its conjugate partner and -admissibility, Annals of Statistics 27 (1999) 361–373] result that says Eaton's Markov chain is recurrent if and only if the chain with transition function is recurrent. One important application of our results involves the construction of strongly admissible prior distributions for estimation problems with restricted parameter spaces.     

Generalized conditional symmetries of evolution equations

We analyze the relationship of generalized conditional symmetries of evolution equations to the formal compatibility and passivity of systems of differential equations as well as to systems of vector fields in involution. Earlier results on the connection between generalized conditional invariance and generalized reduction of evolution equations are revisited. This leads to a no-go theorem on determining equations for operators of generalized conditional symmetry. It is also shown that up to certain equivalences there exists a one-to-one correspondence between generalized conditional symmetries of an evolution equation and parametric families of its solutions.     

On minimal Sturmian partial words

Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A_?=A∪{?}, where ? stands for a hole and matches (or is compatible with) every letter in A. The subword complexity of a partial word w, denoted by p_w(n), is the number of distinct full words (those without holes) over the alphabet that are compatible with factors of length n of w. A function f:N→N is (k,h)-feasible if for each integer N≥1, there exists a k-ary partial word w with h holes such that p_w(n)=f(n) for all n such that 1≤n≤N. We show that when dealing with feasibility in the context of finite binary partial words, the only affine functions that need investigation are f(n)=n+1 and f(n)=2n. It turns out that both are (2,h)-feasible for all non-negative integers h. We classify all minimal partial words with h holes of order N with respect to f(n)=n+1, called Sturmian, computing their lengths as well as their numbers, except when h=0 in which case we describe an algorithm that generates all minimal Sturmian full words. We show that up to reversal and complement, any minimal Sturmian partial word with one hole is of the form aⁱ?a^jba^l, where i,j,l are integers satisfying some restrictions, that all minimal Sturmian partial words with two holes are one-periodic, and that up to complement, ?(a^N−1?)^h−1 is the only minimal Sturmian partial word with h≥3 holes. Finally, we give upper bounds on the lengths of minimal partial words with respect to f(n)=2n, showing them tight for h=0,1 or 2.     

Infinitesimal Lifting and Jacobi Criterion for Smoothness on Formal Schemes

This a first step to develop a theory of smooth, étale, and unramified morphisms between Noetherian formal schemes. Our main tool is the complete module of differentials, which is, a coherent sheaf whenever the map of formal schemes is of pseudofinite type. Among our results, we show that these infinitesimal properties of a map of usual schemes carry over into the completion with respect to suitable closed subsets. We characterize unramifiedness by the vanishing of the module of differentials. Also we see that a smooth morphism of Noetherian formal schemes is flat and its module of differentials is locally free. The article closes with a version of Zariski's Jacobian criterion.