We prove the equivalence between two explicit expressions for two-point Witten-Kontsevich correlators obtained by Bertola-Dubrovin-Yang and by Zograf, respectively.
In this paper, we investigate the intersection numbers of nearly Kirkman triple systems.JN[V] is the set of all integers k such that there is a pair of NKTS（v）s with a common uncovered collection of 2-subset interse...In this paper, we investigate the intersection numbers of nearly Kirkman triple systems.JN[V] is the set of all integers k such that there is a pair of NKTS（v）s with a common uncovered collection of 2-subset intersecting in k triples. It has been established that JN[v] = {0, 1,. v（v-2）/6-6,v（v-2）/6-4,v（v-2）/6} for any integers v = 0 （mod 6） and v ≥ 66. For v ≤ 60, there are 8 cases leftundecided.展开更多
We compute some tautological bundles on Hilbert the intersection numbers of two generating series of integrals related to schemes of points on surfaces SIn], including Chern classes of tautological bundles, and the E...We compute some tautological bundles on Hilbert the intersection numbers of two generating series of integrals related to schemes of points on surfaces SIn], including Chern classes of tautological bundles, and the Euler characteristics of Α_yTS[n]. We also propose some related conjectures, including an equivariant version of Lehn＇s conjecture.展开更多
Ever since the famous Erd os-Ko-Rado theorem initiated the study of intersecting families of subsets,extremal problems regarding intersecting properties of families of various combinatorial objects have been extensive...Ever since the famous Erd os-Ko-Rado theorem initiated the study of intersecting families of subsets,extremal problems regarding intersecting properties of families of various combinatorial objects have been extensively investigated.Among them,studies about families of subsets,vector spaces and permutations are of particular concerns.Recently,we proposed a new quantitative intersection problem for families of subsets:For F([n]k),define its total intersection number as I(F)=ΣF1;F2∈F|F1∩F2|.Then,what is the structure of F when it has the maximal total intersection number among all the families in([n]k)with the same family size?In a recent paper,Kong and Ge(2020)studied this problem and characterized extremal structures of families maximizing the total intersection number of given sizes.In this paper,we consider the analogues of this problem for families of vector spaces and permutations.For certain ranges of family sizes,we provide structural characterizations for both families of subspaces and families of permutations having maximal total intersection numbers.To some extent,these results determine the unique structure of the optimal family for some certain values of jFj and characterize the relationship between having the maximal total intersection number and being intersecting.Besides,we also show several upper bounds on the total intersection numbers for both families of subspaces and families of permutations of given sizes.展开更多
Earlier it was proved that some distance-regular graphs of diameter 3 with c_(2)=2 do not exist.Distance-regular graphΓwith intersection array{17,16,10;1,2,8}has strongly regular graphΓ_(3)(pseudo-geometric graph fo...Earlier it was proved that some distance-regular graphs of diameter 3 with c_(2)=2 do not exist.Distance-regular graphΓwith intersection array{17,16,10;1,2,8}has strongly regular graphΓ_(3)(pseudo-geometric graph for the net pG_(9)(17,9)).By symmetrizing the arrays of triple intersection numbers,it is proved that the distanceregular graphs with intersection arrays{17,16,10;1,2,8}and{22,21,4;1,2,14}do not exist.展开更多
文摘We prove the equivalence between two explicit expressions for two-point Witten-Kontsevich correlators obtained by Bertola-Dubrovin-Yang and by Zograf, respectively.
基金Supported by the Fundamental Research Funds for the Central Universities(Grant No.2014JBM121)National Natural Science Foundation of China(Grant Nos.11271042,11471032 and 11571034)
文摘In this paper, we investigate the intersection numbers of nearly Kirkman triple systems.JN[V] is the set of all integers k such that there is a pair of NKTS（v）s with a common uncovered collection of 2-subset intersecting in k triples. It has been established that JN[v] = {0, 1,. v（v-2）/6-6,v（v-2）/6-4,v（v-2）/6} for any integers v = 0 （mod 6） and v ≥ 66. For v ≤ 60, there are 8 cases leftundecided.
基金The second author was partially supported by the National Natural Science Foundation of China （Grant No. 11171174）.
文摘We compute some tautological bundles on Hilbert the intersection numbers of two generating series of integrals related to schemes of points on surfaces SIn], including Chern classes of tautological bundles, and the Euler characteristics of Α_yTS[n]. We also propose some related conjectures, including an equivariant version of Lehn＇s conjecture.
基金supported by National Natural Science Foundation of China (Grant No. 11971325)National Key Research and Development Program of China (Grant Nos. 2020YFA0712100 and 2018YFA0704703)Beijing Scholars Program
文摘Ever since the famous Erd os-Ko-Rado theorem initiated the study of intersecting families of subsets,extremal problems regarding intersecting properties of families of various combinatorial objects have been extensively investigated.Among them,studies about families of subsets,vector spaces and permutations are of particular concerns.Recently,we proposed a new quantitative intersection problem for families of subsets:For F([n]k),define its total intersection number as I(F)=ΣF1;F2∈F|F1∩F2|.Then,what is the structure of F when it has the maximal total intersection number among all the families in([n]k)with the same family size?In a recent paper,Kong and Ge(2020)studied this problem and characterized extremal structures of families maximizing the total intersection number of given sizes.In this paper,we consider the analogues of this problem for families of vector spaces and permutations.For certain ranges of family sizes,we provide structural characterizations for both families of subspaces and families of permutations having maximal total intersection numbers.To some extent,these results determine the unique structure of the optimal family for some certain values of jFj and characterize the relationship between having the maximal total intersection number and being intersecting.Besides,we also show several upper bounds on the total intersection numbers for both families of subspaces and families of permutations of given sizes.
基金supported by the RFBR and the NFSC(Project No.20-51-53013)supported by the NNSF of China(No.12171126).
文摘Earlier it was proved that some distance-regular graphs of diameter 3 with c_(2)=2 do not exist.Distance-regular graphΓwith intersection array{17,16,10;1,2,8}has strongly regular graphΓ_(3)(pseudo-geometric graph for the net pG_(9)(17,9)).By symmetrizing the arrays of triple intersection numbers,it is proved that the distanceregular graphs with intersection arrays{17,16,10;1,2,8}and{22,21,4;1,2,14}do not exist.
