Block intersection polynomials
نویسندگان
چکیده
We introduce the block intersection polynomial, which is constructed using certain information about a block design with respect to a subset S of its point-set, and then provides further information about the number of blocks intersecting S in exactly i points, for i = 0, . . . , |S|. We also discuss some applications of block intersection polynomials, including bounding the multiplicity of a block in a t-(v, k, λ) design and in a resolvable t-(v, k, λ) design.
منابع مشابه
More on block intersection polynomials and new applications to graphs and block designs
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy certain integer linear equations involving binomial coefficients, and information on the nonnegative integer solutions to these equations can be obtained using the block intersection polynomials introduced by P.J. Came...
متن کاملNumerical solution of delay differential equations via operational matrices of hybrid of block-pulse functions and Bernstein polynomials
In this paper, we introduce hybrid of block-pulse functions and Bernstein polynomials and derive operational matrices of integration, dual, differentiation, product and delay of these hybrid functions by a general procedure that can be used for other polynomials or orthogonal functions. Then, we utilize them to solve delay differential equations and time-delay system. The method is based upon e...
متن کاملIntersection Alexander polynomials
By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical Alexander polynomial invariants for smooth or PL locally-flat knots. We show that the intersection Alexander polynomials satisfy certain duality and normalization c...
متن کاملOn the Field Intersection Problem of Quartic Generic Polynomials via Formal Tschirnhausen Transformation
Let k be a field of characteristic 6= 2. We give an answer to the field intersection problem of quartic generic polynomials over k via formal Tschirnhausen transformation and multi-resolvent polynomials.
متن کاملAn Unconditionally Secure Protocol for Multi-Party Set Intersection
Existing protocols for private set intersection are based on homomorphic public-key encryption and the technique of representing sets as polynomials in the cryptographic model. Based on the ideas of these protocols and the two-dimensional verifiable secret sharing scheme, we propose a protocol for private set intersection in the informationtheoretic model. By representing the sets as polynomial...
متن کامل