In this paper, we establish a general summation theorem. From it we can improve the famous HahnαSchur summation theorem and the famous OrliczαPettis theorem.
A lexicographic algebraic theorem and its applications
β Scribed by Satoru Fujishige; Zaifu Yang
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 968 KB
- Volume
- 279
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
In this Paper we prove the following result: Given any full-dimensional simple polytope P = {x E R" 1 a'=.x < bi, i = 1,. . , WZ} without redundant constraints and any vector c E iw", there exists a unique vertex x* of P such that the matrix
exists and is lexicographic positive, where x* is the Solution of the n linear equations a'rrX = b. r = 1 . II T , "> n. This theorem generalizes a result on the n-dimensional cube and tan be used to resolve the degeneracy Problem for simplicial fixed Point algorithms. We also discuss several applications for this result.
π SIMILAR VOLUMES
The algebraic nonlinearity of an n-bit boolean function is defined as tbe degree of the polynomial f(X) e Z2 [xl, x2,..., x,] that represents f. We prove that the average degree of an ANF polynomial for an n-bit function is n + o(1). Further, for a balanced n-bit function, any subfunction obtained b
The main purpose of this paper is to present a lifting theorem generalizing the well-known WedderburnαMalcev theorem. We then show how this result can be applied to various questions concerning the structure of blocks and source algebras. In particular, we indicate how it can be used to give an alte