THE EXTREME POINTS OF SEVERAL CLASSES OF ANALYTIC FUNCTIONS

1Intr0ducti0nLetAden0tethesetofallfunctionsanalyticinA={z:Izl<1}.LetB={W:WEAandIW(z)l51}.Aisalocallyconvexlineaztop0l0gicalspacewithrespecttothetopologyofuniformconvergenceon`c0mpact8ubsetsofA-LetTh(c1,'tc.-1)={p(z):p(z)EA,Rop(z)>0,p(z)=1 clz czzz ' c.-lz"-l 4z" ',wherecl,',cn-1areforedcomplexconstants}.LetTh,.(b,,-..,b,-,)={p(z):P(z)'EAwithReP(z)>Oandp(z)=1 blz ' b.-lz"-l 4z" '-,wherebl,-'-jbu-1areffeedrealconstantsanddkarerealnumbersf0rk=n,n 1,'--}-LetTu(l1,'i'tI.-1)={…     

Minimal free resolutions of monomial curves in P3k

Minimal free resolutions for prime ideals with generic zero (tn3,tn3?n10tn11,tn3?n20tn2, tn31), n1<n2<n3 positive integers, (n1,n2,n3)=1, are determined.     

Weighted rational approximation in the complex plane

Given a triple (G, W, γ) of an open bounded set G in the complex plane, a weight function W(z) which is analytic and different from zero in G, and a number γ with 0 ≤ γ ≤ 1, we consider the problem of locally uniform rational approximation of any function ƒ(z), which is analytic in G, by weighted rational functions W^m_i+n_i(z)R_mi, n_i(z)_{i = 0}^∞, where R_mi, n_i(z) = P_mi(z)/Q_ni(z) with deg P_mi ≤ m_i and deg Q_ni ≤ n_i for all i ≥ 0 and where m_i + n_i → ∞ as i → ∞ such that lim m_i/[m_i + n_i] = γ. Our main result is a necessary and sufficient condition for such an approximation to be valid. Applications of the result to various classical weights are also included.     

Identities between q-hypergeometric and hypergeometric integrals of different dimensions

Given complex numbers m₁,l₁ and nonnegative integers m₂,l₂, such that m₁+m₂=l₁+l₂, for any a,b=0,…,min(m₂,l₂) we define an l₂-dimensional Barnes type q-hypergeometric integral I_a,b(z,μ;m₁,m₂,l₁,l₂) and an l₂-dimensional hypergeometric integral J_a,b(z,μ;m₁,m₂,l₁,l₂). The integrals depend on complex parameters z and μ. We show that I_a,b(z,μ;m₁,m₂,l₁,l₂) equals J_a,b(e^μ,z;l₁,l₂,m₁,m₂) up to an explicit factor, thus establishing an equality of l₂-dimensional q-hypergeometric and m₂-dimensional hypergeometric integrals. The identity is based on the duality for the qKZ and dynamical difference equations.     

A new reduction method in integer programming

The system of two equations in nonnegative integer unknowns x_j and expressed in the form ∑ⁿ_j=1 a_1jx_j=b₁, ∑ⁿ_j=1 a_2jx_j=b₂ has equivalent solutions to the single equation ∑ⁿ_j=1 (t₁a_ij+t₂a_2j)a_j= t₁b₁+t₂b₂, provided t₁ and t₂ are suitably chosen. Glover [2] has n inequalities for determining t₁ and t₂. Elimam and Elmaghraby [1] try to achieve a single inequality for t₁ and t₂. We show, however, that the inequality of [1] may give t₁ and t₂ values that do not produce equivalence. We present a new theorem which leads to a single inequality constraint giving t₁ and t₂ values that consistently produce equivalence.     

The Erd?s-Ginzburg-Ziv theorem for dihedral groups

Let n≥23 be an integer and let D_2n be the dihedral group of order 2n. It is proved that, if g₁,g₂,…,g_3n is a sequence of 3n elements in D_2n, then there exist 2n distinct indices i₁,i₂,…,i_2n such that g_i1g_i2?g_i2n=1. This result is a sharpening of the famous Erd?s-Ginzburg-Ziv theorem for G=D_2n.     

The multi-fan graphs are determined by their Laplacian spectra

A multi-fan graph is a graph of the form (P_n1+P_n2+?+P_nk)×b, where b is a universal vertex, and P_n1+P_n2+?+P_nk is the disjoint union of paths P_ni(n_i?1) for i=1,2,…,k. In particular, if k=1, the multi-fan graph P_n1×b is the classical fan graph F_n1+1. It is proved that all the multi-fan graphs are determined by their Laplacian spectra.     

Ordering Functions of Random Vectors, with Application to Partial Sums

It is known that the sums of the components of two random vectors (X ₁,X ₂,…,X _n ) and (Y ₁,Y ₂,…,Y _n ) ordered in the multivariate (s ₁,s ₂,…,s _n )-increasing convex order are ordered in the univariate (s ₁+s ₂+?+s _n )-increasing convex order. More generally, real-valued functions of (X ₁,X ₂,…,X _n ) and (Y ₁,Y ₂,…,Y _n ) are ordered in the same sense as long as these functions possess some specified non-negative cross-derivatives. This note extends these results to multivariate functions. In particular, we consider vectors of partial sums (S ₁,S ₂,…,S _n ) and (T ₁,T ₂,…,T _n ) where S _j =X ₁+?+X _j and T _j =Y ₁+?+Y _j and we show that these random vectors are ordered in the multivariate (s ₁,s ₁+s ₂,…,s ₁+?+s _n )-increasing convex order. The consequences of these general results for the upper orthant order and the orthant convex order are discussed.     

Connectivity of Cartesian product graphs

Use v_i,κ_i,λ_i,δ_i to denote order, connectivity, edge-connectivity and minimum degree of a graph G_i for i=1,2, respectively. For the connectivity and the edge-connectivity of the Cartesian product graph, up to now, the best results are κ(G₁×G₂)?κ₁+κ₂ and λ(G₁×G₂)?λ₁+λ₂. This paper improves these results by proving that κ(G₁×G₂)?min{κ₁+δ₂,κ₂+δ₁} and λ(G₁×G₂)=min{δ₁+δ₂,λ₁v₂,λ₂v₁} if G₁ and G₂ are connected undirected graphs; κ(G₁×G₂)?min{κ₁+δ₂,κ₂+δ₁,2κ₁+κ₂,2κ₂+κ₁} if G₁ and G₂ are strongly connected digraphs. These results are also generalized to the Cartesian products of connected graphs and n strongly connected digraphs, respectively.     

An addition theorem for finite Abelian groups

If g₁, g₂, …, g_2n?1 is a sequence of 2n ? 1 elements in an Abelian group G of order n, it is known that there are n distinct indices i₁, i₂, …, i_n such that 0 = g_i1 + g_i2 + ? + g_in. In this paper a suitably general condition on the sequence is given which insures that every element g in G has a representation g = g_i1 + g_i2 + ? + g_in as the sum of n terms of the sequence.     

Criteria for embedding of spaces constructed by the method of means with arbitrary quasi-concave functional parameters

We consider a generalization ?(X₀,X₁)_p0,p1 of the method of means to arbitrary non-degenerate functional parameter. In this case non-trivial embedding ?(X₀,X₁)_p0,p1⊂ψ(X₀,X₁)_q0,q1 take place. We find necessary and sufficient condition for such embedding if 1?q₀?p₀?∞ and 1?q₁?p₁?∞ or 1?p₀?q₀?∞ and 1?p₁?q₁?∞.     

Variation of the Alexander-Conway polynomial under Dehn surgery

Let ε₁ and ε₂ belong to {±1}. When the ε₁-surgery along a knot K₁ in S³ produces the same homology sphere as the ε₂-surgery along a knot K₂ in S³, then the Casson surgery formula implies that ε₁Δ_K1″(1)=ε₂Δ_K2″(1), where Δ(t) denotes the symmetric Alexander polynomial. For any pair (Λ₁(t),Λ₂(t)) of possible knot Alexander polynomials such that ε₁Λ₁″(1)=ε₂Λ₂″(1), we exhibit a pair (K₁,K₂) of knots in S³ such that Δ_K1(t)=Λ₁(t), Δ_K2(t)=Λ₂(t) and the ε₁-surgery along K₁ produces the same homology sphere as the ε₂-surgery along K₂.     

Paths and edge-connectivity in graphs III. Six-terminalk paths

Suppose thatk ≥ 1 is an odd integer, (s ₁,t ₁),..., (s _k> ,t _k ) are pairs of vertices of a graphG andλ(s _i ,t _i ) is the maximal number of edge-disjoint paths betweens _i andt _i . We prove that ifλ(s _i ,t _i )≥ k (1≤ i ≤ k) and |{s ₁,...s _k ,t ₁,...,t _k }| ≤ 6, then there exist edge-disjoint pathsP ₁,...,P _k such thatP _i has endss _i andt _i (1≤ i ≤ k).     

On cyclic decompositions of the complete graph into the 2-regular graphs

The symbol C(m₁ ⁿ ₁m₂ ⁿ ₂...m_s ⁿ _s) denotes a 2-regular graph consisting ofn _i cycles of lengthm _i , i=1, 2,…,s. In this paper, we give some construction methods of cyclic(K _v ,G)-designs, and prove that there exists a cyclic(K _v , G)-design whenG=C((4m ₁) ⁿ ₁(4m ₂) ⁿ ₂...(4m _s ) ⁿ _s andv ≡ 1 (mod 2¦G¦).     

The periods of the sequences generated by some symmetric shift registers

E_k(x₂,…, x_n) is defined by E_k(a₂,…, a_n) = 1 if and only if ∑_i=2ⁿa_i = k. We determine the periods of sequences generated by the shift registers with the feedback functions x₁ + E_k(x₂,…, x_n) and x₁ + E_k(x₂,…, x_n) + E_k+1(x₂,…, x_n) over the field GF(2).     

Stochastic comparisons of order statistics from gamma distributions

Let (X₁,X₂,…,X_n) and (Y₁,Y₂,…,Y_n) be gamma random vectors with common shape parameter α(0<α?1) and scale parameters (λ₁,λ₂,…,λ_n), (μ₁,μ₂,…,μ_n), respectively. Let X₍₎=(X₍₁₎,X₍₂₎,…,X_(n)), Y₍₎=(Y₍₁₎,Y₍₂₎,…,Y_(n)) be the order statistics of (X₁,X₂,…,X_n) and (Y₁,Y₂,…,Y_n). Then (λ₁,λ₂,…,λ_n) majorizes (μ₁,μ₂,…,μ_n) implies that X₍₎ is stochastically larger than Y₍₎. However if the common shape parameter α>1, we can only compare the the first- and last-order statistics. Some earlier results on stochastically comparing proportional hazard functions are shown to be special cases of our results.     

An explicit expression for the cost of a class of Huffman trees

Let T_n denote a binary tree with n terminal nodes V={υ₁,…,υ_n} and let l_i denote the path length from the root to υ_i. Consider a set of nonnegative numbers W={w₁,…,w_n} and for a permutation π of {1,…,n} to {1,…,n}, associate the weight w_i to the node υ_π(i). The cost of T_n is defined as C(T_n∣W)=Min_π∑ⁿ_i=1w_il_π(i).A Huffman tree H_n is a binary tree which minimizes C(T_n∣W) over all possible T_n. In this note, we give an explicit expression for C(H_n∣W) when W assumes the form: w_i=k for i=1,…,n?m; w_i=x for i=n?m+1,…,n. This simplifies and generalizes earlier results in the literature.     

Class G,and a unification problem

In 1958, Karl Goldberg proved the following: Theorem G. Suppose A=(a_ij) is an n×n matrix over the complex field, with the following properties: (1) a_ija_ji?0 for i,j=1,2,…,n, and (2) a_i1i2a_i2i3?a_isii=a_i2i1a_i3i2?a_i1is for all s=1,2,…,n and i_t=1,2,…,n. Then A has only real characteristic values. Definition. Let G_n denote the class of n×n matrices over $\text{C}$, the complex field, which satisfy the Goldberg conditions (1) and (2). We investigate some properties of class G related to the following topics: Schur complements, weak sign symmetry, and inequalities due to Oppenheim for positive definite matrices, and an analogue due to Markham for tridiagonal, oscillatory matrices.     

Enumeration of sequences of given specification according to rises,falls and maxima

Letn = (a₁.a₂ … a_N) denote a sequence of integers a_i={1.2.…n}. A rise is a part a_i.a_i+1 with a_i <a_i+1: a fall is a pair with a_ia_i+1: a level is a pair with a_i = a_i+1. A maximum is a triple a_i-1.a_ia_i+1 with a_i-1?a_i.a_i?a_i+1. If e_i is the number of a_j?n witha_j = i, then [e₁…e_n] is called the specification of n. In addition, a conventional rise is counted to the left of a₁ and a conventional fall to the right of a_N: ifa₁?a₂, then a₁ is counted as a conventional maximum, similarly if a_N-1 ? a_N thena_N is a conventional maximum. Simon Newcomb's problem is to find the number of sequences n with given specification and r rises; the refined problem of determining the number of sequences of given specification with r rises and s falls has also been solved recently. The present paper is concerned with the problem of finding the number of sequences of given specification with r rises, s falls. λ levels and λ maxima. A generating function for this enumerant is obtained as the quotient of two continuants. In certain special cases this result simplifies considerably.     

The Ramsey number for hypergraph cycles I

Let C_n denote the 3-uniform hypergraph loose cycle, that is the hypergraph with vertices v₁,…,v_n and edges v₁v₂v₃, v₃v₄v₅, v₅v₆v₇,…,v_n-1v_nv₁. We prove that every red-blue colouring of the edges of the complete 3-uniform hypergraph with N vertices contains a monochromatic copy of C_n, where N is asymptotically equal to 5n/4. Moreover this result is (asymptotically) best possible.