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.     

Global existence and decay estimates for solutions of degenerate parabolic equations

ThisresearchissupportedbytheNationalNaturalScienceFoundationofChina.1.IntroductionInthispaper,weconsiderthefollowinginitial--boundaryvalueproblemwhereQ~fix(o,co),aQ=aflx(o,co),fiisaboundeddomaininEuclideanspaceR"(n22)withsmoothboundaryonandac=(u.,,'Iu..)denotesthegradientoffunctionu(x).Weassumethefunctionsal(x,t,u,p)(i=1,2,',n)anda(x,t,u,p)arelocallyH5ldercontinuousonfix(0,co)suchthatwherealtuandparepositiveconstants,m,aZIa3.hi,b2,alIadZ20,or321areconstants,m*E[0,m 2),hi16z/0,afl m*/…     

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

Distribution-independent properties of the convex hull of random points

Denote byV _n ^(d) the expected volume of the convex hull ofn points chosen independently according to a given probability measure in Euclideand-spaceE ^d. Ifd=2 ord=3 and is the measure corresponding to the uniform distribution on a convex body inE ^d, Affentranger and Badertscher derived that

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).     

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 construction ofk-wise independent random variables

A 0–1probability space is a probability space (, 2,P), where the sample space -{0, 1} ⁿ for somen. A probability space isk-wise independent if, whenY _i is defined to be theith coordinate or the randomn-vector, then any subset ofk of theY _i 's is (mutually) independent, and it is said to be a probability spacefor p ₁,p ₂, ...,p _n ifP[Y _i =1]=p _i .We study constructions ofk-wise independent 0–1 probability spaces in which thep _i 's are arbitrary. It was known that for anyp ₁,p ₂, ...,p _n , ak-wise independent probability space of size always exists. We prove that for somep ₁,p ₂, ...,p _n [0,1],m(n,k) is a lower bound on the size of anyk-wise independent 0–1 probability space. For each fixedk, we prove that everyk-wise independent 0–1 probability space when eachp _i =k/n has size (n _k ). For a very large degree of independence —k=[n], for >1/2- and allp _i =1/2, we prove a lower bound on the size of . We also give explicit constructions ofk-wise independent 0–1 probability spaces.This author was supported in part by NSF grant CCR 9107349.This research was supported in part by the Israel Science Foundation administered by the lsrael Academy of Science and Humanities and by a grant of the Israeli Ministry of Science and Technology.     

Ancestor tree for arbitrary multi-terminal cut functions

In many applications, a function is defined on the cuts of a network. In the max-flow min-cut theorem, the function on a cut is simply the sum of all capacities of edges across the cut, and we want the minimum value of a cut separating a given pair of nodes. To find the minimum cuts separating pairs of nodes, we only needn – 1 computations to construct the cut-tree. In general, we can define arbitrary values associated with all cuts in a network, and assume that there is a routine which gives the minimum cut separating a pair of nodes. To find the minimum cuts separating pairs of nodes, we also only needn – 1 routine calls to construct a binary tree which gives all minimum partitions. The binary tree is analogous to the cut-tree of Gomory and Hu.     

Gauss polynomials and the rotation algebra

Newton's binomial theorem is extended to an interesting noncommutative setting as follows: If, in a ring,ba=ab with commuting witha andb, then the (generalized) binomial coefficient arising in the expansion

An exact FCFS waiting time analysis for a general class of G/G/s queueing systems

A closed form expression for the waiting time distribution under FCFS is derived for the queueing system MGE_k/MGE_m/s, where MGE_n is the class of mixed generalized Erlang probability density functions (pdfs) of ordern, which is a subset of the Coxian pdfs that have rational Laplace transform. Using the calculus of difference equations and based on previous results of the author, it is proved that the waiting time distribution is of the form 1- , under the assumption that the rootsU _j are distinct, i.e. belongs to the Coxian class of distributions of order . The present approach offers qualitative insight by providing exact and asymptotic expressions, generalizes and unifies the well known theories developed for the G/G/1,G/M/s systems and leads to an algorithm, which is polynomial if only one of the parameterss orm varies, and is exponential if both parameters vary. As an example, numerical results for the waiting time distribution of the MGE₂/MGE₂/s queueing system are presented.     

An Upper Bound for the Cardinality of an <Emphasis Type="Italic">s</Emphasis>-Distance Set in Euclidean Space

In this paper we show that if X is an s-distance set in ^m and X is on p concentric spheres then Moreover if X is antipodal, then .     

Analysis of uniform binary subdivision schemes for curve design

The paper analyses the convergence of sequences of control polygons produced by a binary subdivision scheme of the form

A 2-extension of the field ℚ of rational numbersof rational numbers

It is proved that the rational number field has one, and only one, normal 2-extension (_{2, t8)}/with group isomorphic to .If is the maximal subfield of a real-closed field, which does not contain ,then the algebraic closure of is isomorphic to the field .Bibliography: 7titles.Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 236, 1997, pp. 192–196.     

Upper bound theorems for homology manifolds

In this paper we prove the Upper Bound Conjecture (UBC) for some classes of (simplicial) homology manifolds: we show that the UBC holds for all odd-dimensional homology manifolds and for all 2k-dimensional homology manifolds Δ such that β _k (Δ)⩽Σ{β _i (Δ):i ≠k-2,k,k+2 and 1 ⩽i⩽2k-1}, where β _i (Δ) are reduced Betti numbers of Δ. (This condition is satisfied by 2k-dimensional homology manifolds with Euler characteristic χ≤2 whenk is even or χ≥2 whenk is odd, and for those having vanishing middle homology.) We prove an analog of the UBC for all other even-dimensional homology manifolds. Kuhnel conjectured that for every 2k-dimensional combinatorial manifold withn vertices, . We prove this conjecture for all 2k-dimensional homology manifolds withn vertices, wheren≥4k+3 orn≤3k+3. We also obtain upper bounds on the (weighted) sum of the Betti numbers of odd-dimensional homology manifolds.     

On some new identities for the Fibonomial coefficients

Let F _n be the nth Fibonacci number. The Fibonomial coefficients \(\left[ {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right]_F\) are defined for n ≥ k > 0 as follows $$\left[ {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right]_F = \frac{{F_n F_{n - 1} \cdots F_{n - k + 1} }} {{F_1 F_2 \cdots F_k }},$$ with \(\left[ {\begin{array}{*{20}c} n \\ 0 \\ \end{array} } \right]_F = 1\) and \(\left[ {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right]_F = 0\) . In this paper, we shall provide several identities among Fibonomial coefficients. In particular, we prove that $$\sum\limits_{j = 0}^{4l + 1} {\operatorname{sgn} (2l - j)\left[ {\begin{array}{*{20}c} {4l + 1} \\ j \\ \end{array} } \right]_F F_{n - j} = \frac{{F_{2l - 1} }} {{F_{4l + 1} }}\left[ {\begin{array}{*{20}c} {4l + 1} \\ {2l} \\ \end{array} } \right]_F F_{n - 4l - 1} ,}$$ holds for all non-negative integers n and l.     

Hyponormality of Toeplitz Operators with Polynomial and Symmetric-Type Symbols

Suppose that is a trigonometric polynomial of the form (z) = ^N_n=-N a_n zⁿ. It is well-known that T is normal if and only if | a_{– N}| =  | a_N| and the Fourier coefficients of satisfy the following symmetry condition:

Extremal Distances between Sections of Convex Bodies

Let K, D be centrally symmetric convex bodies in Let k < n and let d_k(K, D) be the smallest Banach–Mazur distance between k-dimensional sections of K and D. Define

Some correlation inequalities in finite posets

Posets are said to be correlated with respect to another poset R on X (we write A _R B) if P(RA) P(RB)P(RAB) P(R). Here P(S) is the probability that a randomly chosen bijection from X to the totally ordered set with |X| elements is a linear extension of S. We study triples (A, B, R) such that A _R B holds for all extensions S of R (we write A _R B). Two well-known correlation inequalities, the xyz inequality and an inequality of Graham, Yao, and Yao, can be considered as giving cases when this relation holds. We show when the Graham, Yao, and Yao inequality holds strictly. Our main result is a classification of all R such that (a, b) _R (c, d) holds, where a, b, c, d are elements of X.     

Exponential estimates of distributions of random fields

Exponential estimates are obtained for a field x_st which is a solution of a stochastic Goursat problem.Translated from Teoriya Sluchainykh Protsessov, No. 16, pp. 33–38, 1988.     

Higher dimensional analogues of Klein's quadric

The basic idea is a mapping from d-dimensional subspaces of a 2d-dimensional vector space onto points in a projective space of dimension . We develop conditions under which a point in the larger projective space is an image point under this mapping. We also develop conditions corresponding to cases where the d-dimensional vector spaces do or do not intersect.Dedicated to A. Wagner on his 60th birthday