Báo cáo toán học: "The well-rounded linear function" doc

Ngày tải lên: 08/08/2014, 14:23

... is  v∈V f(v). The fractional clique number ω ∗ (G)isthemaximum weight of any fractional clique. Linear programming duality implies that ω ∗ (G)=χ ∗ (G). For positive integer t,letH(t)=  t i=1 1 i .

Ngày tải lên: 07/08/2014, 13:21

... combined with a linear function, to produce functions like ax + b. This motivates us to ask a very basic question: How many distinct rounded linear functions can arise from a given linear function? ... constant function f 0,b (x)=b as a (degenerate) linear function. In the next section we shall define rounded generic linear functions and rounded linear functions, and specify wh...

Ngày tải lên: 07/08/2014, 06:23

Ngày tải lên: 05/08/2014, 10:20

... of linear DAEs of index 1. In Sec. 3 we investigate exponential asymptotic stability of linear DAEs with respect to small linear as well as nonlinear perturbation. 2. The Central Exponent of Linear ... i.e. V is a linear space spanned by solutions of (2.1), V (t) is the section of V at time t. Notice that like a linear ODE, the solutions of the DAE (2.1) form a finite-dimensional...

Ngày tải lên: 06/08/2014, 05:20

... Nonnegative matrices: The open Leon tief model, Linear Algebra Appl. 26 (1979) 175–201. 3. J. P. Milaszewicez and L. P. Moledo, On nonsingular M-matrices, Linear Algebra Appl. 195 (1993) 1–8. 4. W. ... Solution for Consistent Linear Systems * Wen Li Department of Mathematics, South China Normal University Guangzhou 510631, P. R. China Received February 27, 2004 Abstract. For a consisten...

Ngày tải lên: 06/08/2014, 05:20

... Selmer, On the linear diophantine problem of Frobenius, J. reine angew. Math. 293/294 (1977), 1–17. [S ¨ O] S. Sert ¨ oz, A. ¨ Ozl ¨ uk, On the number of representations of an integer by a linear form, ˙ Istanbul ¨ Univ. ... Jackson, Combinatorial Enumeration, Wiley, New York, 1983. [I] M. I. Israilov, Numbers of solutions of linear Diophantine equations and their appli- cations in the...

Ngày tải lên: 07/08/2014, 06:22

... F  . The linear complexity L(f 1 , ,f m )oftheset{f 1 , ,f m } of linear forms is the min- imum r ∈ N such that there is a linear computation sequence of length r that computes {f 1 , ,f m }.Thelinear ... bounds on the linear complexity of a graph. In Section 4, we consider the linear complexity of several well-known classes of graphs. Finally, in Section 5, we give an upper bound...

Ngày tải lên: 07/08/2014, 13:21

... journal of combinatorics 13 (2006), #R53 15 [17] , Advanced determinant calculus: A complement, Linear Algebra Appl. 411 (2005), 68-166. [18] G. Kuperberg, Another proof of the alternating-sign ... relations [1, p. 558], but once we have found them, we can verify (38)–(40) by by taking appropriate linear combinations of (30) and (32). Formulas (41) and (42) can be proved by applying the f...

Ngày tải lên: 07/08/2014, 13:21

... for Undergraduates program, 2001. [17] Hirobumi Mizuno and Iwao Sato. Zeta functions of digraphs. Linear Algebra Appl., 336:181–190, 2001. [18] Hirobumi Mizuno and Iwao Sato. Zeta functions of oriented

Ngày tải lên: 07/08/2014, 13:21