Related papers: Exact ReLU realization of tensor-product refinemen…
The proposed two-dimensional geometrically exact beam element extends our previous work by including the effects of shear distortion, and also of distributed forces and moments acting along the beam. The general flexibility-based…
We use malleable deformations combined with spectral gap rigidity theory, in the framework of Popa's deformation/rigidity theory to prove unique tensor product decomposition results for II$_1$ factors arising as tensor product of wreath…
A fully threaded tree (FTT) for adaptive refinement of regular meshes is described. By using a tree threaded at all levels, tree traversals for finding nearest neighbors are avoided. All operations on a tree including tree modifications are…
We study the computation complexity of deep ReLU (Rectified Linear Unit) neural networks for the approximation of functions from the H\"older-Zygmund space of mixed smoothness defined on the $d$-dimensional unit cube when the dimension $d$…
Due to the explosive growth of large-scale data sets, tensors have been a vital tool to analyze and process high-dimensional data. Different from the matrix case, tensor decomposition has been defined in various formats, which can be…
We define refined invariants which "count" nodal curves in sufficiently ample linear systems on surfaces, conjecture that their generating function is multiplicative, and conjecture explicit formulas in the case of K3 and abelian surfaces.…
We study products of random matrices in the regime where the number of terms and the size of the matrices simultaneously tend to infinity. Our main theorem is that the logarithm of the $\ell_2$ norm of such a product applied to any fixed…
Let G be a classical compact Lie group and G_\mu the associated compact matrix quantum group deformed by a positive parameter \mu (or a nonzero and real \mu in the type A case). It is well known that the category Rep(G_\mu) of unitary f.d.…
We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes our method exploits…
We consider extensions of non-singular maps which are exact, respectively K-mixing, or at least have a decomposition into positive-measure exact, respectively K-mixing, components. The fibers of the extension spaces have countable (finite…
We study the exact controllability, by a reduced number of controls, of coupled cascade systems of PDE's and the existence of exact insensitizing controls for the scalar wave equation. We give a necessary and sufficient condition for the…
New families of algebras and DG algebras with two simple modules are introduced and described. Using the twisted tensor product operation, we prove that such algebras have finite global dimension, and the resulting DG algebras are smooth.…
Relying on the co-area formula, an exact relaxation framework for minimizing objectives involving the total variation of a binary valued function (of bounded variation) is presented. The underlying problem class covers many important…
Kang et al. provided a path realization of the crystal graph of a highest weight module over a quantum affine algebra, as certain semi-infinite tensor products of a single perfect crystal. In this paper, this result is generalized to give a…
We construct projective covers of irreducible V-modules in the category of grading-restricted generalized V-modules when V is a vertex operator algebra satisfying the following conditions: 1. V is C_{1}-cofinite in the sense of Li. 2. There…
The hierarchical matrix framework partitions matrices into subblocks that are either small or of low numerical rank, enabling linear storage complexity and efficient matrix-vector multiplication. This work focuses on the $H^2$-matrix format…
Verification of neural networks enables us to gauge their robustness against adversarial attacks. Verification algorithms fall into two categories: exact verifiers that run in exponential time and relaxed verifiers that are efficient but…
In this paper, we develop a novel framework, Exact Bilinearization Iterative Form (EBIF), for transforming a nonlinear control-affine system into an exact finite-dimensional bilinear representation. In contrast to most existing approaches…
We consider convex relaxations for recovering low-rank tensors based on constrained minimization over a ball induced by the tensor nuclear norm, recently introduced in \cite{tensor_tSVD}. We build on a recent line of results that considered…
In this work, merging ideas from compatible discretisations and polyhedral methods, we construct novel fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra. The spaces and operators that appear in these…