Inclusion-exclusion inequalities

Ifμ is a positive measure, andA ₂, ...,A _n are measurable sets, the sequencesS ₀, ...,S _n andP _[0], ...,P _[n] are related by the inclusion-exclusion equalities. Inequalities among theS _i are based on the obviousP _[k]≧0. Letting =the average average measure of the intersection ofk of the setsA _i , it is shown that (−1) ^k Δ ^k M _i ≧0 fori+k≦n. The casek=1 yields Fréchet’s inequalities, andk=2 yields Gumbel’s and K. L. Chung’s inequalities. Generalizations are given involvingk-th order divided differences. Using convexity arguments, it is shown that forS ₀=1, whenS ₁≧N−1, and for 1≦k<N≦n andv=0, 1, .... Asymptotic results asn → ∞ are obtained. In particular it is shown that for fixedN, for all sequencesM ₀, ...,M _n of sufficiently large length if and only if for 0<t<1.     

Extensions of hereditary algebras

Let be a triangular matrix algebra, uhere k is an algebraically closed field, B is the path algebra of an oriented Dynkin diagram of type E₆ or E₇ or E₈ and M is a finite dimensional k-B-bimodule. The aim of this paper is to determine the representation type of A for any orientation of the Dynkin diagram and for any indecomposable B-module M. This classification is obtained by comparing the representation types of the algebras and using the theory of tilting modules.     

On the number of faces of centrally-symmetric simplicial polytopes

I. Bárány and L. Lovász [Acta Math. Acad. Sci. Hung.40, 323–329 (1982)] showed that ad-dimensional centrally-symmetric simplicial polytopeP has at least 2 ^d facets, and conjectured a lower bound for the numberf _i ofi-dimensional faces ofP in terms ofd and the numberf ₀ =2n of vertices. Define integers A. Björner conjectured (unpublished) that (which generalizes the result of Bárány-Lovász sincef _d–1 = h _i ), and more strongly that , which is easily seen to imply the conjecture of Bárány-Lovász. In this paper the conjectures of Björner are proved.Partially supported by NSF grant MCS-8104855. The research was performed when the author was a Sherman Fairchild Distinguished Scholar at Caltech.     

C-wellposedness of the complete second order abstract cauchy problem and applications

In this paper, we first give a sufficient and necessary condition for to generate an exponentially bounded -semigroup and discuss its relations to the C-wellposedness of the complete second order abstract Cauchy problem ((ACP₂) for short) in some sense. Then we use these results and those in [1] to discuss the C-(exponential) wellposedness of a kind of (ACP₂) with application backgrounds, and develop the results in [2]. This project is supported by the NNSF of China, and the Youth Science and Technique Foundation of Shanxi Province, China     

On the Order of Magnitude of the Divisor Function

Let D be an increasing sequence of positive integers, and consider the divisor functions： d（n, D） =∑d｜n,d∈D,d≤√n1, d2（n,D）=∑[d,δ]｜n,d,δ∈D,[d,δ]≤√n1, where [d,δ]=1.c.m.（d,δ）. A probabilistic argument is introduced to evaluate the series ∑n=1^∞and（n,D） and ∑n=1^∞and2（n,D）.     

Über lineare Komplexe von Räumen höchster Dimension einer nicht entarteten Quadrik

Sunto Conoscendo il modello minimo per la totalità degli S _k ^I d'una schiera giacenti su di una quadrica Q_2k di S_2k+1 si definisce il ? complesso lineare di S _k ^I ? come imagine d'una sezione iperpiana di . Il problema della classificazione projettiva di tali complessi lineari è posto e risolto per k≤5.      

Minimal coupled diffusion process

An attempt is made to classify the boundary of the coupled operator and to construct the corresponding minimal semigroup and minimal coupled diffusion process. The sample properties and the conservative conditions of the process are discussed also.     

Counting the number of isotone selfmappings of crowns

Letn>1. The number of all strictly increasing selfmappings of a 2n-element crown is . The number of all order-preserving selfmappings of a 2n-element crown is

An asymptotic formula for the minimal capacity among sets of equal area

We give an asymptotic formula for

Natural bounded concentrators

We give the first known direct construction for linear families of bounded concentrators. The construction is explicit and the results are simple natural bounded concentrators. Let be the field withq elements,g(x)∈F _q [x] of degree greater than or equal to 2, and . LetI _nputs=H/A,O _utputs=H/B, and draw an edge betweenaA andbB iffaA∩bB≠ϕ. We prove that for everyq≥5 this graph is an concentrator. Part of this research was done while the author was at the department of Computer Science, The University of British Columbia, Vancouver, B.C., Canada.     

Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs

The asymptotic properties of the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs are studied. Let be a directed circulant graph. Let and be the numbers of spanning trees and of Eulerian trails, respectively. Then

Коэффициенты рядов Ф урье и класс Липшица

We generalize and sharpen certain results concerning Fourier series from the Lipschitz class. In particular, for sinnx we prove the following: Let ¦b_n¦n^–2L(n) where L(x) is a continuous and slowly oscillating function. Then

Interlineation of functions of 2 variables on M (M≥2) lines with the highest algebraic precision

A general algorithm is proposed for constructing interlineation operators , x=(x₁, x₂) with the properties

Packing measure functions of subordinators sample paths

X(t) (t∉[0,∞)) is a subordinator with its upper index β less than one, g(u) is the index function ofX(t), andX(t), andX[0,1]={xϕR:X(t)=x} for sometϕ[0,1]{. If φ(s)(sϕ(0,1)) is a measure function andh , then

Zur Theorie Linearer Abbildungen I

The paper is concerned with a uniform geometric definition of linear mappings in a projective or grassmannian space into a projective space. We discuss sufficient conditions for the existence of a linear mapping in a finite dimensional pappian projective space which continues two given linear mappings in complementary subspaces.The subspace spanned by the image set of a linear mapping in the grassmannian of d-dimensional subspaces of an n-dimensional projective space has at most dimension –1.     

A class of hypergeometric polynomials

Summary In this paper we study the properties of the polynomials . This paper is taken from the author’s dissertation written under the direction of ProfessorL. Carlitz.     

Effects Connected with the Coincidence of Velocities in the Two-Velocity Dynamical System

The paper deals with the system

A bound on local minima of arrangements that implies the upper bound theorem

This paper shows that thei-level of an arrangement of hyperplanes inE ^d has at most local minima. This bound follows from ideas previously used to prove bounds on (≤k)-sets. Using linear programming duality, the Upper Bound Theorem is obtained as a corollary, giving yet another proof of this celebrated bound on the number of vertices of a simple polytope inE ^d withn facets.     

On theq-log-concavity of Gaussian binomial coefficients

We give a combinatorial proof that is a polynomial inq with nonnegative coefficients for nonnegative integersa, b, k, l withab andlk. In particular, fora=b=n andl=k, this implies theq-log-concavity of the Gaussian binomial coefficients , which was conjectured byButler (Proc. Amer. Math. Soc. 101 (1987), 771–775).     

Integral-valued rational functions on valued fields

Let K be a field and a non-trivial valuation ring of K withm as its maximal ideal. Denote by and the rings of polynomials f∈K[X] and rational functions f∈K(X) resp. such that . We prove that for one variable X we have if and only if the completion of (K, ) is locally compact or algebraically closed. In the second case—i.e. if K is dense in the algebraic closure of (K, )—we even get for any number of variables X=(X₁,...,X_n). This work contains parts of the second author's thesis [Ri] written under the supervision of the first author.