DOCSLIB.ORG

Subject Index Volumes 1–200

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Subject Index Volumes 1–200 View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Mathematics 227/228 (2001) 5–302 Subject Index Volumes 1–200 (0, 1) linear programming matrix, 3438 0-1 stationary time series, see (0, 1)-stationary time (0, 1) matrix, see (0, 1)-matrix series (0, 1)-distributive lattice, 5732 (0-1) matrix, see (0, 1)-matrix (0, 1)-generalized Boolean function, 1768 (0-1)-inequality, 2130, see (0, 1)-inequality (0, 1)-geometric graph, 1339 (0-1)-polyhedron, 1096, see (0, 1)-polyhedron (0, 1)-graph, 825 0-1-matrix, see (0, 1)-matrix (0, 1)-law, 1833 0-1-polyhedron, see (0, 1)-polyhedron (0, 1)-matrix, 167, 311, 542, 548, 655, 657, 712, 0-1-sequence, see (0, 1)-sequence 760, 877, 894, 1001, 1107, 1301, 1358, 1404, 0-chord extendable, 4318 1432, 1655, 1735, 2277, 2443, 2475, 2748, 0-covered, 397, see also zero-covered 3339, 3350, 3538, 3558, 4255, 4310, 4421, 0-dimensional, see also zero-dimensional 4452, 5141, 5375, 5648, 5872, 5893, see also 0-dual closure, 3604 zero-one matrix 0-extendable, 4762, see also zero-extendable with zero permanent, 167 0-homogeneity, 1917, see also zero-homogeneity (0, 1)-optimization, 2130 0-homogeneous graph, 1917, see also (0, 1)-sequence, 381, 605, 943, 1161, 4177, 4178, zero-homogeneous graph 5626 0-induced, 3392, see also zero-induced (0, 1)-solution of linear inequalities, 4709 0-preserving, see also zero-preserving (0, 1)-stationary time series, 605 join homomorphism, 1794 (0, 1, −1) skew symmetric matrix, see (0, 1, −1)- 0-skeleton, see also zero-skeleton skew symmetric matrix of a Platonic solid, 1672 (0, 1, −1)-skew symmetric matrix, 3271 1element, see also one element 0, 1-matrix, see (0, 1)-matrix 1player, see also one player 0, 1-sublattice, 1479 game, 4847 (0, 2)-geometry, 1738 1 story building, 3485 (0, 2)-graph, 4912, 5261, 5436 1 way infinite arc, 418 0, 2-graph, see (0, 2)-graph path, 3376 (0, λ)-graph, 930, 2933 (1, 0) graph, see (0, 1)-graph (0, 1)-matrix, 5233 (1, 1)-factor in a digraph, 1929 0,1 sequence, see (0, 1)-sequence (1, 2)-factorization, 2691, 2716 0/1 polytope, see (0, 1)-polytope of cardinality k, 2691 0/1 solutions of linear inequalities, of K2n, 2691 see (0, 1)-solution of linear inequalities (1, 2)-realizability, 4786 0/1-matrix, see (0, 1)-matrix (1, 2)-realizable, 4786 0-1 inequality, see (0, 1)-inequality graph, 4786, 4786 0-1 law, see (0, 1)-law (1, 2; 3, n, 1)-frame, 3807 0-1 optimisation, see (0, 1)-optimization (1, 2; 3, n, 3)-frame, 2911 0-1 sequence, see (0, 1)-sequence (1, j, n)-sequencing, see (1, n, k)-sequencing Elsevier Science B.V. 6 Subject Index Volumes 1–200 / Discrete Mathematics 227/228 (2001) 5–302 (1, n, k)-sequencing of the alternating group, 2211 1-factorization, 599, 1125, 1155, 1268, 1529, 1882, (1, −1)-matrix, 902, 1534 2691, 3026, 4782, 4991, 5286, see also one- 1/2-transitive, 5622 factorization graph, 5622 of a tree, 1125 1:2 rectangle, 4624 1-factorizing regular graph, 2515 1-arc, see also one-arc 1-flat, 2575, 3092, see also one-flat 1-block, see also one-block 1-fold, see also one-fold 1-blocking, see also one-blocking covering, 3949 1-blocking set, 3092 1-genus, see also one-genus 1-cell, 3823, see also one-cell of a graph, 5525 1-chord, see also one-chord 1-geodetic, 5384, see also one-geodetic extendable, 4318 1-graph, 5333, see also one-graph 1-chromatic, see also one-chromatic 1-Hamiltonian, 1133, see also one-Hamiltonian 1-chromatic number, 5054, 5173 graph, 1133 of a surface, 5054 1-handle, 5006, see also one-handle 1-connected, 5377, see also one-connected 1-heavy, 5294, see also one-heavy 1-covered, 397 1-homogeneity, 1917, see also one-homogeneity 1-cut, see also one-cut 1-homogeneous, see also one-homogeneous edge, 3713 1-homogeneous graph, 1917 1-design, 1214, 1410, 4053, 4135, see also of diameter 2, 1917 one-design 1-induced, 3392, see also one-induced 1-difactor, 715, see also one-difactor 1-intersecting, see also one-intersecting family, 1784 1-dimensional, see also one-dimensional 1-maximal, 4560, see also one-maximal acyclic complexe, 1850 nearly perfect set, 4560 1-dipole, see also one-dipole 1-minimal, 4560, see also one-minimal move, 5430 nearly perfect set, 4560 1-embeddable, 3820, see also one-embeddable 1-minimality, 2855 1-ended, see also one-ended 1-node, see also one-node graph, 4410 1-packing, 486, see also one-packing 1-error, see also one-error 1-path, 1249, see also one-path 1-error correcting, 1894 1-perfect, see also one-perfect code, 2985 code, 4191 uniformly packed code, 2985 1-permutation, 2150, see also one-permutation 1-error-correcting, see 1-error correcting 1-pseudotree, 4322, see also one-pseudotree 1-excluded, see also one-excluded 1-reducible, 3599, see also one-reducible 1-excluded 1-regular, see also one-regular 18-colouring, 5379 edge colouring, 4067 property, 5379 1-resolvable, 486, see also one-resolvable 1-extendable, 4060, see also one-extendable 1-rotational, 1522, 1925, 2583, see also graph, 3972 one-rotational 1-extension, 4129, see also one-extension (15, 5, 4)-BIBD, 2583 1-factor, 46, 85, 449, 582, 597, 599, 796, 851, 894, (15, 5, 4)-design, 2583 1059, 1125, 1281, 1371, 1445, 2107, 2339, (15, 5, 6)-design, 2583 2515, 2577, 2913, 3025, 3026, 3238, 3240, BIB design, 3719 3246, 3256, 3798, 4060, 4146, 4201, 4531, design, 1522, 1925 4649, 4885, 5326, 5775, 5918, 5934, 5935, Steiner triple system, 1098 see also one-factor structure, 1925 of a graph, 46, 851, 3337 1-shift graph, 2307 1-factorable, 1529, 1548, 3246, see also 1-skeleton, 163, 1536, 1672, 1937, 4203, see also one-factorable one-skeleton 1-factorisable, see 1-factorizable 1-skeleton of 1-factorisation, see 1-factorization a cell decomposition, 1063 1-factorising, see 1-factorizing the unit cube, 901 1-factorizable, 2479, see also one-factorizable 1-spread, 486, 3052, see also one-spread Subject Index Volumes 1–200 / Discrete Mathematics 227/228 (2001) 5–302 7 1-structure, see also one-structure 2-(22, 8, 4)-design, 2581 1-sum, 5600, see also one-sum 2-(28, 4, 1) design, 2572 1-tough, 146, 1015, 2631, 2970, 3851, 4713, 5077, 2-(46, 6, 3) design, 2879 see also one-tough 2-(729, 8, 1) design, 3708 cocomparability graph, 5077 2-(8, 4, 3) design, 2590 graph, 2639, 3831, 3851, 3903, 4419, 5294 2-(91, 6, 1) design, 3177 maximal planar graph, 2970, 4713 2-(γ ,2)-critical graph, 4941 1-tough non-Hamiltonian 2-(t, 3, 2)-design, 2009 graph, 3838 2-(t, n, 1)-design, 2278, 3708 maximal planar graph, 1015 2-(t, n, λ)-design, 4135 1-traceable, see also one-traceable 2-amalgam, 1867, see also two-amalgam 1-traceable subgraph, 1265 of perfect graphs, 1867 1-transitivity, 3530, see also one-transitivity 2-arc, see also two-arc 1-transrotational Steiner triple system, 4106 2-arc coloured digraph, 5810 1-TU, 2560 2-asummable, see also two-asummable 1-vertex, see also one-vertex Boolean function, 649, 878 neighbourhood in a graph, 3828 2-bad, see also two-bad 1-weak, see also one-weak configuration, 5205 order, 5493 2-ball, 5782, see also two-ball 1-width, 655, see also one-width hypergraph, 5782 of a (0,1)-matrix, 655 2-biray, 5751, see also two-biray 2 cut edge, see 2-cut edge 2-block, see also two-block 2 disjoint 11-cycles, see 2-disjoint 11-cycles random graph, 3135 2element,see also two element 2-cactus, 3922, see also two-cactus 2 fixed point property, 3602 2-cell, 2602, 3823, see also two-cell 2 line standard tableau, 2719 complex, 2244 2 person game, 3105 embedded, 3527 2 row shape, 4489 2-cell embedding, 180, 4117, 4219, 4396 2 state covering machine, 3419 of a graph, 4219 2 step multidimensional circulant, 4720 2-cell imbedding, 4391 2 way infinite path, 3127, 3130 2-chain, see also two-chain (2, 1) graph, see (2, 1)-graph graph, 2504 (2, 1)-graph, 825 2-chord, see also two-chord (2, 11) combinatorial groupoid, extendable, 4318 see (2, 11)-combinatorial groupoid 2-chromatic, see also two-chromatic (2, 11)-combinatorial groupoid, 635 SQS(22), 3183 (2, 2)-split colouring, 6000 2-clique, 3744, see also two-clique (2, 3)-metric, 5786 2-cocircuit, 1715, see also two-cocircuit 2D de Bruijn-Good graph, 2828 2-code, see also two-code (2k C 1)-gonal inequality, see .2n C 1/-gonal 2-colorable, see 2-colourable inequality block design, see 2-colourable block design 2K2-free 2-colored, see 2-coloured graph, 5196 2-coloring, see 2-colouring graphs, 2699 2-colourable, 2736, 2907, 2952, 5228, 5319, 5898 2Kn, 3176 block design, 2952, see also two-colourable 2k-cycle-free-graph, see 2n-cycle free graph 2-coloured, 2276, 3309, 4127, 4778, 5954, see also .2n C 1/-cycle system, 3741 two-coloured .2n C 1/-gonal inequality, 4129 F-partition, 4778 2n-cycle free graph, 5957 generalized Frobenius partition, 4127 2n-edge-connected graph, 4136 ring, 3313 2n-regular, 4136 2-colouring, 940, 1696, 2124, 2724, 2736, 2907, 2r-edge-connected graph, see 2n-edge-connected 3586, 3673, 3759, 3931, 4508, 4719, 4892, graph 5919, see also two-colouring 2r-regular, see 2n-regular 2-colouring of 2-(16, 8, 7)-design, 3463 the edges, 5765, 5901 8 Subject Index Volumes 1–200 / Discrete Mathematics 227/228 (2001) 5–302 2-colouring of the natural numbers, 3638 2-dimensional, see also two-dimensional 2-complex, 5751, see also two-complex cell complex, 2027 2-configuration, 3946, see also two-configuration generic rigidity, 3485 2-connected, 528, 825, 1475, 1752, 1947, 2437, grid, 3083 2631, 3133, 3857, 4057, 4277, 4396, 4943, poset, 4013 5009, 5262, 5334, 5335, 5377, 5611, 5930, skeleton, 21 5976, see also two-connected 2-dipole, see also two-dipole (2, 3)-factor, 5774 2-dipole move, 5430 (n, n+2)-graph, 5334,
Load more

Recommended publications
  • Graphs with Few Eigenvalues
    Graphs with few eigenvalues An interplay between combinatorics and algebra Graphs with few eigenvalues An interplay between combinatorics and algebra Proefschrift ter verkrijging van de graad van doctor aan de Katholieke Universiteit Brabant, op gezag van de rector magnificus, prof. dr. L.F.W. de Klerk, in het openbaar te verdedigen ten overstaan van een door het college van dekanen aangewezen commissie in de aula van de Universiteit op vrijdag 4 oktober 1996 om 14.15 uur door Edwin Robert van Dam geboren op 27 augustus 1968 te Valkenswaard Promotor: Prof. dr. S.H. Tijs Copromotor: Dr. ir. W.H. Haemers Ter nagedachtenis van Opa Vogel Acknowledgements During the past four years I have had the pleasure to work on this thesis under the supervision of Willem Haemers. His support and guidance have always been stimulating, and I have found Willem always available. So thanks Willem, I had a great time. I also wish to thank Stef Tijs, for being my promoter, and the other members of the thesis committee: Andries Brouwer, Giel Paardekooper, Lex Schrijver and Ted Spence. Special thanks go to Ted Spence for the enjoyable cooperation in the past years, and for always providing me with interesting combinatorial data. Furthermore I would like to thank Jaap Seidel for inspiring me, D.G. Higman for his inspiring manuscript on rank four association schemes, and all other people who showed interest in my work. During the past years I attended several graduate courses with great pleasure, and I thank the organizers and lecturers of LNMB and EIDMA for those.
    [Show full text]
  • Perron–Frobenius Theory of Nonnegative Matrices
    Buy from AMAZON.com http://www.amazon.com/exec/obidos/ASIN/0898714540 CHAPTER 8 Perron–Frobenius Theory of Nonnegative Matrices 8.1 INTRODUCTION m×n A ∈ is said to be a nonnegative matrix whenever each aij ≥ 0, and this is denoted by writing A ≥ 0. In general, A ≥ B means that each aij ≥ bij. Similarly, A is a positive matrix when each aij > 0, and this is denoted by writing A > 0. More generally, A > B means that each aij >bij. Applications abound with nonnegative and positive matrices. In fact, many of the applications considered in this text involve nonnegative matrices. For example, the connectivity matrix C in Example 3.5.2 (p. 100) is nonnegative. The discrete Laplacian L from Example 7.6.2 (p. 563) leads to a nonnegative matrix because (4I − L) ≥ 0. The matrix eAt that defines the solution of the system of differential equations in the mixing problem of Example 7.9.7 (p. 610) is nonnegative for all t ≥ 0. And the system of difference equations p(k)=Ap(k − 1) resulting from the shell game of Example 7.10.8 (p. 635) has Please report violations to [email protected] a nonnegativeCOPYRIGHTED coefficient matrix A. Since nonnegative matrices are pervasive, it’s natural to investigate their properties, and that’s the purpose of this chapter. A primary issue concerns It is illegal to print, duplicate, or distribute this material the extent to which the properties A > 0 or A ≥ 0 translate to spectral properties—e.g., to what extent does A have positive (or nonnegative) eigen- values and eigenvectors? The topic is called the “Perron–Frobenius theory” because it evolved from the contributions of the German mathematicians Oskar (or Oscar) Perron 89 and 89 Oskar Perron (1880–1975) originally set out to fulfill his father’s wishes to be in the family busi- Buy online from SIAM Copyright c 2000 SIAM http://www.ec-securehost.com/SIAM/ot71.html Buy from AMAZON.com 662 Chapter 8 Perron–Frobenius Theory of Nonnegative Matrices http://www.amazon.com/exec/obidos/ASIN/0898714540 Ferdinand Georg Frobenius.
    [Show full text]
  • 4.6 Matrices Dimensions: Number of Rows and Columns a Is a 2 X 3 Matrix
    Matrices are rectangular arrangements of data that are used to represent information in tabular form. 1 0 4 A = 3 - 6 8 a23 4.6 Matrices Dimensions: number of rows and columns A is a 2 x 3 matrix Elements of a matrix A are denoted by aij. a23 = 8 1 2 Data about many kinds of problems can often be represented by Matrix of coefficients matrix. Solutions to many problems can be obtained by solving e.g Average temperatures in 3 different cities for each month: systems of linear equations. For example, the constraints of a problem are represented by the system of linear equations 23 26 38 47 58 71 78 77 69 55 39 33 x + y = 70 A = 14 21 33 38 44 57 61 59 49 38 25 21 3 cities 24x + 14y = 1180 35 46 54 67 78 86 91 94 89 75 62 51 12 months Jan - Dec 1 1 rd The matrix A = Average temp. in the 3 24 14 city in July, a37, is 91. is the matrix of coefficient for this system of linear equations. 3 4 In a matrix, the arrangement of the entries is significant. Square Matrix is a matrix in which the number of Therefore, for two matrices to be equal they must have rows equals the number of columns. the same dimensions and the same entries in each location. •Main Diagonal: in a n x n square matrix, the elements a , a , a , …, a form the main Example: Let 11 22 33 nn diagonal of the matrix.
    [Show full text]
  • Recent Developments in Boolean Matrix Factorization
    Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI-20) Survey Track Recent Developments in Boolean Matrix Factorization Pauli Miettinen1∗ and Stefan Neumann2y 1University of Eastern Finland, Kuopio, Finland 2University of Vienna, Vienna, Austria pauli.miettinen@uef.fi, [email protected] Abstract analysts, and van den Broeck and Darwiche [2013] to lifted inference community, to name but a few examples. Even more The goal of Boolean Matrix Factorization (BMF) is recently, Ravanbakhsh et al. [2016] studied the problem in to approximate a given binary matrix as the product the framework of machine learning, increasing the interest of of two low-rank binary factor matrices, where the that community, and Chandran et al. [2016]; Ban et al. [2019]; product of the factor matrices is computed under Fomin et al. [2019] (re-)launched the interest in the problem the Boolean algebra. While the problem is computa- in the theory community. tionally hard, it is also attractive because the binary The various fields in which BMF is used are connected by nature of the factor matrices makes them highly in- the desire to “keep the data binary”. This can be because terpretable. In the last decade, BMF has received a the factorization is used as a pre-processing step, and the considerable amount of attention in the data mining subsequent methods require binary input, or because binary and formal concept analysis communities and, more matrices are more interpretable in the application domain. In recently, the machine learning and the theory com- the latter case, Boolean algebra is often preferred over the field munities also started studying BMF.
    [Show full text]
  • On Computing Longest Paths in Small Graph Classes
    On Computing Longest Paths in Small Graph Classes Ryuhei Uehara∗ Yushi Uno† July 28, 2005 Abstract The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, few graph classes are known to be solved efficiently for the longest path problem. For a tree, a simple linear time algorithm for the longest path problem is known. We first generalize the algorithm, and show that the longest path problem can be solved efficiently for weighted trees, block graphs, and cacti. We next show that the longest path problem can be solved efficiently on some graph classes that have natural interval representations. Keywords: efficient algorithms, graph classes, longest path problem. 1 Introduction The Hamiltonian path problem is one of the most well known NP-hard problem, and there are numerous applications of the problems [17]. For such an intractable problem, there are two major approaches; approximation algorithms [20, 2, 35] and algorithms with parameterized complexity analyses [15]. In both approaches, we have to change the decision problem to the optimization problem. Therefore the longest path problem is one of the basic problems from the viewpoint of combinatorial optimization. From the practical point of view, it is also very natural approach to try to find a longest path in a given graph, even if it does not have a Hamiltonian path. However, finding a longest path seems to be more difficult than determining whether the given graph has a Hamiltonian path or not.
    [Show full text]
  • Blast Domination for Mycielski's Graph of Graphs
    International Journal of Engineering and Advanced Technology (IJEAT) ISSN: 2249 – 8958, Volume-8, Issue-6S3, September 2019 Blast Domination for Mycielski’s Graph of Graphs K. Ameenal Bibi, P.Rajakumari AbstractThe hub of this article is a search on the behavior of is the minimum cardinality of a distance-2 dominating set in the Blast domination and Blast distance-2 domination for 퐺. Mycielski’s graph of some particular graphs and zero divisor graphs. Definition 2.3[7] A non-empty subset 퐷 of 푉 of a connected graph 퐺 is Key Words:Blast domination number, Blast distance-2 called a Blast dominating set, if 퐷 is aconnected dominating domination number, Mycielski’sgraph. set and the induced sub graph < 푉 − 퐷 >is triple connected. The minimum cardinality taken over all such Blast I. INTRODUCTION dominating sets is called the Blast domination number of The concept of triple connected graphs was introduced by 퐺and is denoted by tc . Paulraj Joseph et.al [9]. A graph is said to be triple c (G) connected if any three vertices lie on a path in G. In [6] the Definition2.4 authors introduced triple connected domination number of a graph. A subset D of V of a nontrivial graph G is said to A non-empty subset 퐷 of vertices in a graph 퐺 is a blast betriple connected dominating set, if D is a dominating set distance-2 dominating set if every vertex in 푉 − 퐷 is within and <D> is triple connected. The minimum cardinality taken distance-2 of atleast one vertex in 퐷.
    [Show full text]
  • A List of Arithmetical Structures Complete with Respect to the First
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Theoretical Computer Science 257 (2001) 115–151 www.elsevier.com/locate/tcs A list of arithmetical structures complete with respect to the ÿrst-order deÿnability Ivan Korec∗;X Slovak Academy of Sciences, Mathematical Institute, Stefanikovaà 49, 814 73 Bratislava, Slovak Republic Abstract A structure with base set N is complete with respect to the ÿrst-order deÿnability in the class of arithmetical structures if and only if the operations +; × are deÿnable in it. A list of such structures is presented. Although structures with Pascal’s triangles modulo n are preferred a little, an e,ort was made to collect as many simply formulated results as possible. c 2001 Elsevier Science B.V. All rights reserved. MSC: primary 03B10; 03C07; secondary 11B65; 11U07 Keywords: Elementary deÿnability; Pascal’s triangle modulo n; Arithmetical structures; Undecid- able theories 1. Introduction A list of (arithmetical) structures complete with respect of the ÿrst-order deÿnability power (shortly: def-complete structures) will be presented. (The term “def-strongest” was used in the previous versions.) Most of them have the base set N but also structures with some other universes are considered. (Formal deÿnitions are given below.) The class of arithmetical structures can be quasi-ordered by ÿrst-order deÿnability power. After the usual factorization we obtain a partially ordered set, and def-complete struc- tures will form its greatest element. Of course, there are stronger structures (with respect to the ÿrst-order deÿnability) outside of the class of arithmetical structures.
    [Show full text]
  • Vertex Deletion Problems on Chordal Graphs∗†
    Vertex Deletion Problems on Chordal Graphs∗† Yixin Cao1, Yuping Ke2, Yota Otachi3, and Jie You4 1 Department of Computing, Hong Kong Polytechnic University, Hong Kong, China [email protected] 2 Department of Computing, Hong Kong Polytechnic University, Hong Kong, China [email protected] 3 Faculty of Advanced Science and Technology, Kumamoto University, Kumamoto, Japan [email protected] 4 School of Information Science and Engineering, Central South University and Department of Computing, Hong Kong Polytechnic University, Hong Kong, China [email protected] Abstract Containing many classic optimization problems, the family of vertex deletion problems has an important position in algorithm and complexity study. The celebrated result of Lewis and Yan- nakakis gives a complete dichotomy of their complexity. It however has nothing to say about the case when the input graph is also special. This paper initiates a systematic study of vertex deletion problems from one subclass of chordal graphs to another. We give polynomial-time algorithms or proofs of NP-completeness for most of the problems. In particular, we show that the vertex deletion problem from chordal graphs to interval graphs is NP-complete. 1998 ACM Subject Classification F.2.2 Analysis of Algorithms and Problem Complexity, G.2.2 Graph Theory Keywords and phrases vertex deletion problem, maximum subgraph, chordal graph, (unit) in- terval graph, split graph, hereditary property, NP-complete, polynomial-time algorithm Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2017.22 1 Introduction Generally speaking, a vertex deletion problem asks to transform an input graph to a graph in a certain class by deleting a minimum number of vertices.
    [Show full text]
  • Fast Singular Value Thresholding Without Singular Value Decomposition∗
    METHODS AND APPLICATIONS OF ANALYSIS. c 2013 International Press Vol. 20, No. 4, pp. 335–352, December 2013 002 FAST SINGULAR VALUE THRESHOLDING WITHOUT SINGULAR VALUE DECOMPOSITION∗ JIAN-FENG CAI† AND STANLEY OSHER‡ Abstract. Singular value thresholding (SVT) is a basic subroutine in many popular numerical schemes for solving nuclear norm minimization that arises from low-rank matrix recovery prob- lems such as matrix completion. The conventional approach for SVT is first to find the singular value decomposition (SVD) and then to shrink the singular values. However, such an approach is time-consuming under some circumstances, especially when the rank of the resulting matrix is not significantly low compared to its dimension. In this paper, we propose a fast algorithm for directly computing SVT for general dense matrices without using SVDs. Our algorithm is based on matrix Newton iteration for matrix functions, and the convergence is theoretically guaranteed. Numerical experiments show that our proposed algorithm is more efficient than the SVD-based approaches for general dense matrices. Key words. Low rank matrix, nuclear norm minimization, matrix Newton iteration. AMS subject classifications. 65F30, 65K99. 1. Introduction. Singular value thresholding (SVT) introduced in [7] is a key subroutine in many popular numerical schemes (e.g. [7, 12, 13, 52, 54, 66]) for solving nuclear norm minimization that arises from low-rank matrix recovery problems such as matrix completion [13–15,60]. Let Y Rm×n be a given matrix, and Y = UΣV T be its singular value decomposition (SVD),∈ where U and V are orthonormal matrices and Σ = diag(σ1, σ2,...,σs) is the diagonal matrix with diagonals being the singular values of Y .
    [Show full text]
  • Determination and Testing the Domination Numbers of Tadpole Graph, Book Graph and Stacked Book Graph Using MATLAB Ayhan A
    College of Basic Education Researchers Journal Vol. 10, No. 1 Determination and Testing the Domination Numbers of Tadpole Graph, Book Graph and Stacked Book Graph Using MATLAB Ayhan A. khalil Omar A.Khalil Technical College of Mosul -Foundation of Technical Education Received: 11/4/2010 ; Accepted: 24/6/2010 Abstract: A set is said to be dominating set of G if for every there exists a vertex such that . The minimum cardinality of vertices among dominating set of G is called the domination number of G denoted by . We investigate the domination number of Tadpole graph, Book graph and Stacked Book graph. Also we test our theoretical results in computer by introducing a matlab procedure to find the domination number , dominating set S and draw this graph that illustrates the vertices of domination this graphs. It is proved that: . Keywords: Dominating set, Domination number, Tadpole graph, Book graph, stacked graph. إﯾﺟﺎد واﺧﺗﺑﺎر اﻟﻌدد اﻟﻣﮭﯾﻣن(اﻟﻣﺳﯾطر)Domination number ﻟﻠﺑﯾﺎﻧﺎت ﺗﺎدﺑول (Tadpole graph)، ﺑﯾﺎن ﺑوك (Book graph) وﺑﯾﺎن ﺳﺗﺎﻛﯾت ﺑوك (Stacked Book graph) ﺑﺎﺳﺗﻌﻣﺎل اﻟﻣﺎﺗﻼب أﯾﮭﺎن اﺣﻣد ﺧﻠﯾل ﻋﻣر اﺣﻣد ﺧﻠﯾل اﻟﻛﻠﯾﺔ اﻟﺗﻘﻧﯾﺔ-ﻣوﺻل- ھﯾﺋﺔ اﻟﺗﻌﻠﯾم اﻟﺗﻘﻧﻲ ﻣﻠﺧص اﻟﺑﺣث : ﯾﻘﺎل ﻷﯾﺔ ﻣﺟﻣوﻋﺔ ﺟزﺋﯾﺔ S ﻣن ﻣﺟﻣوﻋﺔ اﻟرؤوس V ﻓﻲ ﺑﯾﺎن G ﺑﺄﻧﻬﺎ ﻣﺟﻣوﻋﺔ ﻣﻬﯾﻣﻧﺔ Dominating set إذا ﻛﺎن ﻟﻛل أرس v ﻓﻲ اﻟﻣﺟﻣوﻋﺔ V-S ﯾوﺟد أرس u ﻓﻲS ﺑﺣﯾث uv ﺿﻣن 491 Ayhan A. & Omar A. ﺣﺎﻓﺎت اﻟﺑﯾﺎن،. وﯾﻌرف اﻟﻌدد اﻟﻣﻬﯾﻣن Domination number ﺑﺄﻧﻪ أﺻﻐر ﻣﺟﻣوﻋﺔ أﺳﺎﺳﯾﺔ ﻣﻬﯾﻣﻧﺔ Domination. ﻓﻲ ﻫذا اﻟﺑﺣث ﺳوف ﻧدرس اﻟﻌدد اﻟﻣﻬﯾﻣن Domination number ﻟﺑﯾﺎن ﺗﺎدﺑول (Tadpole graph) ، ﺑﯾﺎن ﺑوك (Book graph) وﺑﯾﺎن ﺳﺗﺎﻛﯾت ﺑوك ( Stacked Book graph).
    [Show full text]
  • The Infinite and Contradiction: a History of Mathematical Physics By
    The infinite and contradiction: A history of mathematical physics by dialectical approach Ichiro Ueki January 18, 2021 Abstract The following hypothesis is proposed: \In mathematics, the contradiction involved in the de- velopment of human knowledge is included in the form of the infinite.” To prove this hypothesis, the author tries to find what sorts of the infinite in mathematics were used to represent the con- tradictions involved in some revolutions in mathematical physics, and concludes \the contradiction involved in mathematical description of motion was represented with the infinite within recursive (computable) set level by early Newtonian mechanics; and then the contradiction to describe discon- tinuous phenomena with continuous functions and contradictions about \ether" were represented with the infinite higher than the recursive set level, namely of arithmetical set level in second or- der arithmetic (ordinary mathematics), by mechanics of continuous bodies and field theory; and subsequently the contradiction appeared in macroscopic physics applied to microscopic phenomena were represented with the further higher infinite in third or higher order arithmetic (set-theoretic mathematics), by quantum mechanics". 1 Introduction Contradictions found in set theory from the end of the 19th century to the beginning of the 20th, gave a shock called \a crisis of mathematics" to the world of mathematicians. One of the contradictions was reported by B. Russel: \Let w be the class [set]1 of all classes which are not members of themselves. Then whatever class x may be, 'x is a w' is equivalent to 'x is not an x'. Hence, giving to x the value w, 'w is a w' is equivalent to 'w is not a w'."[52] Russel described the crisis in 1959: I was led to this contradiction by Cantor's proof that there is no greatest cardinal number.
    [Show full text]
  • Minimally Separating Sets, Mediatrices, and Brillouin Spaces
    MINIMALLY SEPARATING SETS, MEDIATRICES, AND BRILLOUIN SPACES J.J.P. VEERMAN AND JAMES BERNHARD Abstract. Brillouin zones and their boundaries were studied in [16] because they play an important role in focal decomposition as first defined by Peixoto in [9] and in physics ([1] and [3]). In so-called Brillouin spaces, the boundaries of the Brillouin zones have certain regularity properties which imply that they consist of pieces of mediatrices (or equidistant sets). The purpose of this note is two-fold. First, we give some simple conditions on a metric space which are sufficient for it to be a Brillouin space. These con- ditions show, for example, that all compact, connected Riemannian manifolds with their usual distance functions are Brillouin spaces. Second, we exhibit a restriction on the Z2-homology of mediatrices in such manifolds in terms of the Z2-homology of the manifolds themselves, based on the fact that they are Bril- louin spaces. (This will used to obtain a classification up to homeomorphim of surface mediatrices in [15]). This note begins with some preliminaries in Section 1, where we define the relevant concepts and provide some background and motivation for the questions being considered here. In Section 2, we list a simple set of conditions on a metric space and prove that these conditions suffice for it to be a Brillouin space. In Section 3, we give some examples and mention a result for use in a later paper. We then investigate in Section 4 the homological restrictions placed on a mediatrix by the topology of the surrounding Brillouin space.
    [Show full text]