涉及重级零点的亚纯函数的拟正规定则

设F为区域D内的只有重级零点的亚纯函数族,H(z)为区域D内的非常数亚纯函数,且存在v∈N,使得对于任意的a∈C,n(D,1/H(z)-a)≤v.如果对于任意的f∈F,f′(z)≠H′(z),那么F在区域D内v阶拟正规.     

Cyclotomic constructions of external difference families and disjoint difference families

External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. Some results had been obtained by Chang and Ding, the connection between EDFs and disjoint difference families (DDFs) was also established. In this paper, further cyclotomic constructions of EDFs and DDFs are presented, and several classes of EDFs and DDFs are obtained. Answers to problems 1 and 4 by Chang and Ding are also given. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 333–341, 2009     

Cross-intersecting families of permutations

For positive integers r and n with r?n, let Pr,n be the family of all sets {(1,y₁),(2,y₂),…,(r,yr)} such that y₁,y₂,…,yr are distinct elements of [n]={1,2,…,n}. Pn,n describes permutations of [n]. For r<n, Pr,n describes permutations of r-element subsets of [n]. Families A₁,A₂,…,Ak of sets are said to be cross-intersecting if, for any distinct i and j in [k], any set in Ai intersects any set in Aj. For any r, n and k?2, we determine the cases in which the sum of sizes of cross-intersecting sub-families A₁,A₂,…,Ak of Pr,n is a maximum, hence solving a recent conjecture (suggested by the author).     

Constructions of External Difference Families and Disjoint Difference Families

External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference sets is set up.     

On generalized separating hash families

Separating hash families are useful combinatorial structures which are studied in a general form in this paper. Necessary and sufficient conditions for the existence of certain types of generalized hash functions are considered.     

A note on three-parameter families and generalized convex functions

The concept of generalized convex functions introduced by Beckenbach [E.F. Beckenbach, Generalized convex functions, Bull. Amer. Math. Soc. 43 (1937) 363–371] is extended to the two-dimensional case. Using three-parameter families, we define generalized convex (midconvex, M-convex) functions and show some continuity properties of them.     

Cross-intersecting sub-families of hereditary families

Families A₁,A₂,…,Ak of sets are said to be cross-intersecting if for any i and j in {1,2,…,k} with i≠j, any set in Ai intersects any set in Aj. For a finite set X, let X² denote the power set of X (the family of all subsets of X). A family H is said to be hereditary if all subsets of any set in H are in H; so H is hereditary if and only if it is a union of power sets. We conjecture that for any non-empty hereditary sub-family H≠{∅} of X² and any k?|X|+1, both the sum and the product of sizes of k cross-intersecting sub-families A₁,A₂,…,Ak (not necessarily distinct or non-empty) of H are maxima if A₁=A₂=?=Ak=S for some largest starSofH (a sub-family of H whose sets have a common element). We prove this for the case when H is compressed with respect to an element x of X, and for this purpose we establish new properties of the usual compression operation. As we will show, for the sum, the condition k?|X|+1 is sharp. However, for the product, we actually conjecture that the configuration A₁=A₂=?=Ak=S is optimal for any hereditary H and any k?2, and we prove this for a special case.     

On multiplicative perturbation of integral resolvent families

In this paper we study multiplicative perturbations for the generator of a strongly continuous integral resolvent family of bounded linear operators defined on a Banach space X. Assuming that a(t) is a creep function which satisfies a(⁰⁺)>0, we prove that if (A,a) generates an integral resolvent, then (A(I+B),a) also generates an integral resolvent for all B∈B(X,Z), where Z belongs to a class of admissible Banach spaces. In special instances of a(t) the space Z is proved to be characterized by an extended class of Favard spaces.     

涉及分担值的亚纯函数族的几个正规定则

设(ぁ)为区域D上的一族亚纯函数,a,b为互相判虽的两个复数.若对(ぁ)中任意函数f,f在D内的极点重数至少为2,且当f(z)=a时,f'(z)=a;f(z)=b时f'(z)=b,则(ぁ)在D内正规.     

Optimization over the polyhedron determined by a submodular function on a co-intersecting family

A greedy algorithm solves the problem of maximizing a linear objective function over the polyhedron (called the submodular polyhedron) determined by a submodular function on a distributive lattice or a ring family. We generalize the problem by considering a submodular function on a co-intersecting family and give an algorithm for solving it. Here, simple-minded greedy augmentations do not work any more and some complicated augmentations with multiple exchanges are required. We can find an optimal solution by at most 1/2n(n – 1) augmentations, wheren is the number of the variables and we assume a certain oracle for computing multiple exchange capacities.     

New constructions for perfect hash families and related structures using combinatorial designs and codes

In this paper, we consider explicit constructions of perfect hash families using combinatorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and Wei [3]. Using similar methods, we also obtain efficient constructions for separating hash families which result in improved existence results for structures such as separating systems, key distribution patterns, group testing algorithms, cover‐free families and secure frameproof codes. © 2000 John Wiley & Sons, Inc. J Combin Designs 8:189–200, 2000     

Quantum families of quantum group homomorphisms

The notion of a quantum family of maps has been introduced in the framework of C*-algebras. As in the classical case, one may consider a quantum family of maps preserving additional structures (e.g. quantum family of maps preserving a state). In this paper, we define a quantum family of homomorphisms of locally compact quantum groups. Roughly speaking, we show that such a family is classical. The purely algebraic counterpart of the discussed notion, i.e. a quantum family of homomorphisms of Hopf algebras, is introduced and the algebraic counterpart of the aforementioned result is proved. Moreover, we show that a quantum family of homomorphisms of Hopf algebras is consistent with the counits and coinverses of the given Hopf algebras. We compare our concept with weak coactions introduced by Andruskiewitsch and we apply it to the analysis of adjoint coaction.     

涉及分担函数的正规定则

设k为正整数,M为正数;F为区域D内的亚纯函数族,且其零点重级至少为k;h为D内的亚纯函数(h(z)≠0,∞),且h(z)的极点重级至多为k.若对任意给定的函数f∈F,f与f~((k))分担0,且f~((k))(z)-h(z)=0?|f(z)|≥M,则F在D内正规.     

Weighted cross-intersecting families

In this paper we investigate weighted cross-intersecting families: if α,β>0 are given constants, we want to find the maximum of α|A|+β|B| for A,B uniform cross-intersecting families. We determine the maximum sum, even if we have restrictions of the size of A.As corollaries, we will obtain some new bounds on the shadows and the shades of uniform families. We give direct proofs for these bounds, as well, and show that the theorems for cross-intersecting families also follow from these results.Finally, we will generalize the LYM inequality not only for cross-intersecting families, but also for arbitrary Sperner families.     

连通简单$r$-一致超图的约化

It is proved in this paper that if G is a simple connected r-uniform hypergraph with G ≥ 2, then G has an edge e such that G-e-V1(e) is also a simple connected r-uniform hypergraph. This reduction is naturally called a combined Graham reduction. Under the simple reductions of single edge removals and single edge contractions, the minor minimal connected simple r-uniform hypergraphs are also determined.     

Integrality properties of edge path tree families

An Edge Path Tree (EPT) family is a family whose members are edge sets of paths in a tree. Relying on the notion of Pie introduced in [M.C. Golumbic, R.E. Jamison, The edge intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B 38 (1985) 8-22], we characterize Ideal and Mengerian EPT families. In particular, we show that an EPT family is Ideal if and only if it is Mengerian. If, in addition, the EPT family is uniform, then it is Ideal if and only if it is Unimodular. The latter equivalence generalizes the well-known fact that the edge set of a graph is an Ideal clutter if and only if the graph is bipartite.     

Filter-linkedness and its effect on preservation of cardinal characteristics

We introduce the property “F-linked” of subsets of posets for a given free filter F on the natural numbers, and define the properties “μ-F-linked” and “θ-F-Knaster” for posets in a natural way. We show that θ-F-Knaster posets preserve strong types of unbounded families and of maximal almost disjoint families.Concerning iterations of such posets, we develop a general technique to construct θ-Fr-Knaster posets (where Fr is the Frechet ideal) via matrix iterations of <θ-ultrafilter-linked posets (restricted to some level of the matrix). This is applied to prove consistency results about Cichoń's diagram (without using large cardinals) and to prove the consistency of the fact that, for each Yorioka ideal, the four cardinal invariants associated with it are pairwise different.At the end, we show that three strongly compact cardinals are enough to force that Cichoń's diagram can be separated into 10 different values.