The Combinatorics of Polynomial Sequences

We present a combinatorial model for the several kinds of polynomial sequences of binomial type and develop many of the theorems about them from this model. In the first section, we present a prefab model for the binomial formula and the generating-function theorem. In Sec. 2, we introduce the notion of U-graph and give examples of binomial prefabs of U-graphs. The umbral composition of U-graphs provides an interpretation of umbral composition of polynomial sequences in Sees. 3 and 5. Rota's interpretation of the Stirling numbers of the first kind as sums of the Mobius function in the partition lattice inspired our model for inverse sequences of binomial type in Sec. 4. Section 6 contains combinatorial proofs of several operator-theoretic results. The actions of shift operators and delta operators are explained in set-theoretic terms. Finally, in Sec. 6 we give a model for cross sequences and Sheffer sequences which is consistent with their decomposition into sequences of binomial type. This provides an interpretation of shift-invariant operators. Of course, all of these interpretations require that the coefficients involved be integer and usually non-negative as well.     

Asymptotic expansions forL- andR-statistics under alternatives

In this paper we establish asymptotic expansions (a.e.) under alternatives for the distribution functions of sums of independent identically distributed random variables (i.i.d.r.v.'s.), linear combinations of order statistics, and one-sample rank statistics (L- and R-statistics). The general Lemma from [V. E. Bening,Bull. Moscow State Univ., Ser. 15, 2 36–44 (1994)] is applied to these statistics. Section 1 contains the statement of the theorem, in Sec. 2 the theorems is proved; its proof involves four auxiliary lemmas, also contained in Sec. 2. Finally Sec. 3 contains the proofs of these lemmas. Proceedings of the Seminar on Stability Problems for Stochastic Models, Moscow, 1993.     

On Isomorphisms of Relations Embedded into Each Other

In this paper, we consider analogs of the Cantor--Bernstein theorem for sets with binary relations. In Sec. 1, we prove an analog of this theorem for arbitrary binary relations; in Sec. 2, we consider an application; in Sec. 3, we study a class of relations with the Cantor-- Bernstein property and a class of exact relations, and prove that these classes are closed under certain operations.     

Inertia and eigenvalue relations between symmetrized and symmetrizing matrices for the real and the general field case

Starting from a theorem of Frobenius that every n×n matrix is the product of two symmetric ones, we study relations between the similarity invariants of a square matrix and the congruence invariants of its symmetric factors. Section 1 treats the real case, Sec. 2 the arbitrary field case, and Sec. 3 the indefinite inner product case for Krein spaces. The proofs are obtained from the real canonical pair form in Secs. 1 and 3 and from the recently found rational canonical pair form in Sec. 2, each time via combinatorial type arguments on weighted partitions of n. The resulting theorems typically give bounds for the elementary divisor structure of A in terms of the index or signature of one or both of its symmetric factors (or vice versa). Our results greatly extend and generalize the classic results of Klein, Loewy, Taussky, et al., and in Sec. 2 put new light on Waterhouse's recent characterization of hereditarily euclidean fields. A short survey on the history of the subject from the early 1800s on completes the paper.     

論ПОНТРЯГИН示性类,Ⅱ

<正> 前言 本文是[1]§§5,6中所述結果的詳細證明。 假定M是一個m維的可微分閉流形,是M的一個微分構造。對於而言,在M的各點的切面很自然地决定一個m歐氏空間叢。如果     

Representing links in 3-manifolds¶ by branched coverings of S3

We introduce a planar coloured-diagram representation of links in 3-manifolds given as branched coverings of the 3-sphere. We also prove an equivalence theorem based on local moves and the existence of a universal configuration for such representation. As an application we give unified proofs of two different results on existence of fibered links in 3-manifolds. Received: 7 April 1997     

Glivenko sequent classes in the light of structural proof theory

In 1968, Orevkov presented proofs of conservativity of classical over intuitionistic and minimal predicate logic with equality for seven classes of sequents, what are known as Glivenko classes. The proofs of these results, important in the literature on the constructive content of classical theories, have remained somehow cryptic. In this paper, direct proofs for more general extensions are given for each class by exploiting the structural properties of G3 sequent calculi; for five of the seven classes the results are strengthened to height-preserving statements, and it is further shown that the constructive and minimal proofs are identical in structure to the classical proof from which they are obtained.     

Asymptotically minimax testing ofr>2 simple hypotheses

In this paper, we consider the problem of asymptotically minimax testing ofr≥2 simple hypotheses when a general stochastic process is observed. We establish general conditions for the exponential decrease of maximal probability errors of minimax tests as the number of observations increases. At the present time, similar results for testing several multinomial schemes were obtained by Salihov [8]. Similar results for testing two simple hypotheses were obtained in [5]. In the proofs of the main results, we use the theory of large deviations ([3], [2]). In Sec. 1, the main result is proved. In Secs. 2–4, we analyze the i.i.d. case, nonhomogeneous Poisson processes, and renewal processes as examples. Published in Lietuvos Matematikos Rinkinys, Vol. 40, No. 3, pp. 313–320, July–September, 2000.     

Optimal static pricing for a tree network

We study the static pricing problem for a network service provider in a loss system with a tree structure. In the network, multiple classes share a common inbound link and then have dedicated outbound links. The motivation is from a company that sells phone cards and needs to price calls to different destinations. We characterize the optimal static prices in order to maximize the steady-state revenue. We report new structural findings as well as alternative proofs for some known results. We compare the optimal static prices versus prices that are asymptotically optimal, and through a set of illustrative numerical examples we show that in certain cases the loss in revenue can be significant. Finally, we show that static prices obtained using the reduced load approximation of the blocking probabilities can be easily obtained and have near-optimal performance, which makes them more attractive for applications.     

Correction to “Queue-proportional rate allocation with per-link information in multihop wireless networks”

There is a gap in the proofs of both Propositions 3 and 4 in the correspondence “Queue-Proportional Rate Allocation with Per-Link Information in Multihop Wireless Networks,” previously published in the Queueing Systems (see Li and Srikant 2016). We filled this gap in the proofs for the multihop networks (see Li and Srikant in Queueing Syst 84:203–210, 2016), where each route at most has two links. In this note, we completely fill the gap in the proofs in our original paper (see Li and Srikant in Queueing Syst 83:329–359, 2016).     

A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6

The non-existence of a pair of mutually orthogonal Latin squares of order six is a well-known result in the theory of combinatorial designs. It was conjectured by Euler in 1782 and was first proved by Tarry in 1900 by means of an exhaustive enumeration of equivalence classes of Latin squares of order six. Various further proofs have since been given, but these proofs generally require extensive prior subject knowledge in order to follow them, or are ‘blind’ proofs in the sense that most of the work is done by computer or by exhaustive enumeration. In this paper we present a graph-theoretic proof of a somewhat weaker result, namely the non-existence of self-orthogonal Latin squares of order six, by introducing the concept of a self-orthogonal Latin square graph. The advantage of this proof is that it is easily verifiable and accessible to discrete mathematicians not intimately familiar with the theory of combinatorial designs. The proof also does not require any significant prior knowledge of graph theory.     

General logical metatheorems for functional analysis

In this paper we prove general logical metatheorems which state that for large classes of theorems and proofs in (nonlinear) functional analysis it is possible to extract from the proofs effective bounds which depend only on very sparse local bounds on certain parameters. This means that the bounds are uniform for all parameters meeting these weak local boundedness conditions. The results vastly generalize related theorems due to the second author where the global boundedness of the underlying metric space (resp. a convex subset of a normed space) was assumed. Our results treat general classes of spaces such as metric, hyperbolic, CAT(0), normed, uniformly convex and inner product spaces and classes of functions such as nonexpansive, Hölder-Lipschitz, uniformly continuous, bounded and weakly quasi-nonexpansive ones. We give several applications in the area of metric fixed point theory. In particular, we show that the uniformities observed in a number of recently found effective bounds (by proof theoretic analysis) can be seen as instances of our general logical results.

     

Quasi-monte carlo methods for numerical integration of multivariate Haar series

In the present paper we study quasi-Monte Carlo methods to integrate functions representable by generalized Haar series in high dimensions. Using (t, m, s)-nets to calculate the quasi-Monte Carlo approximation, we get best possible estimates of the integration error for practically relevant classes of functions. The local structure of the Haar functions yields interesting new aspects in proofs and results. The results are supplemented by concrete computer calculations. Research supported by the Austrian Science Foundation (FWF), project no. P11143-MAT.     

Parabolic spaces

In the present paper we define parabolic spaces with simple fundamental Lie groups and we construct models of them, establish a relation between parabolic and reductive spaces, describe the topological structure of parabolic spaces with classical Lie fundamental groups.The introduction and Sec. 1 were written by B. A. Rozenfel'd, Sec. 2 by M. P. Zamakhovskii, Sec. 3 by T. A. Timoshenko.Translated from Itogi Nauki i Tekhniki, Seriya Algebra, Topologiya, Geometriya, Vol. 26, pp. 125–160, 1988.     

“格拉斯曼”流形中的平方运算

<正> 本文及以下一文是作者在1950-1951年间关于球纤维织示性类(characteristicclass)所得结果的综合报告,其中有些结果已发表而无详细证明[1,2],有些则尚未发表过。我们知道 m-1维球纤维织的理论[3]可归结到“格拉斯曼”流形G_(n,m)(n>m)的研究.G_(n,m)的任一上同调类(系数群任意)引出m-1维球织     

Generalized dimension of an ordered set and its MacNeille completion

We investigate generalizations of the order dimension, as for example the interval dimension, and study the question for which classes the generalized dimension of an ordered set and its MacNeille completion is the same. We present proofs for a number of classes, however disprove a more general conjecture.The second author acknowledges the support by the Deutsche Forschungsgemeinschaft.     

A General Zero-Knowledge Scheme

There is a great similarity between the zero-knowledge proof of quadratic residuocity presented by Goldwasser-Micali-Rackoff and the graph isomorphism proof presented by Goldreich-Micali-Wigderson. There is also a resemblance between the zero-knowledge proofs of Fiat-Shamir, Chaum-Evertse-van de Graaf, Beth and Guillou-Quisquater. A similar observation holds for zero-knowledge proofs based on encryption: the 3-colourability proofs and the Hamiltonian-circuit proofs of Blum and Goldreich-Micali-Wigderson, and the Brassard-Chaum-Crepeau proof for SAT. Feige, Fiat and Shamir introduced the concept of zero-knowledge proofs of knowledge. In this paper we present a general zero-knowledge scheme which unifies all these Arthur-Merlin proofs.     

Some logical metatheorems with applications in functional analysis

In previous papers we have developed proof-theoretic techniques for extracting effective uniform bounds from large classes of ineffective existence proofs in functional analysis. Here `uniform' means independence from parameters in compact spaces. A recent case study in fixed point theory systematically yielded uniformity even w.r.t. parameters in metrically bounded (but noncompact) subsets which had been known before only in special cases. In the present paper we prove general logical metatheorems which cover these applications to fixed point theory as special cases but are not restricted to this area at all. Our theorems guarantee under general logical conditions such strong uniform versions of non-uniform existence statements. Moreover, they provide algorithms for actually extracting effective uniform bounds and transforming the original proof into one for the stronger uniformity result. Our metatheorems deal with general classes of spaces like metric spaces, hyperbolic spaces, CAT(0)-spaces, normed linear spaces, uniformly convex spaces, as well as inner product spaces.