Related papers: Low-energy decomposition results over finite field…
One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…
Problems with sign-changing coefficients occur, for instance, in the study of transmission problems with metamaterials. In this work, we present and analyze a generalized finite element method in the spirit of the Localized Orthogonal…
We identify a new way to divide the $\delta$-neighborhood of surfaces $\mathcal{M}\subset\mathbb{R}^3$ into a finitely-overlapping collection of rectangular boxes $S$. We obtain a sharp $(l^2,L^p)$ decoupling estimate using this…
Given a finite irreducible Coxeter group $W$, a positive integer $d$, and types $T_1,T_2,...,T_d$ (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions $c=\si_1\si_2 cdots\si_d$ of a Coxeter…
Let $K$ be a finite extension of the field $\mathbb{Q}_p$ of $p$-adic numbers and $\O$ be its integral ring. The convergent power series with coefficients in $\O$ are studied as dynamical systems on $\O$. A minimal decomposition theorem for…
The present paper is devoted to a theory of profile decomposition for bounded sequences in \emph{homogeneous} Sobolev spaces, and it enables us to analyze the lack of compactness of bounded sequences. For every bounded sequence in…
Given a sequence of oriented links L^1,L^2,L^3,... each of which has a distinguished, unknotted component, there is a decomposition of the 3-sphere naturally associated to it, which is constructed as the components of the intersection of an…
We outline a partial-fractions decomposition method for determining the one-particle spectral function and single-particle density of states of a correlated electronic system on a finite lattice in the non self-consistent T-matrix…
This chapter studies the problem of decomposing a tensor into a sum of constituent rank one tensors. While tensor decompositions are very useful in designing learning algorithms and data analysis, they are NP-hard in the worst-case. We will…
It was recently observed that chiral two-body interactions can be efficiently represented using matrix factorization techniques such as the singular value decomposition. However, the exploitation of these low-rank structures in a few- or…
We begin by showing that any $n \times n$ matrix can be decomposed into a sum of $n$ circulant matrices with periodic relaxations on the unit circle. This decomposition is orthogonal with respect to a Frobenius inner product, allowing…
The o-minimal structure generated by the restricted Pfaffian functions, known as restricted sub-Pfaffian sets, admits a natural measure of complexity in terms of a format $\mathcal{F}$, recording information like the number of variables and…
In many models for large-scale computation, decomposition of the problem is key to efficient algorithms. For distance-related graph problems, it is often crucial that such a decomposition results in clusters of small diameter, while the…
We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on $n$-vertex graphs are not the…
To every regular category $\mathcal{A}$ equipped with a degree function $\delta$ one can attach a pseudo-abelian tensor category $\mathcal{T}(\mathcal{A},\delta)$. We show that the generating objects of $\mathcal{T}$ decompose canonically…
Consider the triplet $(E, \mathcal{P}, \pi)$, where $E$ is a finite ground set, $\mathcal{P} \subseteq 2^E$ is a collection of subsets of $E$ and $\pi : \mathcal{P} \rightarrow [0,1]$ is a requirement function. Given a vector of marginals…
Semidefinite programs (SDPs) are standard convex problems that are frequently found in control and optimization applications. Interior-point methods can solve SDPs in polynomial time up to arbitrary accuracy, but scale poorly as the size of…
Given $d,s \in \mathbb{N}$, a finite set $A \subseteq \mathbb{Z}$ and polynomials $\varphi_1, \dots, \varphi_{s} \in \mathbb{Z}[x]$ such that $1 \leq deg \varphi_i \leq d$ for every $1 \leq i \leq s$, we prove that \[ |A^{(s)}| +…
AGT relations imply that the four-point conformal block admits a decomposition into a sum over pairs of Young diagrams of essentially rational Nekrasov functions - this is immediately seen when conformal block is represented in the form of…
Given $d,n \in \mathbb{N}$, we write a polynomial $F \in \mathbb{C}[x_1,\dots,x_n]$ to be degenerate if there exist $P\in \mathbb{C}[y_1, \dots, y_{n-1}]$ and $m_j = x_1^{v_{j,1}}\dots x_n^{v_{j,n}}$ with $v_{j,1}, \dots, v_{j,n} \in…