Related papers: Computing the Dimension of a Bipartition Matrix
This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…
In this paper, we study the fractal dimension of the graph of a fractal transformation and also determine the quantization dimension of a probability measure supported on the graph of the fractal transformation. Moreover, we estimate the…
An algorithm is developed to compute the complete CS decomposition (CSD) of a partitioned unitary matrix. Although the existence of the CSD has been recognized since 1977, prior algorithms compute only a reduced version (the 2-by-1 CSD)…
The phenomena that cause a value of a polynomial function to be a bifurcation one are yet to be described when the fibers have dimension higher than $1$. In this note, the main result is the construction of a polynomial submersion function…
Four-dimensional renormalized (FDR) integrals play an increasingly important role in perturbative loop calculations. Thanks to them, loop computations can be performed directly in four dimensions and with no ultraviolet (UV) counterterms.…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
This chapter explores the notion of "dimension" of a set. Various power laws by which an Euclidean space can be characterized are used to define dimensions, which then explore different aspects of the set. Also discussed are the…
We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…
For a finite partially ordered set we calculate the dimension of the variety of its subspace representations having fixed dimension vector. The dimension is given in terms of the Euler quadratic form associated with a partially ordered set,…
For finite-dimensional bipartite quantum systems, we find the exact size of the largest balls, in spectral $l_p$ norms for $1 \le p \le \infty$, of separable (unentangled) matrices around the identity matrix. This implies a simple and…
Let $V$ be a vector space with countable dimension over a field, and let $u$ be an endomorphism of it which is locally finite, i.e. $(u^k(x))_{k \geq 0}$ is linearly dependent for all $x$ in $V$. We give several necessary and sufficient…
The so-called permutation separability criteria are simple operational conditions that are necessary for separability of mixed states of multipartite systems: (1) permute the indices of the density matrix and (2) check if the trace norm of…
For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…
In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…
The VC-dimension of a family of sets is a measure of its combinatorial complexity used in machine learning theory, computational geometry, and even model theory. Computing the VC-dimension of the $k$-fold union of geometric set systems has…
Two-body decays of B mesons are studied by decomposing their amplitude into a sum of factorizable and non-factorizable ones. The former is estimated by using the naive factorization while the latter is calculated by using a hard pion (or…
Polarizability is a key response property of physical and chemical systems, which has an impact on intermolecular interactions, spectroscopic observables, and vacuum polarization. The calculation of polarizability for quantum systems…
Birkhoff polytope is the set of all bistochastic matrices (also known as doubly stochastic matrices). Bistochastic matrices form a special class of stochastic matrices where each row and column sums up to one. Permutation matrices and…
A vertex set $U \subseteq V$ of an undirected graph $G=(V,E)$ is a $\textit{resolving set}$ for $G$, if for every two distinct vertices $u,v \in V$ there is a vertex $w \in U$ such that the distances between $u$ and $w$ and the distance…
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…