共查询到15条相似文献,搜索用时 15 毫秒
1.
Peter Keevash 《Journal of Combinatorial Theory, Series A》2006,113(7):1536-1542
Suppose A and B are families of subsets of an n-element set and L is a set of s numbers. We say that the pair (A,B) is L-cross-intersecting if |A∩B|∈L for every A∈A and B∈B. Among such pairs (A,B) we write PL(n) for the maximum possible value of |A||B|. In this paper we find an exact bound for PL(n) when n is sufficiently large, improving earlier work of Sgall. We also determine P{2}(n) and P{1,2}(n) exactly, which respectively confirm special cases of a conjecture of Ahlswede, Cai and Zhang and a conjecture of Sgall. 相似文献
2.
Paul Thomas Young 《Journal of Number Theory》2003,98(1):67-88
We give some p-adic integral representations for the two-variable p-adic L-functions introduced recently by G. Fox. For powers of the Teichmüller character, we use the integral representation to extend the L-function to a larger domain, in which it is a meromorphic function in the first variable and an analytic element in the second. These integral representations imply systems of congruences for the generalized Bernoulli polynomials, improving previous results of Fox, Gunaratne, and the author; they also lead to generalizations of some formulas of Diamond and of Ferrero and Greenberg for p-adic L-functions in terms of the p-adic gamma and log gamma functions. 相似文献
3.
This paper proves three conjectures on congruences involving central binomial coefficients or Lucas sequences.Let p be an odd prime and let a be a positive integer.It is shown that if p=1(mod 4)or a1then where(—)denotes the Jacobi symbol.This confirms a conjecture of the second author.A conjecture of Tauraso is also confirmed by showing that where the Lucas numbers Lo,L_1,L_2,...are defined by L_0=2,L_1=1 and L_n+1=L_n+L_n-l(n=1,2,3,...).The third theorem states that if p=5 then F_p~a-(p~a/5)mod p~3 can be determined in the following way:which appeared as a conjecture in a paper of Sun and Tauraso in 2010. 相似文献
4.
5.
6.
Shin-ichi Kato 《Journal of Functional Analysis》2010,258(5):1427-1451
A symmetric space analogue of Casselman's criterion for square integrability of representations of a p-adic group is established. It is described in terms of exponents of Jacquet modules along parabolic subgroups associated to the symmetric space. 相似文献
7.
Kyung Soo Rim 《Journal of Mathematical Analysis and Applications》2006,324(2):1470-1477
In the p-adic vector space , we characterize those non-negative functions ψ defined on for which the weighted Hardy-Littlewood average is bounded on (1?r?∞), and on . Also, in each case, we find the corresponding operator norm ‖Uψ‖. 相似文献
8.
9.
Nikolay Qviller 《Mathematische Nachrichten》2014,287(11-12):1394-1420
We provide a structural generalization of a theorem by Kleiman–Piene, concerning the enumerative geometry of nodal curves in a complete linear system on a smooth projective surface S. Provided that r, the number of nodes, is sufficiently small compared to the ampleness of the linear system, we show that, under certain assumptions, the number of r‐nodal curves passing through points in general position on S is given by a Bell polynomial in universally defined integers which we identify, using classical intersection theory, as linear, integral polynomials evaluated in four basic Chern numbers. Furthermore, we provide a decomposition of the as a sum of three terms with distinct geometric interpretations, and discuss the relationship between these polynomials and Kazarian's Thom polynomials for multisingularities of maps. 相似文献
10.
Yilmaz Simsek 《Applied mathematics and computation》2010,216(10):2976-973
The main purpose of this paper is to construct a family of modified p-adic twisted functions, which interpolate the modified twisted q-Bernoulli polynomials and the generalized twisted q-Bernoulli numbers at negative integers. We also give some applications and examples related to these functions and numbers. 相似文献
11.
A game with precedence constraints is a TU game with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. Its core may be unbounded, and the bounded core, which is the union of all bounded faces of the core, proves to be a useful solution concept in the framework of games with precedence constraints. Replacing the inequalities that define the core by equations for a collection of coalitions results in a face of the core. A collection of coalitions is called normal if its resulting face is bounded. The bounded core is the union of all faces corresponding to minimal normal collections. We show that two faces corresponding to distinct normal collections may be distinct. Moreover, we prove that for superadditive games and convex games only intersecting and nested minimal collection, respectively, are necessary. Finally, it is shown that the faces corresponding to pairwise distinct nested normal collections may be pairwise distinct, and we provide a means to generate all such collections. 相似文献
12.
13.
Let , with
-1=x0n<x1n<<xnn<xn+1,n=1