DOCSLIB.ORG

Generic Invertibility of Multidimensional Fir Multirate Systems and Filter Banks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Generic Invertibility of Multidimensional Fir Multirate Systems and Filter Banks GENERIC INVERTIBILITY OF MULTIDIMENSIONAL FIR MULTIRATE SYSTEMS AND FILTER BANKS Minh N. Do Ka L. Law, Robert M. Fossum Department of Electrical Department of Mathematics and Computer Engineering University of Illinois at Urbana-Champaign University of Illinois at Urbana-Champaign Urbana IL 61801 Urbana IL 61801 ABSTRACT polyphase matrix G(z). The existence of a synthesis part becomes a purely mathematical question. The perfect recon- We study the invertibility of M-variate polynomial (respec- struction condition holds if and only if G(z)H(z) = IP tively : Laurent polynomial) matrices of size N by P . Such where IP is the P P identity matrix. matrices represent multidimensional systems in various set- Then it is a natural× question to ask: When does the system tings including filter banks, multiple-input multiple-outputsys- have a high probability of the existence of an inverse? Ra- tems, and multirate systems. The main result of this paper is jagopal and Potter [2] and Zhou and Do [3] have investigated H z to prove that when N P M, then ( ) is generically this question and made several conjectures. We investigate invertible; whereas when− ≥ , then H z is gener- N P <M ( ) the systems by varying M, N and P . In the experiments, we ically noninvertible. As a result,− we can have an alternative found that when M N P , the existence of an inverse is approach in design of the multidimensional systems. “almost surely”. On− the other≥ hand, when M N < P , the − Index Terms— Generic Invertible, Left Invertibility, Per- nonexistence of an inverse is “almost surely”. To precisely fect Reconstruction, Multirate Systems, Generic Property. study this inverse existence problem, we employ the concept of “hold generically” [4]. 1. INTRODUCTION 2. GENERIC INVERTIBILITY During the last two decades, one dimensional multirate sys- 2.1. Generic Property tems in digital signal processing were thoroughly developed. In recent years, due to the high demand in multidimensional In [3], Zhou and Do made the following conjectures. processing including image and video processing, volumetric Conjecture 1 Suppose H z is an -variate poly- data analysis and spectroscopic imaging, multidimensional ( ) N P M nomial (resp. : Laurent polynomial) matrix× with . If multirate systems have been studied more extensively. One N P , then it is “almost surely” polynomial≥ (resp. : key property of a multidimensional multirate system is its per- N P M Laurent− ≥ polynomial) left invertible. Otherwise, it is “almost fect reconstruction, which guarantees that an original input surely” polynomial (resp. : Laurent polynomial) left nonin- can be perfectly reconstructed from the outputs. vertible. In a multidimensional multirate system, a digital signal is split into several channels and processed with different sam- However, Zhou and Do did not give a precise definition of pling rates. The most popular multirate systems are filter “almost surely”. In order to have the appropriate language, banks. Using the polyphase representation in the z-domain we employ the concept of “hold generically”. [1], we can represent the analysis part as an matrix N P Definition 1 (Generic) [4] A property is said to hold gener- H(z) with entries in a Laurent polynomial ring C×[z ,z , ..., 1 2 ically for polynomials f , .., f of degree at most k , ..., k if z ,z −1, ..., z −1]. Here M is the dimension of signals, 1 n 1 n M 1 M there is a nonzero polynomial F in the coefficients of the f N is the number of channels in the filter bank, and P is the i such that the property holds for f , ..., f whenever the poly- sampling factor at each channel. An application of this set- 1 n nomial F (f , ..., f ) is nonvanishing. ting may arise in multichannel acquisition. Here we collect 1 n data about unknown multidimensional signal X(z) as out- Lemma 1 If a property of polynomials of degree at most k1, put of the analysis part. The acquisition system (filters Hi(z) ..., kn in m variables is generic, then the coefficient space of and sampling matrix D) is fixed and known beforehand. The polynomials whose polynomials failed to satisfy the properC ty objective is to reconstruct X(z) with an P N synthesis is measure zero and nowhere dense. × Proof By the definition of hold generically, there exists a and N P , then the P P maximal minors of H(z) have ≥ × nonzero polynomial F in the coefficients of the fi such that a common zero. Suppose (˜z1/z˜0, z˜2/z˜0, ..., z˜M /z˜0) is a so- the property fails to satisfy for f , ..., fn for which the polyno- lution of the maximal minors of H(z) where z˜ = 0. Then 1 0 6 mial F (f1, ..., fn) is vanishing. Let Ri bethesetof M-variate (˜z0, z˜1, z˜2, ..., z˜M ) is a nonzero solution of maximal minors polynomialsof degree less than or equal to ki. By Gunningin of H(Z). Since t1, ..., tM+1 is a part of the subset of the n { H Z} H z [5, p.9], λl( (f1, ..., fn) i=1 Ri F (f1, ..., fn)=0 )= set of maximal minors of ( ), this implies that φ( ( )) { 1 ∈ Qn | } 0 where l = k +m +...+ k +m is the dimension of the co- have a nontrivial common zero. Therefore, by the property of m m efficient space. Thus, the coefficient space of polynomials the resultant shown in Theorem 1, we know RES(Pk,...,Pk) whose polynomials failed to satisfy the propertyC is measure φ(H(z)) = 0 for all noninvertible matrices H(z) of de- ◦ zero. To show the set is nowhere dense, it is equivalent to gree at most k. The RES(Pk,...,Pk) and ti are polynomials, show that the closure of the set contains no open set. Sup- so is RES Pk,...,Pk φ. Last but not least, we need to show ( ) ◦ pose it contains an open ball B(ǫ) with some radius ǫ > 0. RES(Pk,...,Pk) φ is not a zero function. Let −1 −1 ◦ ½ Since F ( 0 ) is a closed set, is also in F ( 0 ). Thus, ¼ −1 { } C { } 1 0 . 0 F ( 0 ) contains the open ball B(ǫ). However, this contra- k − z1 1 . 0 dicts the{ } fact that F 1( 0 ) is measure zero. Therefore, the . { } . coefficient space of polynomials whose polynomials failed to . 1 satisfy the property is nowhere dense. k k .. k zM zM−1 . z1 The immediate consequence is that if f1, ..., fn are drawn in- T z k . ( )= . zM . dependently from a probability distribution with respect to the 0 . . Lebesgue measure, the property of holds with prob- . zk f1, ..., fn . M ˜ ˜ ability one. Furthermore, suppose f0, ..., fn satisfies the prop- 0 . 0 0 erty. Since the coefficient space of polynomials whose poly- . nomials failed to satisfy the propertyC is nowhere dense, there . 0 . 0 0 exists an open ball B(ǫ) around f˜0, ..., f˜n for some ǫ> 0 such that the property is satisfied within the open ball B(ǫ) . This be an N P matrix. Suppose RES φ(T (z)) = × (Pk,...,Pk) ◦ shows that the system with the property is robust [6]. 0. By Theorem 1, we know that ti’s have a nontrivial com- mon zero. i.e. there exists Z˜ a nonzero solution such that Z˜ P k 2.2. Generically Invertible when N P M tM+1( )=˜zM =0. This implies z˜M =0. If z˜M =0, then − ≥ P k t (˜z , z˜ , ..., z˜ − , 0)=z ˜ =0. Thus z˜ − =0. Con- To prove our main theorem in this section, we need to employ M 0 1 M 1 M−1 M 1 tinuing the process, we can conclude z˜ =z ˜ = ... =z ˜ = the resultant of the polynomials. 0 1 M 0. This contradicts the assumption that Z˜ is nontrivial. So Theorem 1 (Resultant) If we fix positive degrees k0, ..., kn, RES(Pk,...,Pk) φ(T (z)) =0. Therefore RES(Pk,...,Pk) φ then there is a unique nonzero polynomial called the resul- is not zero function.◦ By the6 definition of hold generically,◦ we C tant RES(k0,...,kn) [ ui,j ] where the variables ui,j cor- conclude that H(z) of degree at most k is generically poly- ∈ { } respond to the coefficients of i-th polynomial. If F0, ..., Fn nomial left invertible matrix. ∈ C[x0, ..., xn] are homogeneous of degrees k0, ..., kn, then F0, ..., Fn have a nontrivial common zero over C if and only if Theorem 3 If N P M and k > 0, then an N P polynomial M-variate− matrix≥ H(z) of degree at most×k is RES(k0,...,kn)(F0, ..., Fn)=0. generically Laurent polynomial left invertible. Theorem 2 If N P M and k > 0, then an N P − ≥ × polynomial M-variate matrix H(z) of degree at most k is Proof If a polynomial matrix H(z) is Laurent polynomial generically polynomial left invertible. left noninvertible, then H(z) is also polynomial left nonin- Proof The strategy of this proof is to find a nonzero poly- vertible. Accordingto Theorem2, this shows that RES(Pk,...,Pk) H z nomial F such that F (H(z)) = 0 for every noninvertible φ( ( )) = 0 for all Laurent polynomial left noninvertible polynomial◦ matrix H(z). matrix H(z) of degree at most k. Let Z = (z0, ..., zM ). If f(z) = f0(z)+ f1(z)+ ... + fl(z) is the decomposition of the polynomial f(z) into sums of forms fi(z) of degree 2.3. Generically Noninvertible when N P <M Z z − i, then the homogenization f( ) of f( ) of degree k is de- Pn Z k z k−1 z k−l z Projective n-space is the set of equivalence classes of (n+ fined to be f( )= z0 f0( )+ z0 f1( )+ ..
Load more

Recommended publications
  • Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces 3
    GENERIC GLOBAL RIGIDITY IN COMPLEX AND PSEUDO-EUCLIDEAN SPACES STEVEN J. GORTLER AND DYLAN P. THURSTON Abstract. In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo- Euclidean space (Rd with a metric of indefinite signature). We show that a graph is generically globally rigid in Euclidean space iff it is generically globally rigid in a complex or pseudo-Euclidean space. We also establish that global rigidity is always a generic property of a graph in complex space, and give a sufficient condition for it to be a generic property in a pseudo-Euclidean space. Extensions to hyperbolic space are also discussed. 1. Introduction The property of generic global rigidity of a graph in d-dimensional Euclidean space has recently been fully characterized [4, 7]. It is quite natural to study this property in other spaces as well. For example, recent work of Owen and Jackson [8] has studied the number of equivalent realizations of frameworks in C2. In this paper we study the property of generic global rigidity of graphs embedded in Cd as well as graphs embedded in a pseudo Euclidean space (Rd equipped with an indefinite metric signature). We show that a graph Γ is generically globally rigid (GGR) in d-dimensional Euclidean space iff Γ is GGR in d-dimensional complex space. Moreover, for any metric signature, s, We show that a graph Γ is GGR in d-dimensional Euclidean space iff Γ is GGR in d- dimensional real space under the signature s.
    [Show full text]
  • A Generic Property of the Bounded Syzygy Solutions Author(S): Florin N
    A Generic Property of the Bounded Syzygy Solutions Author(s): Florin N. Diacu Source: Proceedings of the American Mathematical Society, Vol. 116, No. 3 (Nov., 1992), pp. 809-812 Published by: American Mathematical Society Stable URL: http://www.jstor.org/stable/2159450 Accessed: 16/11/2009 21:52 Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at http://www.jstor.org/action/showPublisher?publisherCode=ams. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. American Mathematical Society is collaborating with JSTOR to digitize, preserve and extend access to Proceedings of the American Mathematical Society. http://www.jstor.org PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 116, Number 3, November 1992 A GENERIC PROPERTY OF THE BOUNDED SYZYGY SOLUTIONS FLORIN N.
    [Show full text]
  • Lids-R-904 Robust Stability of Linear Systems
    LIDS-R-904 ROBUST STABILITY OF LINEAR SYSTEMS - SOME COMPUTATIONAL CONSIDERATIONS* by Alan J. Laub** 1. INTRODUCTION In this paper we shall concentrate on some of the computational issues which arise in studying the robust stability of linear systems. Insofar as possible, we shall use notation consistent with Stein's paper [11 and we shall make frequent reference to that work. As we saw in [1] a basic stability question for a linear time-invariant system with transfer matrix G(s) is the following: given that a nominal closed-loop feedbadk system is stable, does the feedback system remain stable when subjected to perturbations and how large can those perturba- tions be? It turned out, through invocation of the Nyquist Criterion, that the size of the allowable perturbations was related to the "nearness to singularity" of the return difference matrix I + G(jW). Closed-loop stability was said to be "robust" if G could tolerate considerable perturbation before I + G became singular. Invited Paper presented at the Second Annual Workshop on the Informa- tion Linkage between Applied Mathematics and Industry held at Naval Postgraduate School, Monterey, California, Feb. 20-24, 1979; this research was partially supported by NASA under grant NGL-22-009-124 and the Department of Energy under grant ET-78-(01-3395). ** Laboratory for Information and Decision Systems, Pm. 35-331, M.I.T., Cambridge, MA 02139. -2- We shall now indulge in a modicum of abstraction and attempt to formalize the notion of robustness. The definition will employ some jargon from algebraic geometry and will be applicable to a variety of situations.
    [Show full text]
  • Generic Flatness for Strongly Noetherian Algebras
    Journal of Algebra 221, 579–610 (1999) Article ID jabr.1999.7997, available online at http://www.idealibrary.com on Generic Flatness for Strongly Noetherian Algebras M. Artin* Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 View metadata, citation and similar papersE-mail: at core.ac.uk [email protected] brought to you by CORE provided by Elsevier - Publisher Connector L. W. Small Department of Mathematics, University of California at San Diego, La Jolla, California 92093 E-mail: [email protected] and J. J. Zhang Department of Mathematics, Box 354350, University of Washington, Seattle, Washington 98195 E-mail: [email protected] Communicated by J. T. Stafford Received November 18, 1999 Key Words: closed set; critically dense; generically flat; graded ring; Nullstellen- satz; strongly noetherian; universally noetherian. © 1999 Academic Press CONTENTS 0. Introduction. 1. Blowing up a critically dense sequence. 2. A characterization of closed sets. 3. Generic flatness. 4. Strongly noetherian and universally noetherian algebras. 5. A partial converse. *All three authors were supported in part by the NSF and the third author was also supported by a Sloan Research Fellowship. 579 0021-8693/99 $30.00 Copyright © 1999 by Academic Press All rights of reproduction in any form reserved. 580 artin, small, and zhang 0. INTRODUCTION In general, A will denote a right noetherian associative algebra over a commutative noetherian ring R.LetR0 be a commutative R-algebra. If R0 is finitely generated over R, then a version of the Hilbert basis theorem 0 asserts that A ⊗R R is right noetherian. We call an algebra A strongly right 0 0 noetherian if A ⊗R R is right noetherian whenever R is noetherian.
    [Show full text]
  • Generic Continuous Functions and Other Strange Functions in Classical Real Analysis
    Georgia State University ScholarWorks @ Georgia State University Mathematics Theses Department of Mathematics and Statistics 4-17-2008 Generic Continuous Functions and other Strange Functions in Classical Real Analysis Douglas Albert Woolley Follow this and additional works at: https://scholarworks.gsu.edu/math_theses Part of the Mathematics Commons Recommended Citation Woolley, Douglas Albert, "Generic Continuous Functions and other Strange Functions in Classical Real Analysis." Thesis, Georgia State University, 2008. https://scholarworks.gsu.edu/math_theses/44 This Thesis is brought to you for free and open access by the Department of Mathematics and Statistics at ScholarWorks @ Georgia State University. It has been accepted for inclusion in Mathematics Theses by an authorized administrator of ScholarWorks @ Georgia State University. For more information, please contact [email protected]. GENERIC CONTINUOUS FUNCTIONS AND OTHER STRANGE FUNCTIONS IN CLASSICAL REAL ANALYSIS by Douglas A. Woolley Under the direction of Mihaly Bakonyi ABSTRACT In this paper we examine continuous functions which on the surface seem to defy well-known mathematical principles. Before describing these functions, we introduce the Baire Cate- gory theorem and the Cantor set, which are critical in describing some of the functions and counterexamples. We then describe generic continuous functions, which are nowhere differ- entiable and monotone on no interval, and we include an example of such a function. We then construct a more conceptually challenging function, one which is everywhere differen- tiable but monotone on no interval. We also examine the Cantor function, a nonconstant continuous function with a zero derivative almost everywhere. The final section deals with products of derivatives. INDEX WORDS: Baire, Cantor, Generic Functions, Nowhere Differentiable GENERIC CONTINUOUS FUNCTIONS AND OTHER STRANGE FUNCTIONS IN CLASSICAL REAL ANALYSIS by Douglas A.
    [Show full text]
  • Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
    Mathematical Surveys and Monographs Volume 177 Non-commutative Cryptography and Complexity of Group-theoretic Problems Alexei Myasnikov Vladimir Shpilrain Alexander Ushakov With an appendix by Natalia Mosina American Mathematical Society http://dx.doi.org/10.1090/surv/177 Mathematical Surveys and Monographs Volume 177 Non-commutative Cryptography and Complexity of Group-theoretic Problems Alexei Myasnikov Vladimir Shpilrain Alexander Ushakov With an appendix by Natalia Mosina American Mathematical Society Providence, Rhode Island EDITORIAL COMMITTEE Ralph L. Cohen, Chair MichaelA.Singer Jordan S. Ellenberg Benjamin Sudakov MichaelI.Weinstein 2010 Mathematics Subject Classification. Primary 94A60, 20F10, 68Q25, 94A62, 11T71. For additional information and updates on this book, visit www.ams.org/bookpages/surv-177 Library of Congress Cataloging-in-Publication Data Myasnikov, Alexei G., 1955– Non-commutative cryptography and complexity of group-theoretic problems / Alexei Myas- nikov, Vladimir Shpilrain, Alexander Ushakov ; with an appendix by Natalia Mosina. p. cm. – (Mathematical surveys and monographs ; v. 177) Includes bibliographical references and index. ISBN 978-0-8218-5360-3 (alk. paper) 1. Combinatorial group theory. 2. Cryptography. 3. Computer algorithms. 4. Number theory. I. Shpilrain, Vladimir, 1960– II. Ushakov, Alexander. III. Title. QA182.5.M934 2011 005.82–dc23 2011020554 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society.
    [Show full text]
  • 2 Negligible Sets 15 2.1 Porosity
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by idUS. Depósito de Investigación Universidad de Sevilla FACULTAD DE MATEMATICAS´ DEPARTAMENTO DE ANALISIS´ MATEMATICO´ GENERICITY OF THE FIXED POINT PROPERTY UNDER RENORMING Ph. D. Thesis presented by Supaluk Phothi UNIVERSIDAD DE SEVILLA FACULTAD DE MATEMATICAS´ DEPARTAMENTO DE ANALISIS´ MATEMATICO´ GENERICITY OF THE FIXED POINT PROPERTY UNDER RENORMING Memoria presentada por Supaluk Phothi para optar al grado de Doctora en Matemticas por la Universidad de Sevilla Fdo. Supaluk Phothi V◦.B◦.: Director del trabajo Fdo. Tom´asDom´ınguezBenavides Catedr´aticodel Departamento de An´alisisMatem´atico de la Universidad de Sevilla Sevilla, Julio de 2010 RESUMEN Una aplicaci´on T definida de un espacio m´etrico M en M se dice no expan- siva si d(T x; T y) ≤ d(x; y) para todo x; y 2 M. Diremos que un espacio de Banach X tiene la Propiedad D´ebildel Punto Fijo (w-FPP) si para toda aplicaci´onno expansiva T definida de un subconjunto d´ebilmente compacto convexo C de X en C tiene un punto fijo. En esta disertaci´on,estudiamos principalmente la w-FPP como una propiedad gen´ericaen el conjunto de todas las normas equivalentes de un espacio de Banach reflexivo dado. Una propiedad P se dice gen´ericaen un conjunto A si todos los elementos de A sat- isfacen P excepto aquellos pertenecientes a un conjunto de tama~nopeque~no. Con el fin de establecer los resultados de este trabajo, consideraremos varias nociones de conjuntos peque~nos,como por ejemplo los conjuntos de Baire de primera categor´ıa,conjuntos porosos, conjuntos nulos Gausianos o conjuntos direccionalmente porosos.
    [Show full text]
  • Higher Dimensional Trichotomy Conjectures in Model Theory By
    Higher Dimensional Trichotomy Conjectures in Model Theory by Benjamin Castle A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Thomas Scanlon, Chair Associate Professor Pierre Simon Associate Professor Adityanand Guntuboyina Spring 2021 Higher Dimensional Trichotomy Conjectures in Model Theory Copyright 2021 by Benjamin Castle 1 Abstract Higher Dimensional Trichotomy Conjectures in Model Theory by Benjamin Castle Doctor of Philosophy in Mathematics University of California, Berkeley Professor Thomas Scanlon, Chair In this thesis we study the Restricted Trichotomy Conjectures for algebraically closed and o-minimal fields. These conjectures predict a classification of all sufficiently complex, that is, non-locally modular, strongly minimal structures which can be interpreted from such fields. Such problems have been historically divided into `lower dimensional' and `higher dimen- sional' cases; this thesis is devoted to a number of partial results in the higher dimensional cases. In particular, in ACF0 and over o-minimal fields, we prove that all higher dimensional strongly minimal structures whose definable sets satisfy certain geometric restrictions are locally modular. We also make progress toward verifying these geometric restrictions in any counterexample. Finally, in the last chapter we give a full proof of local modularity for strongly minimal expansions of higher dimensional groups in ACF0. i To Katrina and Justin ii Contents Contents ii 1 Introduction 1 1.1 Historical Background . 1 1.2 The Challenge of Working in Higher Dimensions . 3 1.3 Outline of Results . 5 2 Preliminaries on Strongly Minimal Sets 7 2.1 Strong Minimality and Dimension .
    [Show full text]
  • CHARACTERIZING GENERIC GLOBAL RIGIDITY 1. Introduction In
    CHARACTERIZING GENERIC GLOBAL RIGIDITY STEVEN J. GORTLER, ALEXANDER D. HEALY, AND DYLAN P. THURSTON d Abstract. A d-dimensional framework is a graph and a map from its vertices to E . d Such a framework is globally rigid if it is the only framework in E with the same graph and edge lengths, up to rigid motions. For which underlying graphs is a generic framework globally rigid? We answer this question by proving a conjecture by Connelly, that his sufficient condition is also necessary. The condition comes from considering the geometry of the length-squared mapping `; essentially, the graph is generically locally rigid iff the rank of ` is maximal, and it is generically globally rigid iff the rank of the Gauss map on the image of ` is maximal. We also show that this condition is efficiently checkable with a randomized algorithm. 1. Introduction In this paper we characterize those generic frameworks which are globally rigid in d- dimensional Euclidean space. We do this by proving a conjecture of Connelly [8], who described a sufficient condition for generic frameworks to be globally rigid, and conjectured that this condition was necessary. As the truth of this condition depends only on the graph and the dimension d, and not on the specific framework of that graph, we can conclude that generic global rigidity in Ed is a property of a graph. We further show that this property can be checked in probabilistic polynomial time. Global rigidity has applications in chemistry, where various technologies measure inter- atomic distances. From this data one may try to infer the geometry of the configuration [9, inter alia].
    [Show full text]
  • On the Generic Low-Rank Matrix Completion
    On the Generic Low-Rank Matrix Completion Yuan Zhang, Yuanqing Xia∗, Hongwei Zhang, Gang Wang, and Li Dai Abstract—This paper investigates the low-rank matrix com- where the matrix to be completed consists of spatial coordi- pletion (LRMC) problem from a generic vantage point. Unlike nates and temporal (frame) indices [9, 10]. most existing work that has focused on recovering a low-rank matrix from a subset of the entries with specified values, the The holy grail of the LRMC is that, the essential information only information available here is just the pattern (i.e., positions) of a low-rank matrix could be contained in a small subset of of observed entries. To be precise, given is an n × m pattern matrix (n ≤ m) whose entries take fixed zero, unknown generic entries. Therefore, there is a chance to complete a matrix from values, and missing values that are free to be chosen from the a few observed entries [5, 11, 12]. complex field, the question of interest is whether there is a matrix completion with rank no more than n − k (k ≥ 1) for almost all Thanks to the widespread applications of LRMC in di- values of the unknown generic entries, which is called the generic verse fields, many LRMC techniques have been developed low-rank matrix completion (GLRMC) associated with (M,k), [4, 5, 8, 12–16]; see [11, 17] for related survey. Since the rank and abbreviated as GLRMC(M,k). Leveraging an elementary constraint is nonconvex, the minimum rank matrix completion tool from the theory on systems of polynomial equations, we give a simple proof for genericity of this problem, which was first (MRMC) problem which asks for the minimum rank over observed by Kirly et al., that is, depending on the pattern of the all possible matrix completions, is NP-hard [4].
    [Show full text]
  • The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
    Journal of Machine Learning Research 16 (2015) 1391-1436 Submitted 4/13; Revised 8/14; Published 8/15 The Algebraic Combinatorial Approach for Low-Rank Matrix Completion Franz J. Kir´aly [email protected] Department of Statistical Science University College London London WC1E 6BT, United Kingdom and Mathematisches Forschungsinstitut Oberwolfach 77709 Oberwolfach-Walke, Germany Louis Theran [email protected] Aalto Science Institute and Department of Information and Computer Science∗ Aalto University 02150 Espoo, Finland Ryota Tomioka [email protected] Toyota Technological Institute at Chicago 6045 S. Kenwood Ave. Chicago, Illinois 60637, USA Editor: G´abor Lugosi Abstract We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the treatment of single entries in a closed theoretical and practical framework. More specifically, apart from introducing an algebraic combinatorial theory of low-rank matrix completion, we present probability- one algorithms to decide whether a particular entry of the matrix can be completed. We also describe methods to complete that entry from a few others, and to estimate the error which is incurred by any method completing that entry. Furthermore, we show how known results on matrix completion and their sampling assumptions can be related to our new perspective and interpreted in terms of a completability phase transition.1 Keywords: Low-rank matrix completion, entry-wise completion, matrix reconstruction, algebraic combinatorics ∗. Author's current address. Research was carried out while the author was at Freie Universit¨atBerlin and supported by the European Research Council under the European Union's Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement no 247029-SDModels 1.
    [Show full text]
  • Semi-Regular Sequences and Other Random Systems of Equations
    SEMI-REGULAR SEQUENCES AND OTHER RANDOM SYSTEMS OF EQUATIONS M. BIGDELI, E. DE NEGRI, M. M. DIZDAREVIC, E. GORLA, R. MINKO, AND S. TSAKOU Abstract. The security of multivariate cryptosystems and digital signature schemes relies on the hardness of solving a system of polynomial equations over a finite field. Polynomial system solving is also currently a bottleneck of index-calculus algorithms to solve the elliptic and hyperelliptic curve discrete logarithm problem. The complexity of solving a system of polynomial equations is closely related to the cost of computing Gr¨obnerbases, since computing the solutions of a polynomial system can be reduced to finding a lexicographic Gr¨obner basis for the ideal generated by the equations. Several algorithms for computing such bases exist: We consider those based on repeated Gaussian elimination of Macaulay matrices. In this paper, we analyze the case of random systems, where random systems means either semi-regular systems, or quadratic systems in n variables which contain a regular sequence of n polynomials. We provide explicit formulae for bounds on the solving degree of semi-regular systems with m > n equations in n variables, for equations of arbitrary degrees for m = n + 1, and for any m for systems of quadratic or cubic polynomials. In the appendix, we provide a table of bounds for the solving degree of semi-regular systems of m = n + k quadratic equations in n variables for 2 ≤ k; n ≤ 100 and online we provide the values of the bounds for 2 ≤ k; n ≤ 500. For quadratic systems which contain a regular sequence of n polynomials, we argue that the Eisenbud-Green-Harris conjecture, if true, provides a sharp bound for their solving degree, which we compute explicitly.
    [Show full text]