Related papers: A quantitative notion of redundancy for infinite f…

Descent theory (a modern formulation of Fermat's classical method of infinite descent) is a powerful tool in arithmetic geometry. In this article, we reinterpret descent theory through the lens of quotient stacks and apply it in the setting…

We characterize exponential systems on sets of finite measure that form a frame or a Riesz sequence at the critical density. Namely, they are precisely those systems for which the underlying point set admits a weak limit that yields a Riesz…

In this article we will review some notions of infiniteness that appear in Hilbert space operators and operator algebras. These include proper infiniteness, Murray von Neumann's classification into type I and type III factors and the class…

We present a general framework to study uniqueness, stability and reconstruction for infinite-dimensional inverse problems when only a finite-dimensional approximation of the measurements is available. For a large class of inverse problems…

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…

In this paper, we propose a Bregman frame for several classical alternating minimization algorithms. In the frame, these algorithms have uniform mathematical formulation. We also present convergence analysis for the frame algorithm. Under…

Several finite dimensional quasi-probability representations of quantum states have been proposed to study various problems in quantum information theory and quantum foundations. These representations are often defined only on restricted…

A different general philosophy, to be called Full Randomness (FR), for the analysis of random effects models is presented, involving a notion of reducing or preferably eliminating fixed effects, at least formally. For example, under FR…

We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…

We describe the shrinking target problem for random iterated function systems which semi-conjugate to a random subshifts of finite type. We get the Hausdorff dimension of the set based on shrinking target problems with given targets. The…

The most fundamental notion for Hilbert space frames is the sequence of frame coefficients for a vector x in the space. Yet, we know little about the distribution of these coefficient sequences. In this paper, we make the first detailed…

The purpose of this paper is to show that the mathematics of quantum mechanics (QM) is the mathematics of set partitions (which specify indefiniteness and definiteness) linearized to vector spaces, particularly in Hilbert spaces. That is,…

In 2003, Benedetto and Fickus introduced a vivid intuition for an objective function called the frame potential, whose global minimizers are fundamental objects known today as unit norm tight frames. Their main result was that the frame…

We study the quantification of coherence in infinite dimensional systems, especially the infinite dimensional bosonic systems in Fock space. We show that given the energy constraints, the relative entropy of coherence serves as a…

Given a total sequence in a Hilbert space, we speak of an upper (resp. lower) semi-frame if only the upper (resp. lower) frame bound is valid. Equivalently, for an upper semi-frame, the frame operator is bounded, but has an unbounded…

The concept of R-duals of a frame was introduced by Casazza, Kutyniok and Lammers in 2004, with the motivation to obtain a general version of the duality principle in Gabor analysis. For tight Gabor frames and Gabor Riesz bases the three…

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

Inclusion of redundant fundamental quantities in SI system has resulted in lot of ambiguities and confusion in modern theories. The incompatibilities between the existing theories can possibly be due to incorrect assumption of fundamental…

The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes…

We provide partial results towards a conjectural generalization of a theorem of Lubotzky-Mozes-Raghunathan for arithmetic groups (over number fields or function fields) that implies, in low dimensions, both polynomial isoperimetric…