Related papers: On the decomposition of k-valued rational relation…

Let $k$ be a discretely valued non-Archimedean field. We give an explicit description of analytic functions whose norm is bounded by a given real number $r$ on tubes of reduced $k$-analytic spaces associated to special formal schemes (those…

Let $(K,\mathcal O,k)$ be a $p$-modular system and assume $k$ is algebraically closed. We show that if $\Lambda$ is an $\mathcal O$-order in a separable $K$-algebra, then $\textrm{Pic}_{\mathcal O}(\Lambda)$ carries the structure of an…

The Waring Problem over polynomial rings asks for how to decompose an homogeneous polynomial of degree $d$ as a finite sum of $d^{th}$ powers of linear forms. First, we give a constructive method to obtain a real Waring decomposition of any…

We describe a way to represent computable functions between coinductive types as particular transducers in type theory. This generalizes earlier work on functions between streams by P. Hancock to a much richer class of coinductive types.…

The main object of this work is to show how some rather elementary techniques based upon certain inverse pairs of symbolic operators would lead us easily to several decomposition formulas associated with confluent hypergeometric functions…

Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the…

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

Decomposition complexity for metric spaces was recently introduced by Guentner, Tessera, and Yu as a natural generalization of asymptotic dimension. We prove a vanishing result for the continuously controlled algebraic K-theory of bounded…

We use classical results from the theory of linear preserver problems to characterize operators that send the set of pure states with Schmidt rank no greater than k back into itself, extending known results characterizing operators that…

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…

This paper investigates an iterative rank-one decomposition scheme for positive operators on a Hilbert space based on a residual-weighted congruence update. At each step the operator is compressed along a chosen unit vector while remaining…

Transformers are widely used across data modalities, and yet the principles distilled from text models often transfer imperfectly to models trained to other modalities. In this paper, we analyze Transformers through the lens of rank…

Tensor decomposition of high-dimensional data often struggles to capture semantically or physically meaningful structures, particularly when relying on reconstruction objectives and fixed-rank constraints. We introduce a no-rank tensor…

We relate a classic algebro-geometric degeneration technique, dating at least to [Hodge 1941], to the notion of vertex decompositions of simplicial complexes. The good case is when the degeneration is reduced, and we call this a "geometric…

We give a simplified exposition of Kummert's approach to proving that every matrix-valued rational inner function in two variables has a minimal unitary transfer function realization. A slight modification of the approach extends to…

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Three canonical decompositions concerning commuting pair of isometries, power partial isometries, and contractions are reassessed. They have already been proved in von Neumann algebras. In the corresponding proofs, both norm and weak…

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…

Tucker decomposition is the cornerstone of modern machine learning on tensorial data analysis, which have attracted considerable attention for multiway feature extraction, compressive sensing, and tensor completion. The most challenging…

We study rank-1 {L1-norm-based TUCKER2} (L1-TUCKER2) decomposition of 3-way tensors, treated as a collection of $N$ $D \times M$ matrices that are to be jointly decomposed. Our contributions are as follows. i) We prove that the problem is…