Related papers: Extended Central Factorial Numbers and the Flicker…
Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required…
In many instances one has to deal with parametric models. Such models in vector spaces are connected to a linear map. The reproducing kernel Hilbert space and affine- / linear- representations in terms of tensor products are directly…
Researchers have identified complex matrices $A$ such that a bounded linear operator $B$ acting on a Hilbert space will admit a dilation of the form $A \otimes I$ whenever the numerical range inclusion relation $W(B) \subseteq W(A)$ holds.…
We give explicit low-rank bilinear non-commutative schemes for multiplying structured $n \times n$ matrices with $2 \leq n \leq 5$, which serve as building blocks for recursive algorithms with improved multiplicative factors in asymptotic…
This paper presents an innovative approach to the study of recurrent sequences by introducing the concept of arithmetic pseudo-operators. Unlike conventional operators, these pseudo-operators are pure complex numbers with specific…
Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\in\mathbb{F}^{N\times N}$ and a vector $b$, it is known that in the worst case $\Theta(N^2)$ operations over $\mathbb{F}$ are needed to…
In this paper, we introduce the notion of a characteristic operator for closable linear operators and explore their connected spectral properties via equivalence. Additionally, we develop an explicit scheme for constructing characteristic…
Many important special numbers appear in the expansions of some polynomials in terms of central factorials and vice versa, for example central factorial numbers, degenerate central factorial numbers, and central Lah numbers which are…
Deep neural networks, despite their success in numerous applications, often function without established theoretical foundations. In this paper, we bridge this gap by drawing parallels between deep learning and classical numerical analysis.…
Given a barrier $0 \leq b_0 \leq b_1 \leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \leq a_0 \leq a_1 \leq ... \leq a_n$ for which $a_j \leq b_j$ for all $0 \leq j \leq n$. Known formul\ae for $f(n)$ include an $n…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
We present a construction for complementary pairs of arrays that exploits a set of mutually-unbiased bases, and enumerate these arrays as well as the corresponding set of complementary sequences obtained from the arrays by projection. We…
In this paper we introduce a notion of duality for matrix valued orthogonal polynomials with respect to a measure supported on the nonnegative integers. We show that the dual families are closely related to certain difference operators…
This paper lays the groundwork for the theory of categorical diagonalization. Given a diagonalizable operator, tools in linear algebra (such as Lagrange interpolation) allow one to construct a collection of idempotents which project to each…
Floating-point addition on a finite-precision machine is not associative, so not all mathematically equivalent summations are computationally equivalent. Making this assumption can lead to numerical error in computations. Proper ordering…
We develop recursion relations, in particle number, for all (unprojected) Jain composite fermion (CF) wave functions. These recursions generalize a similar recursion originally written down by Read for Laughlin states, in mixed first-second…
We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…
We construct new continued fraction expansions of Jacobi-type J-fractions in $z$ whose power series expansions generate the ratio of the $q$-Pochhamer symbols, $(a; q)_n / (b; q)_n$, for all integers $n \geq 0$ and where $a,b,q \in…
By studying Cameron's operator in terms of determinants, two kinds of "integer" sequences of incomplete numbers were introduced. One was the sequence of restricted numbers, including $s$-step Fibonacci sequences. Another was the sequence of…
The operator-Schmidt decomposition is useful in quantum information theory for quantifying the nonlocality of bipartite unitary operations. We construct a family of unitary operators on C^n tensor C^n whose operator-Schmidt decompositions…