Results 1 to 10 of about 1,406,601 (220)
Canonical Agler decompositions and transfer function realizations [PDF]
Transactions of the American Mathematical Society, 2016 A seminal result of Agler proves that the natural de Branges-Rovnyak kernel function associated to a bounded analytic function on the bidisk can be decomposed into two shift-invariant pieces.
Kelly Bickel, Greg Knese
semanticscholar +8 more sources
Canonical decompositions of 3-connected graphs [PDF]
Advances in Combinatorics, 2023 We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or obtained from a biclique by turning one side into a triangle.
J. Carmesin, Jan Kurkofka
semanticscholar +3 more sources
Dictionary-Based Tensor Canonical Polyadic Decomposition [PDF]
IEEE Transactions on Signal Processing, 2017 To ensure interpretability of extracted sources in tensor decomposition, we introduce in this paper a dictionary-based tensor canonical polyadic decomposition which enforces one factor to belong exactly to a known dictionary. A new formulation of sparse coding is proposed which enables high dimensional tensors dictionary-based canonical polyadic ...
Jérémy E. Cohen, Nicolas Gillis
openalex +5 more sources
DCID: Deep Canonical Information Decomposition [PDF]
, 2023 We consider the problem of identifying the signal shared between two one-dimensional target variables, in the presence of additional multivariate observations. Canonical Correlation Analysis (CCA)-based methods have traditionally been used to identify shared variables, however, they were designed for multivariate targets and only offer trivial ...
Alexander Rakowski, Christoph Lippert
openalex +3 more sources
Canonical Polyadic Decomposition via the generalized Schur decomposition [PDF]
IEEE Signal Processing Letters, 2022 5 ...
Eric Evert +2 more
openalex +4 more sources
Canonical trees of tree-decompositions [PDF]
Journal of Combinatorial Theory, Series B, 2020 We prove that every graph has a canonical tree of tree-decompositions that distinguishes all principal tangles (these include the ends and various kinds of large finite dense structures) efficiently.
J. Carmesin, M. Hamann, Babak Miraftab
semanticscholar +4 more sources
Canonical decompositions of 3–manifolds [PDF]
Geometry & Topology, 1997 We describe a new approach to the canonical decompositions of 3{manifolds along tori and annuli due to Jaco{Shalen and Johannson (with ideas from Waldhausen) | the so-called JSJ{decomposition theorem.
W. Neumann, G. Swarup
semanticscholar +6 more sources
Binomial Canonical Decompositions of Binomial Ideals [PDF]
Communications in Algebra, 2010 In this article, we prove that every binomial ideal in a polynomial ring over an algebraically closed field of characteristic zero admits a canonical primary decomposition into binomial ideals.
I. Ojeda
semanticscholar +4 more sources
Spectral Decompositions of Gramians of Continuous Stationary Systems Given by Equations of State in Canonical Forms [PDF]
Mathematics, 2022 The application of transformations of the state equations of continuous linear and bilinear systems to the canonical form of controllability allows one to simplify the computation of Gramians of these systems.
Igor Yadykin
doaj +2 more sources
Time reversal and n-qubit canonical decompositions [PDF]
Journal of Mathematical Physics, 2004 On pure states of n quantum bits, the concurrence entanglement monotone returns the norm of the inner product of a pure state with its spin-flip. The monotone vanishes for n odd, but for n even there is an explicit formula for its value on mixed states ...
S. Bullock, G. Brennen, D. O’Leary
semanticscholar +5 more sources