On Differential Bases Formed of Intervals

Translation invariant subbases of the differential basis B ₂ (formed of all intervals), which differentiates the same class of all non-negative functions as B ₂ does, are described. A possibility for extending the results obtained to bases of more general type is discussed.     

Orthonormal bases associated with multi-knot piecewise linear function sequences on [0, 1)<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

We investigate two classes of orthonormal bases for L^2（[0, 1）^n）. The exponential parts of those bases are multi-knot piecewise linear functions which are called spectral sequences. We characterize the multi-knot piecewise linear spectral sequences and give an application of the first class of piecewise linear spectral sequences.     

The quantum general linear supergroup,canonical bases and Kazhdan-Lusztig polynomials

Canonical bases of the tensor powers of the natural -module V are constructed by adapting the work of Frenkel, Khovanov and Kirrilov to the quantum supergroup setting. This result is generalized in several directions. We first construct the canonical bases of the ℤ₂-graded symmetric algebra of V and tensor powers of this superalgebra; then construct canonical bases for the superalgebra O _q (M _m|n ) of a quantum (m,n) × (m,n)-supermatrix; and finally deduce from the latter result the canonical basis of every irreducible tensor module for by applying a quantum analogue of the Borel-Weil construction. This work was supported by National Natural Science Foundation of China (Grant No. 10471070)     

An example of an almost greedy uniformly bounded orthonormal basis for

We construct a uniformly bounded orthonormal almost greedy basis for L_p(0,1), 1<p<∞. The example shows that it is not possible to extend Orlicz's theorem, stating that there are no uniformly bounded orthonormal unconditional bases for L_p(0,1), p≠2, to the class of almost greedy bases.     

Canonical bases for the quantum supergroup U(𝔤𝔩3|1)

Based on the works of Du and Gu, the canonical bases of U(𝔤𝔩_3|1) are completely determined in this paper.     

Greedy Algorithm for General Biorthogonal Systems

We consider biorthogonal systems in quasi-Banach spaces such that the greedy algorithm converges for each xX (quasi-greedy systems). We construct quasi-greedy conditional bases in a wide range of Banach spaces. We also compare the greedy algorithm for the multidimensional Haar system with the optimal m-term approximation for this system. This substantiates a conjecture by Temlyakov.     

The Uniformity of Non-Uniform Gabor Bases

There have been extensive studies on non-uniform Gabor bases and frames in recent years. But interestingly there have not been a single example of a compactly supported orthonormal Gabor basis in which either the frequency set or the translation set is non-uniform. Nor has there been an example in which the modulus of the generating function is not a characteristic function of a set. In this paper, we prove that in the one dimension and if we assume that the generating function g(x) of an orthonormal Gabor basis is supported on an interval, then both the frequency and the translation sets of the Gabor basis must be lattices. In fact, the Gabor basis must be the trivial one in the sense that |g(x)|=c(x) for some fundamental interval of the translation set. We also give examples showing that compactly supported non-uniform orthonormal Gabor bases exist in higher dimensions.     

Representation theory of p-adic groups and canonical bases

In this paper, we interpret the Gindikin–Karpelevich formula and the Casselman–Shalika formula as sums over Kashiwara–Lusztig?s canonical bases, generalizing the results of Bump and Nakasuji (2010) [7] to arbitrary split reductive groups. We also rewrite formulas for spherical vectors and zonal spherical functions in terms of canonical bases. In a subsequent paper Kim and Lee (preprint) [14], we will generalize these formulas to p-adic affine Kac–Moody groups.     

Extremal Bases for the Adjoint Representations of the Simple Lie Algebras

We construct n distinct weight bases, which we call extremal bases, for the adjoint representation of each simple Lie algebra 𝔤 of rank n: One construction for each simple root. We explicitly describe actions of the Chevalley generators on the basis elements. We show that these extremal bases are distinguished by their “supporting graphs” in three ways. (In general, the supporting graph of a weight basis for a representation of a semisimple Lie algebra is a directed graph with colored edges that describe the supports of the actions of the Chevalley generators on the elements of the basis.) We show that each extremal basis constructed is essentially the only basis with its supporting graph (i.e., each extremal basis is solitary), and that each supporting graph is a modular lattice. Each extremal basis is shown to be edge-minimizing: Its supporting graph has the minimum number of edges. The extremal bases are shown to be the only edge-minimizing as well as the only modular lattice weight bases (up to scalar multiples) for the adjoint representation of 𝔤. The supporting graph for an extremal basis is shown to be a distributive lattice if and only if the associated simple root corresponds to an end node for a “branchless” simple Lie algebra, i.e., type A, B, C, F, or G. For each extremal basis, basis elements for the Cartan subalgebra are explicitly expressed in terms of the h _i Chevalley generators.     

On a Conjecture of R.P. Stanley; Part I—Monomial Ideals

In 1982 Richard P. Stanley conjectured that any finitely generated ⁿ -graded module M over a finitely generated ⁿ -graded K-algebra R can be decomposed in a direct sum M = _{i = 1} ^t _i S _i of finitely many free modules _i S _i which have to satisfy some additional conditions. Besides homogeneity conditions the most important restriction is that the S _i have to be subalgebras of R of dimension at least depth M.We will study this conjecture for the special case that R is a polynomial ring and M an ideal of R, where we encounter a strong connection to generalized involutive bases. We will derive a criterion which allows us to extract an upper bound on depth M from particular involutive bases. As a corollary we obtain that any monomial ideal M which possesses an involutive basis of this type satisfies Stanley's Conjecture and in this case the involutive decomposition defined by the basis is also a Stanley decomposition of M. Moreover, we will show that the criterion applies, for instance, to any monomial ideal of depth at most 2, to any monomial ideal in at most 3 variables, and to any monomial ideal which is generic with respect to one variable. The theory of involutive bases provides us with the algorithmic part for the computation of Stanley decompositions in these situations.     

Convergence of the Cesàro mean for rational orthonormal bases

This paper deals with the convergence of the Cesaro mean for the rational orthonormal bases. Provided the set of zeroes of rational orthonormal bases is formed by a periodic repetition of the same finite sequence, the explicit expression of so-called block-Fejer kernel is available, and some properties of the block-Fejer kernel are discussed. Based on the convergence of the block-Cesaro mean, the convergence of Cesaro mean is also provided.     

Shape preserving representations and optimality of the Bernstein basis

This paper gives an affirmative answer to a conjecture given in [10]: the Bernstein basis has optimal shape preserving properties among all normalized totally positive bases for the space of polynomials of degree less than or equal ton over a compact interval. There is also a simple test to recognize normalized totally positive bases (which have good shape preserving properties), and the corresponding corner cutting algorithm to generate the Bézier polygon is also included. Among other properties, it is also proved that the Wronskian matrix of a totally positive basis on an interval [a, ) is also totally positive.Both authors were partially supported by DGICYT PS90-0121.     

Random sampling and greedy sparsification for matroid optimization problems

Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the effectiveness of these paradigms for two optimization problems on matroids: finding an optimum matroid basis and packing disjoint matroid bases. Application of these ideas to the graphic matroid led to fast algorithms for minimum spanning trees and minimum cuts. An optimum matroid basis is typically found by agreedy algorithm that grows an independent set into an optimum basis one element at a time. This continuous change in the independent set can make it hard to perform the independence tests needed by the greedy algorithm. We simplify matters by using sampling to reduce the problem of finding an optimum matroid basis to the problem of verifying that a givenfixed basis is optimum, showing that the two problems can be solved in roughly the same time. Another application of sampling is to packing matroid bases, also known as matroid partitioning. Sampling reduces the number of bases that must be packed. We combine sampling with a greedy packing strategy that reduces the size of the matroid. Together, these techniques give accelerated packing algorithms. We give particular attention to the problem of packing spanning trees in graphs, which has applications in network reliability analysis. Our results can be seen as generalizing certain results from random graph theory. The techniques have also been effective for other packing problems. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Some of this work done at Stanford University, supported by National Science Foundation and Hertz Foundation Graduate Fellowships, and NSF Young Investigator Award CCR-9357849, with matching funds from IBM, Schlumberger Foundation, Shell Foundation and Xerox Corporation. Also supported by NSF award 962-4239.     

A method for constructing a self-dual normal basis in odd characteristic extension fields

This paper proposes a useful method for constructing a self-dual normal basis in an arbitrary extension field F_p^m such that 4p does not divide m(p−1) and m is odd. In detail, when the characteristic p and extension degree m satisfies the following conditions (1) and either (2a) or (2b); (1) 2km+1 is a prime number, (2a) the order of p in F_2km+1 is 2km, (2b) 2km and the order of p in F_2km+1 is km, we can consider a class of Gauss period normal bases. Using this Gauss period normal basis, this paper shows a method to construct a self-dual normal basis in the extension field F_p^m.     

Gr?bner bases in difference-differential modules and difference-differential dimension polynomials

In this paper we extend the theory of Gr?bner bases to difference-differential modules and present a new algorithmic approach for computing the Hilbert function of a finitely generated difference-differential module equipped with the natural filtration. We present and verify algorithms for constructing these Gr?bner bases counterparts. To this aim we introduce the concept of “generalized term order” on ℕ ^m ×ℤ ⁿ and on difference-differential modules. Using Gr?bner bases on difference-differential modules we present a direct and algorithmic approach to computing the difference-differential dimension polynomials of a difference-differential module and of a system of linear partial difference-differential equations. This work was supported by the National Natural Science Foundation of China (Grant No. 60473019) and the KLMM (Grant No. 0705)     

Bases of admissible rules for <Emphasis Type="Italic">K</Emphasis>-saturated logics

Admissible inference rules for table modal and superintuitionistic logics are investigated. K-saturated logics are defined semantically. Such logics are proved to have finite bases for admissible inference rules in finitely many variables. __________ Translated from Algebra i Logika, Vol. 47, No. 6, pp. 750–761, November–December, 2008.     

Gröbner-Shirshov bases for the lie algebra <Emphasis Type="Italic">A</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

We estimate Gröbner-Shirshov bases for the Lie algebra A_n given arbitrary orders of generators (nodes of a Dynkin graph). Previously, the Gröbner-Shirshov basis was computed in [1] for the particular case where nodes of the Dynkin graph are ordered successively.Supported by RFBR grant Nos. 05-01-00230 and 02-01-00258 and by the Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-2069.2003.1.__________Translated from Algebra i Logika, Vol. 44, No. 2, pp. 131–147, March–April, 2005.     

Homological Computations in PBW Modules

In this paper the Poincaré–Birkhoff–Witt (PBW) rings are characterized. Gröbner bases techniques are also developed for these rings. An explicit presentation of Ext ⁱ (M,N) is provided when N is a centralizing bimodule.     

Bernstein-Type Bases and Corner Cutting Algorithms for C 1 Merrien's Curves

Bernstein bases, control polygons and corner-cutting algorithms are defined for C ¹ Merrien's curves introduced in [7]. The convergence of these algorithms is proved for two specific families of curves. Results on monotone and convex interpolants which have been proved in [8] by Merrien and the author are also recovered.     

Partial Decomposition Bases and Global Warfield Groups

The class of abelian groups with partial decomposition bases was developed by the first author in order to generalize Barwise and Eklof's classification of torsion groups in L_∞ω. In this article, we continue to explore algebraic characteristics of this class and establish a uniqueness theorem, extending our previous work on mixed p-local groups to the global case. It is shown that groups with partial decomposition bases are characterized in terms of Warfield groups and k-groups of Hill and Megibben. In fact, we prove that the class of groups with partial decomposition bases is identical to the class of k-groups, and, as such, closed under direct summands, and that every finitely generated subgroup of a k-group is locally nice. Also, we introduce and explore subgroups possessing a partial subbasis. As an application, it is shown that isotype k-subgroups of abelian groups are k-groups.