Related papers: Ported Tutte Functions of Extensors and Oriented M…
Partial transpose is an important operation for quantifying the entanglement, here we study the (partial) transpose of any single (two-mode) operators. Using the Fock-basis expansion, it is found that the transposed operator of an arbitrary…
A catalogue of all non-isomorphic simple connected regular matroids ${\cal M}$ of cardinality $n \leq 15$ is provided on the net. These matroids are given as binary matrix matroids and are sieved from the large pool of all non-isomorphic…
We have generalized the \textsc{Mathematica} function \texttt{Apart} from 1 to $N$ dimension, the generalized function \texttt{\$Apart} can decompose any linear dependent elements in $\mathcal{V}_{x}^*$ to irreducible ones. The elements in…
The tensor t-function, a formalism that generalizes the well-known concept of matrix functions to third-order tensors, is introduced in [K. Lund, The tensor t-function: a definition for functions of third-order tensors, Numer. Linear…
Partial Isometries are important constructs that help give nontrivial solutions once a simple solution is known. We generalize this notion to Extended Partial Isometries and include operators which have right inverses but no left inverses…
We introduce and analyse a general class of not necessarily bounded multiplicative functions, examples of which include the function $n \mapsto \delta^{\omega (n)}$, where $\delta \neq 0$ and where $\omega$ counts the number of distinct…
Addition theorems can be constructed by doing three-dimensional Taylor expansions according to $f (\mathbf{r} + \mathbf{r}') = \exp (\mathbf{r}' \cdot \mathbf{\nabla}) f (\mathbf{r})$. Since, however, one is normally interested in addition…
In this paper we propose a general spectral theory for tensors. Our proposed factorization decomposes a tensor into a product of orthogonal and scaling tensors. At the same time, our factorization yields an expansion of a tensor as a…
This paper continues the study of combinatorial properties of binary functions --- that is, functions $f:2^E\rightarrow\mathbb{C}$ such that $f(\emptyset)=1$, where $E$ is a finite set. Binary functions have previously been shown to admit…
Infinite-dimensional orthonormal basis expansions play a central role in representing and computing with function spaces due to their favorable linear algebraic properties. However, common bases such as Fourier or wavelets are fixed and do…
We define and study analogues of exponentials for functions on noncommutative two-tori that depend on a choice of a complex structure. The major difference with the commutative case is that our noncommutative exponentials can be defined…
We generalize the embedding formalism for conformal field theories to the case of general operators with mixed symmetry. The index-free notation encoding symmetric tensors as polynomials in an auxiliary polarization vector is extended to…
Matrix coordinate transformations are defined as substitution operators without requiring an ordering prescription or an inclusion function from the Abelian coordinate transformations. We construct transforming objects mimicking most of the…
A modification of the symmetry approach for the classification of integrable differential-difference equations of the form $$ u_{n,t} = f_n(u_{n-1}, u_n, u_{n+1}), $$ where $n$ is a discrete integer variable, is presented (the well-known…
Let (\mathscr{F}) be the one dimensional Fourier-Plancherel operator and (E) be a subset of the real axis. The truncated Fourier operator is the operator (\mathscr{F}_E) of the form (\mathscr{F}_E=P_E\mathscr{F}P_E), where…
Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…
Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem. All lower bounds so far have made strong restrictions on the computational model.…
Electronic structure methods that exploit nonorthogonal Slater determinants face the challenge of efficiently computing nonorthogonal matrix elements. In a recent publication, H. G. A. Burton, J. Chem. Phys. 154, 144109 (2021), I introduced…
We analyze and test using Fourier extensions that minimize a Hilbert space norm for the purpose of solving partial differential equations (PDEs) on surfaces. In particular, we prove that the approach is arbitrarily high-order and also show…
We investigate the problem of constructing fault-tolerant bases in matroids. Given a matroid M and a redundancy parameter k, a k-fault-tolerant basis is a minimum-size set of elements such that, even after the removal of any k elements, the…