[图书][B] An introduction to compressed sensing

M Vidyasagar - 2019 - SIAM
Compressed sensing (or compressive sensing) refers to the recovery of high-dimensional
but low-complexity objects from a limited number of measurements. Two canonical …

The Cohomological Sarnak-Xue Density Hypothesis for

S Evra, M Gerbelli-Gauthier, H Gustafsson - arXiv preprint arXiv …, 2023 - arxiv.org
We prove the cohomological version of the Sarnak-Xue Density Hypothesis for $ SO_5 $
over a totally real field and for inner forms split at all finite places. The proof relies on recent …

Ramanujan Bigraphs

S Evra, B Feigon, K Maurischat… - arXiv preprint arXiv …, 2023 - arxiv.org
In their seminal paper, Lubotzky, Phillips and Sarnak (LPS) defined the notion of regular
Ramanujan graphs and gave an explicit construction of infinite families of $(p+ 1) $-regular …

Explicit construction of Ramanujan bigraphs

C Ballantine, B Feigon, R Ganapathy, J Kool… - Women in Numbers …, 2015 - Springer
We construct explicitly an infinite family of Ramanujan graphs which are bipartite and
biregular. Our construction starts with the Bruhat–Tits building of an inner form of SU 3 (ℚ p) …

The Ramanujan property for simplicial complexes

UA First - arXiv preprint arXiv:1605.02664, 2016 - arxiv.org
Let $ G $ be a topological group acting on a simplicial complex $\mathcal {X} $ satisfying
some mild assumptions. For example, consider a $ k $-regular tree and its automorphism …

Existence and polynomial time construction of biregular, bipartite Ramanujan graphs of all degrees

A Gribinski, AW Marcus - arXiv preprint arXiv:2108.02534, 2021 - arxiv.org
We prove that there exist bipartite, biregular Ramanujan graphs of every degree and every
number of vertices provided that the cardinalities of the two sets of the bipartition divide each …

[HTML][HTML] New and explicit constructions of unbalanced Ramanujan bipartite graphs

SP Burnwal, K Sinha, M Vidyasagar - The Ramanujan Journal, 2022 - Springer
The objectives of this article are threefold. Firstly, we present for the first time explicit
constructions of an infinite family of unbalanced Ramanujan bigraphs. Secondly, we revisit …

Spectra of group-subgroup pair graphs

K Kimoto - … Modelling for Next-Generation Cryptography: CREST …, 2018 - Springer
Graphs with large isoperimetric constants play an important role in cryptography because
one can utilize such graphs to construct cryptographic hash functions. Ramanujan graphs …

New and explicit constructions of unbalanced ramanujan bipartite graphs

SP Burnwal, K Sinha, M Vidyasagar - arXiv preprint arXiv:1910.03937, 2019 - arxiv.org
The objectives of this article are three-fold. Firstly, we present for the first time explicit
constructions of an infinite family of\textit {unbalanced} Ramanujan bigraphs. Secondly, we …

Exact Completion of Rectangular Matrices Using Ramanujan Bigraphs

SP Burnwal, M Vidyasagar - 2020 American Control …, 2020 - ieeexplore.ieee.org
In this paper, we study the matrix completion problem: Suppose X∈ ℝ nr× nc is unknown
except for an upper bound r on its rank. By measuring a small number m≪ nrnc of elements …