共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
3.
Nan Li 《Journal of Algebraic Combinatorics》2014,39(4):833-851
We study the problem of expanding the product of two Stanley symmetric functions F w ?F u into Stanley symmetric functions in some natural way. Our approach is to consider a Stanley symmetric function as a stabilized Schubert polynomial $F_{w}=\lim_{n\to\infty}\mathfrak{S}_{1^{n}\times w}$ , and study the behavior of the expansion of $\mathfrak {S}_{1^{n}\times w}\cdot \mathfrak {S}_{1^{n}\times u}$ into Schubert polynomials as n increases. We prove that this expansion stabilizes and thus we get a natural expansion for the product of two Stanley symmetric functions. In the case when one permutation is Grassmannian, we have a better understanding of this stability. We then study some other related stability properties, providing a second proof of the main result. 相似文献
4.
5.
Meng-Kiat Chuah 《Journal of Pure and Applied Algebra》2018,222(7):1606-1627
We introduce the affine Vogan diagrams of complex simple Lie algebras. These are generalizations of Vogan diagrams, and we study the involutions represented by them. We apply these diagrams to study the symmetric pairs, in particular the associated and symplectic symmetric pairs. 相似文献
6.
This paper finishes the classification of the finite primitive affine distance-transitive graphs by dealing with the only case left open, namely where the generalized Fitting subgroup of the stabilizer of a vertex is modulo scalars a simple group of classical Lie type defined over the characteristic dividing the number of vertices of the graph. All graphs that are found to occur are known. 相似文献
7.
Roger Howe Eng-Chye Tan Jeb F. Willenbring 《Transactions of the American Mathematical Society》2005,357(4):1601-1626
We approach the problem of obtaining branching rules from the point of view of dual reductive pairs. Specifically, we obtain a stable branching rule for each of classical families of symmetric pairs. In each case, the branching multiplicities are expressed in terms of Littlewood-Richardson coefficients. Some of the formulas are classical and include, for example, Littlewood's restriction rule as a special case.
8.
In this paper, we consider certain affine similarity of refinable functions and establish, certain concection between some local and global properties of refinable functions, such as local and global linear independence, local smoothness and B-spline, local and global H?lder continuity. 相似文献
9.
In this paper, we consider certain affine similarity of refinable functions and establish, certain concection between some local and global properties of refinable functions, such as local and global linear independence, local smoothness and B-spline, local and global Hölder continuity. 相似文献
10.
We construct, for any symplectic, unitary or special orthogonal group over a locally compact nonarchimedean local field of odd residual characteristic, a type for each Bernstein component of the category of smooth representations, using Bushnell–Kutzko’s theory of covers. Moreover, for a component corresponding to a cuspidal representation of a maximal Levi subgroup, we prove that the Hecke algebra is either abelian, or a generic Hecke algebra on an infinite dihedral group, with parameters which are, at least in principle, computable via results of Lusztig. In an appendix, we make a correction to the proof of a result of the second author: that every irreducible cuspidal representation of a classical group as considered here is irreducibly compactly-induced from a type. 相似文献
11.
12.
13.
14.
15.
In this paper, based on theorems for limit distributions of empirical power processes for the i.i.d. case and for the case
with independent triangular arrays of random variables, we prove limit theorems for U- and V-statistics determined by generalized
polynomial kernel functions. We also show that under some natural conditions the limit distributions can be represented as
functionals on the limit process of the normed empirical power process. We consider the one-sample case, as well as multi-sample
cases.
Dedicated to Professor V. M. Zolotarev on his sixty-fifth birthday.
Supported by the Hungarian National Foundation for Scientific Research (grant No. T1666).
Proceedings of the Seminar on Stability Problems for Stochastic Models, Moscow, Russia, 1996, Part I. 相似文献
16.
Let xi ≥ 0, yi ≥ 0 for i = 1,…, n; and let aj(x) be the elementary symmetric function of n variables given by aj(x) = ∑1 ≤ ii < … <ij ≤ nxii … xij. Define the partical ordering x <y if aj(x) ≤ aj(y), j = 1,… n. We show that , where {xα}i = xαi. We also give a necessary and sufficient condition on a function f(t) such that x <y ? f(x) <f(y). Both results depend crucially on the following: If x <y there exists a piecewise differentiable path z(t), with zi(t) ≥ 0, such that z(0) = x, z(1) = y, and z(s) <z(t) if 0 ≤ s ≤ t ≤ 1. 相似文献
17.
We construct a metrizable simplex X such that for each n ɛ ℕ there exists a bounded function f on ext X of Baire class n that cannot be extended to a strongly affine function of Baire class n. We show that such an example cannot be constructed via the space of harmonic functions. 相似文献
18.
Summary It is shown that every convex set-valued function defined on a cone with a cone-basis in a real linear space with compact values in a real locally convex space has an affine selection. Similar results can be obtained for midconvex set-valued functions. 相似文献
19.
《Journal of Computational and Applied Mathematics》1998,98(2):233-243
We derive separate spectral functions for the even and odd spectra of a real symmetric Toeplitz matrix, which are given by the roots of those functions. These are rational functions, also commonly referred to as secular functions. Two applications are considered: spectral evolution as a function of one parameter and the computation of eigenvalues. 相似文献
20.
Maurice Queyranne 《Mathematical Programming》1998,82(1-2):3-12
We describe a purely combinatorial algorithm which, given a submodular set functionf on a finite setV, finds a nontrivial subsetA ofV minimizingf[A] + f[V A]. This algorithm, an extension of the Nagamochi—Ibaraki minimum cut algorithm as simplified by Stoer and Wagner [M. Stoer, F. Wagner, A simple min cut algorithm, Proceedings of the European Symposium on Algorithms ESA '94, LNCS 855, Springer, Berlin, 1994, pp. 141–147] and by Frank [A. Frank, On the edge-connectivity algorithm of Nagamochi and Ibaraki, Laboratoire Artémis, IMAG, Université J. Fourier, Grenbole, 1994], minimizes any symmetric submodular function using O(|V|3) calls to a function value oracle. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.A preliminary version of this paper was presented at the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) in January 1995. This research was supported by the Natural Sciences and Engineering Research Council (NSERC) of Canada. 相似文献