A Chebyshev Quadrature Rule for One Sided Finite Part Integrals

This paper is concerned with a Chebyshev quadrature rule for approximating one sided finite part integrals with smooth density functions. Our quadrature rule is based on the Chebyshev interpolation polynomial with the zeros of the Chebyshev polynomial T_N+1(τ)−T_N−1(t). We analyze the stability and the convergence for the quadrature rule with a differentiable function. Also we show that the quadrature rule has an exponential convergence when the density function is analytic.     

Evolution of fuzzy classifiers using genetic programming

In this paper, we propose a genetic programming (GP) based approach to evolve fuzzy rule based classifiers. For a c-class problem, a classifier consists of c trees. Each tree, T _i , of the multi-tree classifier represents a set of rules for class i. During the evolutionary process, the inaccurate/inactive rules of the initial set of rules are removed by a cleaning scheme. This allows good rules to sustain and that eventually determines the number of rules. In the beginning, our GP scheme uses a randomly selected subset of features and then evolves the features to be used in each rule. The initial rules are constructed using prototypes, which are generated randomly as well as by the fuzzy k-means (FKM) algorithm. Besides, experiments are conducted in three different ways: Using only randomly generated rules, using a mixture of randomly generated rules and FKM prototype based rules, and with exclusively FKM prototype based rules. The performance of the classifiers is comparable irrespective of the type of initial rules. This emphasizes the novelty of the proposed evolutionary scheme. In this context, we propose a new mutation operation to alter the rule parameters. The GP scheme optimizes the structure of rules as well as the parameters involved. The method is validated on six benchmark data sets and the performance of the proposed scheme is found to be satisfactory.     

Subrecursive degrees and fragments of Peano Arithmetic

Let T ₀?T ₁ denote that each computable function, which is provable total in the first order theory T ₀, is also provable total in the first order theory T ₁. Te relation ? induces a degree structure on the sound finite Π₂ extensions of EA (Elementary Arithmetic). This paper is devoted to the study of this structure. However we do not study the structure directly. Rather we define an isomorphic subrecursive degree structure <≤,?>, and then we study <≤,?> by ubrecursive and computability-theoretic means. Furthermore, we introduce and investigate some operators on the degrees of <≤,?>. These operators corresponds to inferencerules in formal arithmetic. One operator corresponds to the Σ₁ collection rule. Another operator corresponds to the Σ₁ induction rule.     

Large Deviations of Queues Sharing a Randomly Time-Varying Server

We consider a discrete-time model where multiple queues, each with its own exogenous arrival process, are served by a server whose capacity varies randomly and asynchronously with respect to different queues. This model is primarily motivated by the problem of efficient scheduling of transmissions of multiple data flows sharing a wireless channel. We address the following problem of controlling large deviations of the queues: find a scheduling rule, which is optimal in the sense of maximizing

Multiplying Schur functions

A new combinatorial rule for expanding the product of Schur functions as a sum of Schur functions is formulated. The rule has several advantages over the Littlewood-Richardson rule (D. E. Littlewood and A. R. Richardson, Philos. Trans. Roy. Soc. London Ser. A233 (1934), 49–141). First this rule allows for direct computation of the expansion of the product of any number of Schur functions, not just the product of two Schur functions. Also, the rule is easily stated and is well suited to computer implementation. It is shown that the rule implies the Littlewood-Richardson rule and gives a combinatorial proof that the coefficient of S_λ in the product S_μS_ν equals the coefficient of S_ν in the expansion of the skew Schur function S_λ/μ. The rule is derived from some results proved independently by A. P. Hillman and R. M. Grassl (J. Combin. Comput. Sci. Systems5 (1980), 305–316) and by D. White (J. Combin. Theory Ser. A30 (1981), 237–247) on the Robinson-Schensted-Knuth correspondence.     

On self-adjoint subloops of moufang loops

In this paper we give a combinatorial rule to compute the composition of two convolution products of endomorphisms of a free associative algebra and deduce the construction of a subalgebra of QB _n (the group algebra of Hyperoctahedral group) which contains the descent algebra X#?. We also deduce a proof of the multiplication rule in the algebra ∑QB _n- Finally, we generalize this construction to other wreath products of symmetric groups by abelian groups.     

A geometric approach to the Kronecker problem I: The two row case

Given two irreducible representations μ, v of the symmetric group S _d , the Kronecker problem is to find an explicit rule, giving the multiplicity of an irreducible representation, λ, of S _d , in the tensor product of μ and v. We propose a geometric approach to investigate this problem. We demonstrate its effectiveness by obtaining explicit formulas for the tensor product multiplicities, when the irreducible representations are parameterized by partitions with at most two rows.     

Pseudodifferential <Emphasis Type="Italic">p</Emphasis>-adic vector fields and pseudodifferentiation of a composite <Emphasis Type="Italic">p</Emphasis>-adic function

We discuss transformation of p-adic pseudodifferential operators (in the one-dimensional and multidimensional cases) with respect to p-adic maps which correspond to automorphisms of the tree of balls in the corresponding p-adic spaces. In the dimension one we find a rule of transformation for pseudodifferential operators. In particular we find the formula of pseudodifferentiation of a composite function with respect to the Vladimirov p-adic fractional operator. We describe the frame of wavelets for the group of parabolic automorphisms of the tree T (O _p ) of balls in O _p . In many dimensions we introduce the group of mod p-affine transformations, the family of pseudodifferential operators corresponding to pseudodifferentiation along vector fields on the tree T (O _p ) and obtain a rule of transformation of the introduced pseudodifferential operators with respect to mod p-affine transformations.     

The uniform closure of non-dense rational spaces on the unit interval

Let P_n denote the set of all algebraic polynomials of degree at most n with real coefficients. Associated with a set of poles a₁,a₂,…,a_n R[-1,1] we define the rational function spaces Associated with a set of poles a₁,a₂,… R[-1,1], we define the rational function spacesIt is an interesting problem to characterize sets a₁,a₂,… R[-1,1] for which P(a₁,a₂,…) is not dense in C[-1,1], where C[-1,1] denotes the space of all continuous functions equipped with the uniform norm on [-1,1]. Akhieser showed that the density of P(a₁,a₂,…) is characterized by the divergence of the series .In this paper, we show that the so-called Clarkson–Erdős–Schwartz phenomenon occurs in the non-dense case. Namely, if P(a₁,a₂,…) is not dense in C[-1,1], then it is “very much not so”. More precisely, we prove the following result.Theorem Let a₁,a₂,… R[-1,1]. Suppose P(a₁,a₂,…) is not dense in C[-1,1], that is,Then every function in the uniform closure of P(a₁,a₂,…) in C[-1,1] can be extended analytically throughout the set C -1,1,a₁,a₂,… .     

Branching Rules for General Linear Groups

In this article we give a branching rule for Harish–Chandra restriction from the general linear group Gl _n (q) to the Levi subgroup Gl _n?1(q) × Gl₁(q) in the case of the unipotent block.     

The Littlewood-Richardson rule for wreath products with symmetric groups and the quiver of the category F≀FIn

We give a new proof for the Littlewood-Richardson rule for the wreath product F?S_n where F is a finite group. Our proof does not use symmetric functions but use more elementary representation theoretic tools. We also derive a branching rule for inducing the natural embedding of F?S_n to F?S_n+1. We then apply the generalized Littlewood-Richardson rule for computing the ordinary quiver of the category F?FI_n where FI_n is the category of all injective functions between subsets of an n-element set.     

Poisson color algebras of arbitrary degree

A Poisson algebra is a Lie algebra endowed with a commutative associative product in such a way that the Lie and associative products are compatible via a Leibniz rule. If we part from a Lie color algebra, instead of a Lie algebra, a graded-commutative associative product and a graded-version Leibniz rule we get a so-called Poisson color algebra (of degree zero). This concept can be extended to any degree, so as to obtain the class of Poisson color algebras of arbitrary degree. This class turns out to be a wide class of algebras containing the ones of Lie color algebras (and so Lie superalgebras and Lie algebras), Poisson algebras, graded Poisson algebras, z-Poisson algebras, Gerstenhaber algebras, and Schouten algebras among other classes of algebras. The present paper is devoted to the study of structure of Poisson color algebras of degree g₀, where g₀ is some element of the grading group G such that g₀ = 0 or 4g₀≠0, and with restrictions neither on the dimension nor the base field, by stating a second Wedderburn-type theorem for this class of algebras.     

Optimal lower bounds for cubature error on the sphere

We show that the worst-case cubature error E(Q_m;H^s) of an m-point cubature rule Q_m for functions in the unit ball of the Sobolev space H^s=H^s(S²),s>1, has the lower bound , where the constant c_s is independent of Q_m and m. This lower bound result is optimal, since we have established in previous work that there exist sequences of cubature rules for which with a constant independent of n. The method of proof is constructive: given the cubature rule Q_m, we construct explicitly a ‘bad’ function f_mH^s, which is a function for which Q_mf_m=0 and . The construction uses results about packings of spherical caps on the sphere.     

Root games on Grassmannians

We recall the root game, introduced in [8], which gives a fairly powerful sufficient condition for non-vanishing of Schubert calculus on a generalised flag manifold G/B. We show that it gives a necessary and sufficient rule for non-vanishing of Schubert calculus on Grassmannians. In particular, a Littlewood-Richardson number is non-zero if and only if it is possible to win the corresponding root game. More generally, the rule can be used to determine whether or not a product of several Schubert classes on Gr _l (ℂ ⁿ ) is non-zero in a manifestly symmetric way. Finally, we give a geometric interpretation of root games for Grassmannian Schubert problems. Research partially supported by an NSERC scholarship.     

Transitive permutation groups and equipotent voting rules

Let F a two-alternative voting rule and G_F the subgroup of permutations of the voters under which F is invariant. Group theoretic properties of G_F provide information about the voting rule F. In particular, sets of imprimitivity of G_F describe the ‘committee decomposition’ structure of F and permutation group transitivity of G_F (equipotency) is shown to be closely connected with equal distribution of power among the voters. If equipotency replaces anonymity in the hypotheses of May's theorem, voting rules other than simple majority are possible. By combining equipotency with two additional social choice conditions a new characterization of simple majority rule is obtained. Equipotency is proposed as an important alternative to the more restrictive anonymity as a fairness criterion in social choice.     

The quantum cohomology of flag varieties and the periodicity of the Schubert structure constants

We give conditions on a curve class that guarantee the vanishing of the structure constants of the small quantum cohomology of partial flag varieties F(k ₁, ..., k _r ; n) for that class. We show that many of the structure constants of the quantum cohomology of flag varieties can be computed from the image of the evaluation morphism. In fact, we show that a certain class of these structure constants are equal to the ordinary intersection of Schubert cycles in a related flag variety. We obtain a positive, geometric rule for computing these invariants (see Coskun in A Littlewood–Richardson rule for partial flag varieties, preprint). Our study also reveals a remarkable periodicity property of the ordinary Schubert structure constants of partial flag varieties.     

Periodization strategy may fail in high dimensions

We discuss periodization of smooth functions f of d variables for approximation of multivariate integrals. The benefit of periodization is that we may use lattice rules, which have recently seen significant progress. In particular, we know how to construct effectively a generator of the rank-1 lattice rule with n points whose worst case error enjoys a nearly optimal bound C _d,p n ^−p . Here C _d,p is independent of d or depends at most polynomially on d, and p can be arbitrarily close to the smoothness of functions belonging to a weighted Sobolev space with an appropriate condition on the weights. If F denotes the periodization for f then the error of the lattice rule for a periodized function F is bounded by C _d,p n ^−p ∣∣F∣∣ with the norm of F given in the same Sobolev space. For small or moderate d, the norm of F is not much larger than the norm of f. This means that for small or moderate d, periodization is successful and allows us to use optimal properties of lattice rules also for non-periodic functions. The situation is quite different if d is large since the norm of F can be exponentially larger than the norm of f. This can already be seen for f = 1. Hence, the upper bound of the worst case error of the lattice rule for periodized functions is quite bad for large d. We conjecture not only that this upper bound is bad, but also that all lattice rules fail for large d. That is, if we fix the number of points n and let d go to infinity then the worst case error of any lattice rule is bounded from below by a positive constant independent of n. We present a number of cases suggesting that this conjecture is indeed true, but the most interesting case, when the sum of the weights of the corresponding Sobolev space is bounded in d, remains open.      

A lattice-theoretic approach to arbitrary real functions on frames

In this paper we model discontinuous extended real functions in pointfree topology following a lattice-theoretic approach, in such a way that, if L is a subfit frame, arbitrary extended real functions on L are the elements of the Dedekind-MacNeille completion of the poset of all extended semicontinuous functions on L. This approach mimicks the situation one has with a T₁-space X, where the lattice F?(X) of arbitrary extended real functions on X is the smallest complete lattice containing both extended upper and lower semicontinuous functions on X. Then, we identify real-valued functions by lattice-theoretic means. By construction, we obtain definitions of discontinuous functions that are conservative for T₁-spaces. We also analyze semicontinuity and introduce definitions which are conservative for T₀-spaces.     

Quadrature rules using first derivatives for oscillatory integrands

We consider the integral of a function and its approximation by a quadrature rule of the form

i.e., by a rule which uses the values of both y and its derivative at nodes of the quadrature rule. We examine the cases when the integrand is either a smooth function or an ω dependent function of the form y(x)=f₁(x) sin(ωx)+f₂(x) cos(ωx) with smoothly varying f₁ and f₂. In the latter case, the weights w_k and α_k are ω dependent. We establish some general properties of the weights and present some numerical illustrations.