Sum rules

The main contents of the chapter consist of the following: Remaining part of maximum contiguous subsequence sum problem, general big-oh rule, running time of algorithm.

34p nanhankhuoctai10 23-07-2020 10 1   Download

We discuss the proof of and systematic application of Case’s sum rules for Jacobi matrices. Of special interest is a linear combination of two of his sum rules which has strictly positive terms. Among our results are a complete classification of the spectral measures of all Jacobi matrices J for which J − J0 is Hilbert-Schmidt, and a proof of Nevai’s conjecture that the Szeg˝ condition o holds if J − J0 is trace class.

70p tuanloccuoi 04-01-2013 55 6   Download

Tuyển tập các báo cáo nghiên cứu khoa học trên tạp chí toán học quốc tế đề tài: Around the Razumov–Stroganov conjecture: proof of a multi-parameter sum rule...

27p thulanh5 13-09-2011 46 4   Download

Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together. A single graph can have many different spanning trees. We can also assign a weight to each edge, which is a number representing how unfavorable it is, and use this to assign a weight to a spanning tree by computing the sum of the weights of the edges in that spanning tree.

97p locnp0209 11-06-2011 154 10   Download