首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 281 毫秒
1.
We present here a proof that a certain rational function Cn(q,t) which has come to be known as the “q,t-Catalan” is in fact a polynomial with positive integer coefficients. This has been an open problem since 1994. The precise form of the conjecture is given in Garsia and Haiman (J. Algebraic Combin. 5(3) (1996) 191), where it is further conjectured that Cn(q,t) is the Hilbert series of the diagonal harmonic alternants in the variables (x1,x2,…,xn;y1,y2,…,yn). Since Cn(q,t) evaluates to the Catalan number at t=q=1, it has also been an open problem to find a pair of statistics a(π),b(π) on Dyck paths π in the n×n square yielding Cn(q,t)=∑πta(π)qb(π). Our proof is based on a recursion for Cn(q,t) suggested by a pair of statistics a(π),b(π) recently proposed by Haglund. Thus, one of the byproducts of our developments is a proof of the validity of Haglund's conjecture. It should also be noted that our arguments rely and expand on the plethystic machinery developed in Bergeron et al. (Methods and Applications of Analysis, Vol. VII(3), 1999, p. 363).  相似文献   

2.
q-analogs of the Catalan numbers Cn = (1/(n + 1))(n2n) are studied from the view-point of Lagrange inversion. The first, due to Carlitz, corresponds to the Andrews-Gessel-Garsia q-Lagrange inversion theory, satisfies a nice recurrence relation and counts inversions of Catalan words. The second, tracing back to Mac Mahon, arise from Krattenthaler's and Gessel and Stanton's q-Lagrange inversion formula, have a nice explicit formula and enumerate the major index. Finally a joint generalization is given which includes also the Polya-Gessel q-Catalan numbers.  相似文献   

3.
We consider iid Brownian motions, Bj(t), where Bj(0) has a rapidly decreasing, smooth density function f. The empirical quantiles, or pointwise order statistics, are denoted by Bj:n(t), and we consider a sequence Qn(t)=Bj(n):n(t), where j(n)/nα∈(0,1). This sequence converges in probability to q(t), the α-quantile of the law of Bj(t). We first show convergence in law in C[0,) of Fn=n1/2(Qnq). We then investigate properties of the limit process F, including its local covariance structure, and Hölder-continuity and variations of its sample paths. In particular, we find that F has the same local properties as fBm with Hurst parameter H=1/4.  相似文献   

4.
Given positive integers n and p, and a complex finite dimensional vector space V, we let Sn,p(V) denote the set of all functions from V×V×?×V-(n+p copies) to C that are linear and symmetric in the first n positions, and conjugate linear symmetric in the last p positions. Letting κ=min{n,p} we introduce twisted inner products, [·,·]s,t,1?s,t?κ, on Sn,p(V), and prove the monotonicity condition [F,F]s,t?[F,F]u,v is satisfied when s?u?κ,t?v?κ, and FSn,p(V). Using the monotonicity condition, and the Cauchy-Schwartz inequality, we obtain as corollaries many known inequalities involving norms of symmetric multilinear functions, which in turn imply known inequalities involving permanents of positive semidefinite Hermitian matrices. New tensor and permanental inequalities are also presented. Applications to partial differential equations are indicated.  相似文献   

5.
In this paper, we study the numbers D n,k which are defined as the number of permutations σ of the symmetric group S n such that σ has no cycles of length j for jk. In the case k = 1, D n,1 is simply the number of derangements of an n-element set. As such, we shall call the numbers D n,k generalized derangement numbers. Garsia and Remmel [4] defined some natural q-analogues of D n,1, denoted by D n,1(q), which give rise to natural q-analogues of the two classical recursions of the number of derangements. The method of Garsia and Remmel can be easily extended to give natural p, q-analogues D n,1(p, q) which satisfy natural p, q-analogues of the two classical recursions for the number of derangements. In [4], Garsia and Remmel also suggested an approach to define q-analogues of the numbers D n,k . In this paper, we show that their ideas can be extended to give a p, q-analogue of the generalized derangements numbers. Again there are two classical recursions for eneralized derangement numbers. However, the p, q-analogues of the two classical recursions are not as straightforward when k ≥ 2. Partially supported by NSF grant DMS 0400507.  相似文献   

6.
Given positive integers n,k,t, with 2?k?n, and t<2k, let m(n,k,t) be the minimum size of a family F of (nonempty distinct) subsets of [n] such that every k-subset of [n] contains at least t members of F, and every (k-1)-subset of [n] contains at most t-1 members of F. For fixed k and t, we determine the order of magnitude of m(n,k,t). We also consider related Turán numbers T?r(n,k,t) and Tr(n,k,t), where T?r(n,k,t) (Tr(n,k,t)) denotes the minimum size of a family such that every k-subset of [n] contains at least t members of F. We prove that T?r(n,k,t)=(1+o(1))Tr(n,k,t) for fixed r,k,t with and n→∞.  相似文献   

7.
The energy of a graph is defined as the sum of the absolute values of all the eigenvalues of the graph. Let G(n,d) be the class of tricyclic graphs G on n vertices with diameter d and containing no vertex disjoint odd cycles Cp,Cq of lengths p and q with p+q2(mod4). In this paper, we characterize the graphs with minimal energy in G(n,d).  相似文献   

8.
Let E be an elliptic curve over F=Fq(t) having conductor (p)·∞, where (p) is a prime ideal in Fq[t]. Let dFq[t] be an irreducible polynomial of odd degree, and let . Assume (p) remains prime in K. We prove the analogue of the formula of Gross for the special value L(EFK,1). As a consequence, we obtain a formula for the order of the Tate-Shafarevich group Ш(E/K) when L(EFK,1)≠0.  相似文献   

9.
Let Fq denote the finite field with q elements. For nonnegative integers n,k, let dq(n,k) denote the number of n×nFq-matrices having k as the sum of the dimensions of the eigenspaces (of the eigenvalues lying in Fq). Let dq(n)=dq(n,0), i.e., dq(n) denotes the number of n×nFq-matrices having no eigenvalues in Fq. The Eulerian generating function of dq(n) has been well studied in the last 20 years [Kung, The cycle structure of a linear transformation over a finite field, Linear Algebra Appl. 36 (1981) 141-155, Neumann and Praeger, Derangements and eigenvalue-free elements in finite classical groups, J. London Math. Soc. (2) 58 (1998) 564-586 and Stong, Some asymptotic results on finite vector spaces, Adv. Appl. Math. 9(2) (1988) 167-199]. The main tools have been the rational canonical form, nilpotent matrices, and a q-series identity of Euler. In this paper we take an elementary approach to this problem, based on Möbius inversion, and find the following bivariate generating function:
  相似文献   

10.
We continue the study of the rational-slope generalized q,t-Catalan numbers c m,n (q,t). We describe generalizations of the bijective constructions of J. Haglund and N. Loehr and use them to prove a weak symmetry property c m,n (q,1)=c m,n (1,q) for m=kn±1. We give a bijective proof of the full symmetry c m,n (q,t)=c m,n (t,q) for min(m,n)≤3. As a corollary of these combinatorial constructions, we give a simple formula for the Poincaré polynomials of compactified Jacobians of plane curve singularities x kn±1=y n . We also give a geometric interpretation of a relation between rational-slope Catalan numbers and the theory of (m,n)-cores discovered by J. Anderson.  相似文献   

11.
Let G=(V,E) be a connected graph. For a symmetric, integer-valued function δ on V×V, where K is an integer constant, N0 is the set of nonnegative integers, and Z is the set of integers, we define a C-mapping by F(u,v,m)=δ(u,v)+mK. A coloring c of G is an F-coloring if F(u,v,|c(u)−c(v)|)?0 for every two distinct vertices u and v of G. The maximum color assigned by c to a vertex of G is the value of c, and the F-chromatic number F(G) is the minimum value among all F-colorings of G. For an ordering of the vertices of G, a greedy F-coloring c of s is defined by (1) c(v1)=1 and (2) for each i with 1?i<n, c(vi+1) is the smallest positive integer p such that F(vj,vi+1,|c(vj)−p|)?0, for each j with 1?j?i. The greedy F-chromatic number gF(s) of s is the maximum color assigned by c to a vertex of G. The greedy F-chromatic number of G is gF(G)=min{gF(s)} over all orderings s of V. The Grundy F-chromatic number is GF(G)=max{gF(s)} over all orderings s of V. It is shown that gF(G)=F(G) for every graph G and every F-coloring defined on G. The parameters gF(G) and GF(G) are studied and compared for a special case of the C-mapping F on a connected graph G, where δ(u,v) is the distance between u and v and .  相似文献   

12.
In this work it is shown that certain interesting types of orthogonal system of subalgebras (whose existence cannot be ruled out by the trivial necessary conditions) cannot exist. In particular, it is proved that there is no orthogonal decomposition of Mn(C)⊗Mn(C)Mn2(C) into a number of maximal abelian subalgebras and factors isomorphic to Mn(C) in which the number of factors would be 1 or 3.In addition, some new tools are introduced, too: for example, a quantity c(A,B), which measures “how close” the subalgebras A,BMn(C) are to being orthogonal. It is shown that in the main cases of interest, c(A,B) - where A and B are the commutants of A and B, respectively - can be determined by c(A,B) and the dimensions of A and B. The corresponding formula is used to find some further obstructions regarding orthogonal systems.  相似文献   

13.
We introduce a rational function C n(q, t) and conjecture that it always evaluates to a polynomial in q, t with non-negative integer coefficients summing to the familiar Catalan number . We give supporting evidence by computing the specializations and C n (q) = C n(q,1) = C n(1,q). We show that, in fact, D n(q) q-counts Dyck words by the major index and C n(q) q-counts Dyck paths by area. We also show that C n(q, t) is the coefficient of the elementary symmetric function e nin a symmetric polynomial DHn(x; q, t) which is the conjectured Frobenius characteristic of the module of diagonal harmonic polynomials. On the validity of certain conjectures this yields that C n(q, t) is the Hilbert series of the diagonal harmonic alternants. It develops that the specialization DHn(x; q, 1) yields a novel and combinatorial way of expressing the solution of the q-Lagrange inversion problem studied by Andrews [2], Garsia [5] and Gessel [11]. Our proofs involve manipulations with the Macdonald basis {P (x; q, t)} which are best dealt with in -ring notation. In particular we derive here the -ring version of several symmetric function identities.Work carried out under NSF grant support.  相似文献   

14.
For a pair of n×n Hermitian matrices H and K, a real ternary homogeneous polynomial defined by F(t,x,y)=det(tIn+xH+yK) is hyperbolic with respect to (1,0,0). The Fiedler conjecture (or Lax conjecture) is recently affirmed, namely, for any real ternary hyperbolic polynomial F(t,x,y), there exist real symmetric matrices S1 and S2 such that F(t,x,y)=det(tIn+xS1+yS2). In this paper, we give a constructive proof of the existence of symmetric matrices for the ternary forms associated with trigonometric polynomials.  相似文献   

15.
Homoclinic solutions for a class of the second order Hamiltonian systems   总被引:2,自引:0,他引:2  
We study the existence of homoclinic orbits for the second order Hamiltonian system , where qRn and VC1(R×Rn,R), V(t,q)=-K(t,q)+W(t,q) is T-periodic in t. A map K satisfies the “pinching” condition b1|q|2?K(t,q)?b2|q|2, W is superlinear at the infinity and f is sufficiently small in L2(R,Rn). A homoclinic orbit is obtained as a limit of 2kT-periodic solutions of a certain sequence of the second order differential equations.  相似文献   

16.
Let Ωm be the set of partitions, ω, of a finite m-element set; induce a uniform probability distribution on Ωm, and define Xms(ω) as the number of s-element subsets in ω. We alow the existence of an integer-valued function n=n(m)(t), t?[0, 1], and centering constants bms, 0?s? m, such that
Z(m)(t)=s=0n(m)(t)(Xms?bms)s=0mbms
converges to the ‘Brownian Bridge’ process in terms of its finite-dimensional distributions.  相似文献   

17.
Let Fq be the finite field of q elements with characteristic p and Fqm its extension of degree m. Fix a nontrivial additive character Ψ of Fp. If f(x1,…, xn)∈Fq[x1,…, xn] is a polynomial, then one forms the exponential sum Sm(f)=∑(x1,…,xn)∈(Fqm)nΨ(TrFqm/Fp(f(x1,…,xn))). The corresponding L functions are defined by L(f, t)=exp(∑m=0Sm(f)tm/m). In this paper, we apply Dwork's method to determine the Newton polygon for the L function L(f(x), t) associated with one variable polynomial f(x) when deg f(x)=4. As an application, we also give an affirmative answer to Wan's conjecture for the case deg f(x)=4.  相似文献   

18.
Let F1(x, y),…, F2h+1(x, y) be the representatives of equivalent classes of positive definite binary quadratic forms of discriminant ?q (q is a prime such that q ≡ 3 mod 4) with integer coefficients, then the number of integer solutions of Fi(x, y) = n (i = 1,…, 2h + 1) can be calculated for each natural number n using L-functions of imaginary quadratic field Q((?q)1/2).  相似文献   

19.
The solutions q [n] generated from a periodic "seed" q = cei(as+bt) of the nonlinear Schrdinger(NLS) by n-fold Darboux transformation is represented by determinant.Furthermore,the s-periodic solution and t-periodic solution are given explicitly by using q [1].The curves and surfaces(F1,F2,F3) associated with q [n] are given by means of Sym formula.Meanwhile,we show periodic and asymptotic properties of these curves.  相似文献   

20.
Let I(n) be the number of involutions in a special orthogonal group SO(n,Fq) defined over a finite field with q elements, where q is the power of an odd prime. Then the numbers I(n) form a semi-recursion, in that for m>1 we haveI(2m+3)=(q2m+2+1)I(2m+1)+q2m(q2m−1)I(2m−2). We give a purely combinatorial proof of this result, and we apply it to give a universal bound for the character degree sum for finite classical groups defined over Fq.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号