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

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

An Elementary Proof of Pólya-Vinogradov's Inequality, II

Let be a primitive character mod k, k > 2. In [1], the following elementary estimate

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 .     

Lyapunov exponent and rotation number for stochastic Dirac operators

In this paper, we consider the stochastic Dirac operatoron a polish space (Ω,β, P). The relation between the Lyapunov index, rotation number andthe spectrum of L_ω is discussed. The existence of the Lyapunov index and rotation number isshown. By using the W-T functions and W-function we prove the theorems for L_ω as in Kotani[1], [2] for Schrodinger operatorB, and in Johnson [5] for Dirac operators on compact space.     

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.     

A Minimal-Automaton-Based Algorithm for the Reliability of Con(d,k, n) Systems

A d-within-consecutive-k-out-of-n system, abbreviated as Con(d, k, n), is a linear system of n components in a line which fails if and only if there exists a set of k consecutive components containing at least d failed ones. So far the fastest algorithm to compute the reliability of Con(d, k, n) is Hwang and Wright's algorithm published in 1997, where . In this paper we use automata theory to reduce to . For d small or close to k, we have reduced from exponentially many (in k) to polynomially many. The computational complexity of our final algorithm is , where .     

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.     

Decomposition Method for a Class of Monotone Variational Inequality Problems

In the solution of the monotone variational inequality problem VI(, F), with

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

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

Branching inset entropies on open domains

The forms of all semisymmetric, branching, multidimensional measures of inset information on open domains are determined. This is done for both the complete and the possibly incomplete partition cases. The key to these results is to find the general solution of the functional equation

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

We give an asymptotic formula for

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

The paper deals with the system

Hamiltonicity in balancedk-partite graphs

One of the earliest results about hamiltonian graphs was given by Dirac. He showed that if a graphG has orderp and minimum degree at least thenG is hamiltonian. Moon and Moser showed that a balanced bipartite graph (the two partite sets have the same order)G has orderp and minimum degree more than thenG is hamiltonian. In this paper, their idea is generalized tok-partite graphs and the following result is obtained: LetG be a balancedk-partite graph with orderp = kn. If the minimum degree

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:

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

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

Concentration phenomena in weakly coupled elliptic systems with critical growth*

In this paper we consider the weakly coupled elliptic system with critical growth

The Binet-Pexider functional equation for rectangular matrices

IfK is a field of characteristic 0 then the following is shown. Iff, g, h: M _n (K) K are non-constant solutions of the Binet—Pexider functional equation

Asymptotic solution of a turán-type problem

LetA, B, C be disjointk-element sets. It is shown that if a 2k-graph onn vertices contains no three edges of the formA B, A C, B C then it has at most edges. Moreover, this is essentially best possible.