Related papers: Weighted frames, weighted lower semi frames and un…
In this note, we fix a real invertible $d\times d$ matrix $\mathcal{A}$ and consider $\mathcal{A}\mathbb{Z}^d$ as an index set. For $f\in L^2(\mathbb{R}^d)$, let $\Phi^{\mathcal{A}}_{f}:=\frac{1}{|\det \mathcal{A}|}\sum_{k\in…
We study the problem of synthesizing a number of likely future frames from a single input image. In contrast to traditional methods, which have tackled this problem in a deterministic or non-parametric way, we propose a novel approach that…
Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
We study an LCM-based analogue of Rowland's GCD-based prime-generating recurrence, introduced by the author in 2008. The multiplicative increments of this sequence are conjectured always to be $1$ or prime, but a complete proof requires a…
This paper concerns the overcompleteness of coherent frames for unimodular amenable groups. It is shown that for coherent frames associated with a localized vector a set of positive Beurling density can be removed yet still leave a frame.…
We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…
Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by the matrix multiplication exponent $\omega$, is a central problem in algebraic complexity theory. The best upper bounds on $\omega$, leading…
Let $q\geq 2$ be an integer, and $\Bbb F_q^d$, $d\geq 1$, be the vector space over the cyclic space $\Bbb F_q$. The purpose of this paper is two-fold. First, we obtain sufficient conditions on $E \subset \Bbb F_q^d$ such that the inverse…
By bivariate irreducible representations of ${\rm Sp}(2r)$, we mean irreducible representations with highest weights containing at most two nonzero entries, using the usual identification of dominant weights for complex symplectic Lie…
We consider translates of functions in $L^2(\RRd)$ along an irregular set of points. Introducing a notion of pseudo-Gramian function for the irregular case, we obtain conditions for a family of irregular translates to be a Bessel sequence…
In this paper, we prove a converse theorem for half-integral weight modular forms assuming functional equations for $L$-series with additive twists. This result is an extension of Booker, Farmer, and Lee's result in [BFL22] to the…
In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…
We propose to store several integers modulo a small prime into a single machine word. Modular addition is performed by addition and possibly subtraction of a word containing several times the modulo. Modular Multiplication is not directly…
This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…
A permutation $\pi$ contains a permutation $\sigma$ as a pattern if it contains a subsequence of length $|\sigma|$ whose elements are in the same relative order as in the permutation $\sigma$. This notion plays a major role in enumerative…
We consider frames in a finite-dimensional Hilbert space where frames are exactly the spanning sets of the vector space. A factor poset of a frame is defined to be a collection of subsets of $I$, the index set of our vectors, ordered by…
We solve the problem of best approximation by Parseval frames to an arbitrary frame in a subspace of an infinite dimensional Hilbert space. We explicitly describe all the solutions and we give a criterion for uniqueness. This best…
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen at random with probability proportional to its weight. In the case where the total…