子集的交叉t－相交定理

设Ｘ为一个ｎ元集合，Ｃｎｋ为Ｘ的所有ｋ元子集全体，若Ａ∈Ａ，Ｂ∈Ｂ有｜Ａ∩Ｂ｜≥ｔ，则称（Ａ，Ｂ）为一个交叉ｔ－相交子集族．本文得到最大交叉ｔ－相交子集族和最大非空交叉２－相交子集族．证明如下两个结论．（１）若（Ａ，Ｂ）为一个交叉ｔ－相交子集族，且ａ≤ｂ及ａ＋ｂ≤ｎ＋ｔ－１，则｜Ａ＋Ｂ｜≤ｍａｘ｛（ｂｎ），（ａｎ）｝，且当（Ａ；Ｂ）＝（φ，Ｃｎｂ）或（Ｃｎａ，φ）时达到上界．（２）若（Ａ，Ｂ）为一个交叉２－相交子集族，且ａ＜ｂ，ａ＋ｂ≤ｎ－１及（ｎ，ａ，ｂ）≠（２ｉ，ｉ－１，ｉ）（ｉ为任意正整数），又Ａ，Ｂ均非空，则｜Ａ＋Ｂ｜≤１＋（ｂｎ）－（ｂ（ｎ－ａ））－ａ（（ｂ－１）（ｎ－ａ））且当（Ａ，Ｂ）＝（｛Ａ｝，Ｃｎｂ－｛Ｂ｜｜Ｂ｜＝ｂ，｜Ａ∩Ｂ｜≤１｝）时达到上界．     

秩为k的有限序列t—相交族

设ｎ，ｓ１，ｓ２，…，ｓｎ为正整数及Ｍ（ｓ１，ｓ２，…，ｓｎ）＝｛（ｘ１，ｘ２，…，ｘｎ）｜０ｘｉｓｉ，且ｘｉ为正整数｝．若ＦＭ（ｓ１，ｓ２，…，ｓｎ）满足：对任何ａ，ｂ∈Ｆ，都至少有ｔ个ｉ使ａｉ∧ｂｉ＝ｍｉｎ（ａｉ，ｂｉ）＞０，则称Ｆ为Ｍ（ｓ１，ｓ２，…，ｓｎ）中的一个ｔ－相交序列族．对ｘ＝（ｘ１，ｘ２，…，ｘｎ）∈Ｍ（ｓ１，ｓ２，…，ｓｎ），称ｒ（ｘ）＝∑ｎｉ＝１ｘｉ为ｘ的秩．本文讨论并得到当ｓ１＝ｓ２＝…＝ｓｎ时Ｍ（ｓ１，ｓ２，…，ｓｎ）中秩为ｋ的有限序列最大相交族，从而获得了由Ｅｎｇｅｌ和Ｆｒａｎｋｌ提出的一个关于有限序列相交族的公开未解问题在ｋｎ＋ｔ－１情形下的解．     

一个二维整数瓶颈问题及其算法

本文讨论了数学模型：ｍａｘ｛ｆ（ｘ）│ｆ（ｘ）＝ｍｉｎ（１≤ｊ≤ｎ）〔ｃ１ｊｘ１ｊ＋ｃ２ｊｘ２ｊ〕，ｘ∈Ｄ｝，其中Ｄ＝｛ｘ│ｘ＝｛ｘｉｊ｝，ｎΣ（ｊ＝１）ｘｉｊ＝ａ，ｉ＝１，２，ｘｉｊ≥０且为整数｝，并给出了一个拟多项式算法。     

星形函数族的一个子族的极值点与支撑点

设Ｆ（｛ｎ｝）＝｛ｆ（ｚ）：ｆ（ｚ）在｜ｚ｜＜１内解析，ｆ（ｚ）＝ｚ－∞ｎ＝１ａｎｚｎ，ａｎ≥０，＋∞ｎ＝２ｎａｎ≤１｝，则Ｆ（｛ｎ｝）是星形函数族的一个子族．许多学者研究了这个函数族．设Ｍ＝｛ｆ（ｚ）：ｆ（ｚ）在｜ｚ｜＜１内解析，ｆ（ｚ）＝ｚ－∞ｎ＝１ａｎｚｎ，ａｎ≥ａｎ＋１≥０，＋∞ｎ＝２ｎａｎ≤１｝．在本文中我们找出了函数族Ｍ的极值点与支撑点．     

STRONG LAWS FOR α-MIXING SEQUENCE PROCESSES INDEXED BY SETS

ＳＴＲＯＮＧＬＡＷＳＦＯＲα－ＭＩＸＩＮＧＳＥＱＵＥＮＣＥＰＲＯＣＥＳＳＥＳＩＮＤＥＸＥＤＢＹＳＥＴＳ￥ＸＵＢＩＮＧＡｂｓｔｒａｃｔ：ＬｅｔＪ＝｛１，２，．．．｝ｄａｎｄｌｅｔ｛Ｘｊ，ｊ∈Ｊ｝ｂｅａｎａ－ｍｉｘｉｎｇｓｅｑｕｅｎｃｅｗｈｉｃｈｉｓｎｏ...     

代数综合测试题

一、选择题１．设集合Ｍ＝｛ｘ｜２２－ｘ≥１｝,集合Ｎ＝｛ｘ｜ｘ２－２ｘ－３＜０｝,集合Ｍ∩Ｎ＝（）（Ａ）｛ｘ｜０≤ｘ＜１｝（Ｂ）｛ｘ｜０≤ｘ＜２｝（Ｃ）｛ｘ｜０≤ｘ≤１｝（Ｄ）｛ｘ｜０≤ｘ≤２｝２．已知函数ｆ（ｘ）＝２ｘ,则函数ｙ＝｜ｆ－１（ｘ－１...     

有限域上一类方程的解数公式

本文给出有限域Ｆｑ上一类方程ａ１ｘ１ｄ１１…ｘｎｄ１ｎ＋ａ２ｘ１ｄ２１…ｘｎｄ２ｎ＋…＋ａｓｘ１ｄｓ１…ｘｎｄｓｎ＝ｂ的解数公式，这里ｄｉｊ＞０，ａｉ∈Ｆｑ，ｉ＝１，…，ｓ，ｊ＝１，…，ｎ．特别当ｓ＝ｎ，ｇｃｄ（｜ｄｉｊ｜，ｑ－１）＝１时，得到了简明的解数公式．     

关于不可约复矩阵的可逆性

本文推广了不可约复矩阵可逆性的一个经典结果──Ｂｅｔｔｅｒ推论，证明了如下定理：一个ｎ×ｎ不可约复矩阵Ａ是可逆的，如果它满足下列条件之一：某α∈［０，１］，且对至少一个。成立严格不等式，其中Ｎ＝｛１，２，…，ｎ｝，Ｒｉ∑ｊ∈Ｎ－（ｉ）｜αｉｊ｜，Ｃｉ＝∑ｊ∈（ｉ）｜αｊｉ｜，（ｉｉ）｜αｉｉαｊｊ｜≥ＲｉＲｊ，且对至少一对（ｉ，ｊ）成立严格不等式，同时Ａ有两行其非零非对角元的个数不小于２。     

1996年普通高等学校招生全国统一考试试题

１９９６年普通高等学校招生全国统一考试试题数学（理工农医类）１选择题（第１－１０题每小题４分，第１１－１５题每小题５分，共６５分）（１）已知全集Ｉ＝Ｎ，集合Ａ＝｛ｘ｜ｘ＝２ｎ，ｎ∈Ｎ｝，Ｂ＝｛ｘ｜ｘ＝４ｎ，ｎ∈Ｎ｝．则（２）当ａ＞１时，在同一坐标系中...     

半正定自共轭四元数矩阵广义逆的单调性问题

对于四元数矩阵的Ｌｏｗｎｅｒ偏序，设０≤Ｂ≤Ａ．本文利用（ｎ，≥）中矩阵的同时合同化简，给出了Ｂ｛１；≥；ｓ；≥Ａ（１）｝的表式，以及下面三个单调性结论的特征刻划：ｉ）Ｂ（１）∈Ｂ｛１；＊｝，Ａ｛１；＊；≤Ｂ（１）｝≠；０；ｉｉ）０≤Ｂ（１，２）≤Ｂ（１，２）≤Ａ（１，２）；ｉｉｉ）Ａ（１，２）∈Ａ｛１，２；≥｝，Ｂ｛１，２；≥；≤Ａ（１，２）｝只含一个元素．     

Greedy expansions in Banach spaces

We study convergence and rate of convergence of expansions of elements in a Banach space X into series with regard to a given dictionary . For convenience we assume that is symmetric: implies . The primary goal of this paper is to study representations of an element f∈X by a series

On some characterizations of greedy-type bases

In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. Since then, there have been many interesting and useful characterizations of greedy-type bases in Banach spaces. In this article, we study and extend several characterizations of greedy and almost greedy bases in the literature. Along the way, we give various examples to complement our main results. Furthermore, we propose a new version of the so-called Weak Thresholding Greedy Algorithm (WTGA) and show that the convergence of this new algorithm is equivalent to the convergence of the WTGA.     

A setup heuristic for interval orders

The setup minimization problem for linear extensions of interval orders is considered and a simple greedy heuristic is shown to be never worse than twice the optimum.     

Approximate Weak Greedy Algorithms

We present a generalization of Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries. For a class of dictionaries with more structure, we give a more relaxed necessary and sufficient condition for convergence of the algorithm. We also provide a detailed discussion of how a real-world implementation of the weak greedy algorithm, where one has to take into account floating point arithmetic and other types of finite precision errors, can be modeled by the new algorithm.     

The tridiagonal transportation problem

The Tridiagonal Transportation Problem deals with shipments of goods from n origins to n destination aalong 3n - 2 routes that correspond to the diagonal and off diagonal cells. This paper presents an equivalent Linear Programming Problem with only 2n - 1 decision variables. A greedy algorithm is developed by making simple changes to the right hand side of the L.P. Several extensions are also discussed.     

A note on random greedy coloring of uniform hypergraphs

The smallest number of edges forming an n‐uniform hypergraph which is not r‐colorable is denoted by m(n,r). Erd?s and Lovász conjectured that . The best known lower bound was obtained by Radhakrishnan and Srinivasan in 2000. We present a simple proof of their result. The proof is based on the analysis of a random greedy coloring algorithm investigated by Pluhár in 2009. The proof method extends to the case of r‐coloring, and we show that for any fixed r we have improving the bound of Kostochka from 2004. We also derive analogous bounds on minimum edge degree of an n‐uniform hypergraph that is not r‐colorable. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 407–413, 2015     

The potential of greed for independence

The well‐known lower bound on the independence number of a graph due to Caro (Technical Report, Tel‐Aviv University, 1979) and Wei (Technical Memorandum, TM 81 ‐ 11217 ‐ 9, Bell Laboratories, 1981) can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so‐called potential functions p_G: V(G)→?₀ defined on the vertex set of a graph G for which suitably modified versions of the greedy algorithms applied to G yield independent sets I with . We provide examples of such potentials, which lead to bounds improving the bound due to Caro and Wei. Furthermore, suitably adapting the randomized algorithm we give a short proof of Thiele's lower bound on the independence number of a hypergraph (T. Thiele, J Graph Theory 30 (1999), 213–221).     

A probabilistic analysis of some greedy cardinality matching algorithms

This paper deals with the expected cardinality of greedy matchings in random graphs. Different versions of the greedy heuristic for the cardinality matching problem are considered. Experimental data and some theoretical results are reported.     

Generalized Approximate Weak Greedy Algorithms

We study generalized approximate weak greedy algorithms. The main difference of these algorithms from approximate weak greedy algorithms proposed by R. Gribonval and M. Nielsen consists in that errors in the calculation of the coefficients can be prescribed in terms of not only their relative values, but also their absolute values. We present conditions on the parameters of generalized approximate weak greedy algorithms which are sufficient for the expansions resulting from the use of this algorithm to converge to the expanded element. It is shown that these conditions cannot be essentially weakened. We also study some questions of the convergence of generalized approximate weak greedy expansions with respect to orthonormal systems.__________Translated from Matematicheskie Zametki, vol. 78, no. 2, 2005, pp. 186–201.Original Russian Text Copyright © 2005 by V. V. Galatenko, E. D. Livshits.