Unique Decomposition Research Articles

Amalgamated free product type III factors with at most one Cartan subalgebra

AbstractWe investigate Cartan subalgebras in nontracial amalgamated free product von Neumann algebras ${\mathop{M{}_{1} \ast }\nolimits}_{B} {M}_{2} $ over an amenable von Neumann subalgebra $B$. First, we settle the problem of the absence of Cartan subalgebra in arbitrary free product von Neumann algebras. Namely, we show that any nonamenable free product von Neumann algebra $({M}_{1} , {\varphi }_{1} )\ast ({M}_{2} , {\varphi }_{2} )$ with respect to faithful normal states has no Cartan subalgebra. This generalizes the tracial case that was established by A. Ioana [Cartan subalgebras of amalgamated free product ${\mathrm{II} }_{1} $factors, arXiv:1207.0054]. Next, we prove that any countable nonsingular ergodic equivalence relation $ \mathcal{R} $ defined on a standard measure space and which splits as the free product $ \mathcal{R} = { \mathcal{R} }_{1} \ast { \mathcal{R} }_{2} $ of recurrent subequivalence relations gives rise to a nonamenable factor $\mathrm{L} ( \mathcal{R} )$ with a unique Cartan subalgebra, up to unitary conjugacy. Finally, we prove unique Cartan decomposition for a class of group measure space factors ${\mathrm{L} }^{\infty } (X)\rtimes \Gamma $ arising from nonsingular free ergodic actions $\Gamma \curvearrowright (X, \mu )$ on standard measure spaces of amalgamated groups $\Gamma = {\mathop{\Gamma {}_{1} \ast }\nolimits}_{\Sigma } {\Gamma }_{2} $ over a finite subgroup $\Sigma $.

Unique prime decomposition results for factors coming from wreath product groups

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 product factors. We also obtain a similar result regarding measure equivalence decomposition of direct products of such groups.

Geometry for separable states and construction of entangled states with positive partial transposes

We construct faces of the convex set of all $2\otimes 4$ bipartite separable states, which are affinely isomorphic to the simplex $\Delta_{9}$ with ten extreme points. Every interior point of these faces is a separable state which has a unique decomposition into 10 product states, even though ranks of the state and its partial transpose are 5 and 7, respectively. We also note that the number 10 is greater than $2\times 4$, to disprove a conjecture on the lengths of qubit-qudit separable states. This face is inscribed in the corresponding face of the convex set of all PPT states so that sub-simplices $\Delta_k$ of $\Delta_{9}$ share the boundary if and only if $k\le 5$. This enables us to find a large class of $2\otimes 4$ PPT entangled edge states with rank five.

Paraunitary generation/correlation of QAM complementary sequence pairs

A unique decomposition of arbitrary pairs of complementary sequences (including standard binary, polyphase and QAM sequences as well as non-standard sequences and kernels) based on paraunitary matrices is presented. This decomposition allows us to describe the internal structure of any sequence pair of length L using basic paraunitary matrices defined by an ordered set of L complex coefficients named the omega vector. When the omega vector is sparse, the canonic form is compact and leads to an efficient implementation of a generator/correlator. We show that sequences generated by the standard algorithm have the sparsest known omega vector (log2 L non-zero elements out of L) and, thus, the most efficient generator/correlator. The equivalence of paraunitary matrices and Z transforms of complementary sequences allows us to apply the rich results from the theory of perfect reconstruction filter-banks to the field of sequence design. We introduce a new generator/correlator algorithm for sequences in standard and non-standard QAM constellations that is based on this equivalence. Both rectangular and hexagonal constellations are considered and the cardinality of the generated set of unique complementary sequences is either determined or estimated for a number of important cases. We show, in the case of the standard 16-QAM constellation, that the paraunitary algorithm generates the same number of sequences as the published algorithms based on generalized Boolean functions. In the case of 64-QAM, the proposed algorithm generates more sequences than known algorithms. We introduce an algorithm for generating 256-QAM sequences and derive a tight upper bound on the number of generated sequences.

Nonadiabatic electron response in the Hasegawa-Wakatani equations

Tokamak edge turbulence is strongly influenced by parallel electron physics, which relaxes density and potential fluctuations towards electron adiabatic response. Beginning with the paradigmatic Hasegawa-Wakatani equations (HWEs) for resistive tokamak edge turbulence, a unique decomposition of the electric potential (φ) into adiabatic (a) and nonadiabatic (b) portions is derived, based on the requirement that a neither drive nor respond to the parallel current j∥. The form of the decomposition clarifies that, at perpendicular scales large relative to the sound radius, the electron adiabatic response controls the nonzonal φ, not the fluctuating density n. Simple energy balance arguments allow one to rigorously bound the ratio of rms nonzonal nonadiabatic fluctuations (b̃) relative to adiabatic ones (ã). The role of the vorticity nonlinearity in transferring energy between adiabatic and nonadiabatic fluctuations aids intuitive understanding of self-sustained turbulence in the HWEs. When the normalized parallel resistivity is weak, b̃ becomes effectively slaved, allowing the reduction to an approximate one-field model that remains valid for strong turbulence. In addition to guiding physical intuition, the one-field reduction should greatly ease further analytical manipulations. Direct numerical simulation of the 2D HWEs confirms the convergence of the asymptotic formula for b̃.

Directed graphs, decompositions, and spatial linkages

The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into minimal strongly connected components (in the sense of directed graphs), or equivalently into minimal pinned isostatic graphs, which we call d-Assur graphs. We also study key properties of motions induced by removing an edge in a d-Assur graph — defining a sharper subclass of strongly d-Assur graphs by the property that all inner vertices go into motion, for each removed edge. The strongly 3-Assur graphs are the central building blocks for kinematic linkages in 3-space and the 3-Assur graphs are components in the analysis of built linkages. The d-Assur graphs share a number of key combinatorial and geometric properties with the 2-Assur graphs, including an associated lower block-triangular decomposition of the pinned rigidity matrix which provides modular information for extending the motion induced by inserting one driver in a bottom Assur linkage to the joints of the entire linkage. We also highlight some problems in combinatorial rigidity in higher dimensions (d≥3) which cause the distinction between d-Assur and strongly d-Assur which did not occur in the plane.

The Stationary Navier-Stokes System with No-Slip Boundary Condition on Polygons: Corner Singularity and Regularity

We study the stationary Navier-Stokes system with no-slip boundary condition on polygonal domains. Near each non-convex vertex the solution is shown solution. For showing the regularity we apply the Mellin transform to to have a unique decomposition by singular and regular parts. The singular part is defined by a linear combination of the corner singularity functions of the Stokes type and the regular part is shown to have the H 2 × H1-regularity. Precisely, near a non-convex vertex located at (0, 0), [u, p] = 𝒞1[Φ1, φ1] + 𝒞2[Φ2, φ2] + [u R , p R ], [u R , p R ] ∈ H s × H s−1 for s ∈ (λ2 + 1, 2], where Φ i = χ r λ i 𝒯 i (θ), φ i = χ r λ i −1ξ i (θ) with 1/2 < λ1 < λ2 < 1, χ is a smooth cutoff function, and 𝒞 i is the stress intensity factor. Hence the velocity vector is not Lipshitz continuous at non-convex vertices and the pressure value is infinite there. Also viscous stress tensor and vorticity values blow up near non-convex vertices.

Relating Deformation and Thermodynamics: An Opportunity for Rethinking Basic Concepts of Continuum Mechanics

In order to treat deformation as one of the processes taking place in an irreversible thermodynamic transformation, two main conditions must be satisfied: (1) strain and stress should be defined in such a way that the modification of the symmetry of these tensorial quantities reflects that of the structure of the actual material of which the deforming ideal continuum is the counterpart; and (2) the unique decomposition of the above tensors into the algebraic sum of an isotropic and an anisotropic part with different physical meanings should be recognized. The first condition allows the distinction of the energy balance in irrotational and rotational deformations; the second allows the description of a thermodynamic transformation involving deformation as a function of both process quantities, whose values depend on the specific transition, or path, between two equilibrium states, and of state quantities, which describe equilibrium states of a system quantitatively. One of the main conclusions that can be drawn is that, dealing with deformable materials, the quantities that must appear in thermodynamic equations cannot be tensorial quantities, such as the stress tensor and the infinitesimal or finite strain tensor usually considered in continuum mechanics (or, even worse, their components). The appropriate quantities should be invariants involved by the strain and stress tensors here defined. Another important conclusion is that, from a thermodynamic point of view, the consideration of the measurable volume change occurring in an isothermal deformation does not itself give any meaningful information.

Refined methods for the identifiability of tensors

We prove that the general tensor of size \(2^n\) and rank \(k\) has a unique decomposition as the sum of decomposable tensors if \(k\le 0.9997\frac{2^n}{n+1}\) (the constant 1 being the optimal value). Similarly, the general tensor of size \(3^n\) and rank \(k\) has a unique decomposition as the sum of decomposable tensors if \(k\le 0.998\frac{3^n}{2n+1}\) (the constant 1 being the optimal value). Some results of this flavor are obtained for tensors of any size, but the explicit bounds obtained are weaker.

On tractability of linear tensor product problems for [formula omitted]-variate classes of functions

We study tractability of linear tensor product problems defined on special Banach spaces of ∞-variate functions. In these spaces, functions have a unique decomposition f=∑ufu with fu∈Hu, where u are finite subsets of N+ and Hu are Hilbert spaces of functions with variables listed in u. The norm of f is defined by the ℓq norm of {γu−1‖fu‖Hu:u⊂N}, where γu’s are given weights and q∈[1,∞]. We derive sufficient and necessary conditions for the problem to be tractable. These conditions are expressed in terms of the properties of the weights γu, the value of q, and the complexity of the corresponding problem for univariate functions. The previous results were obtained only for the Hilbert case of q=2 and dealt with weighted integration and weighted L2-approximation.

Identification tree based on fragmentation rules for structure elucidation of organophosphorus esters by electrospray mass spectrometry

Organophosphorus compounds have played important roles as pesticides, chemical warfare agents and extractors of radioactive material. Structural elucidation of phosphonates poses a particular challenge because their initial forms can be hydrolyzed, thus, degradation products may predominate in samples acquired in the field. The analysis of non-volatile organophosphorus compounds and their degradation products is possible using electrospray tandem mass spectrometry ESI-MS/MS. Here, we present a generic strategy that allows the unambiguous identification of substituents for two families of organophosphorus compounds: the phosphonates and phosphates. General fragmentation rules were deduced based on the study of decomposition pathways of 55 organophosphorus esters, including examples found in the literature. Multistage MS (MS(n)) experiments at high resolution in a hybrid mass spectrometer provide accurate mass measurements, whereas collision-induced dissociation experiments in a triple quadrupole give access to small fragment ions. The creation of a specific nomenclature for each possible structure of organophosphorus compound, depending on the alkyl side chain linked to the oxygen, was achieved by applying these fragmentation rules. This led to the creation of an 'identification tree' based upon the unique consecutive decomposition pathways uncovered for each individual compound. Hence, seven structural motifs were created that orient an unequivocal identification using the 'identification tree'. Despite the similar structures of the ensemble of phosphate and phosphonate esters, distinct identifications based upon characteristic neutral losses and diagnostic fragment ions were possible in all cases.

Linear Coding Schemes for the Distributed Computation of Subspaces

Let $X_1, ..., X_m$ be a set of $m$ statistically dependent sources over the common alphabet $\mathbb{F}_q$, that are linearly independent when considered as functions over the sample space. We consider a distributed function computation setting in which the receiver is interested in the lossless computation of the elements of an $s$-dimensional subspace $W$ spanned by the elements of the row vector $[X_1, \ldots, X_m]\Gamma$ in which the $(m \times s)$ matrix $\Gamma$ has rank $s$. A sequence of three increasingly refined approaches is presented, all based on linear encoders. The first approach uses a common matrix to encode all the sources and a Korner-Marton like receiver to directly compute $W$. The second improves upon the first by showing that it is often more efficient to compute a carefully chosen superspace $U$ of $W$. The superspace is identified by showing that the joint distribution of the $\{X_i\}$ induces a unique decomposition of the set of all linear combinations of the $\{X_i\}$, into a chain of subspaces identified by a normalized measure of entropy. This subspace chain also suggests a third approach, one that employs nested codes. For any joint distribution of the $\{X_i\}$ and any $W$, the sum-rate of the nested code approach is no larger than that under the Slepian-Wolf (SW) approach. Under the SW approach, $W$ is computed by first recovering each of the $\{X_i\}$. For a large class of joint distributions and subspaces $W$, the nested code approach is shown to improve upon SW. Additionally, a class of source distributions and subspaces are identified, for which the nested-code approach is sum-rate optimal.

A generalized beam theory with shear deformation

A new formulation of the Generalized Beam Theory (GBT) that coherently accounts for shear deformation is presented in this paper. In particular, a modified formulation of the kinematics early proposed by Silvestre and Camotim for shear deformable GBT is devised. The new formulation, which preserves the general format of the original GBT for flexural modes, introduces the shear deformation along the wall thickness direction besides that along the wall midline, so guaranteeing a coherent matching between bending and shear strain components of the beam. According to the new kinematics, a reviewed form of the cross-section analysis procedure is devised, based on a unique modal decomposition for both flexural and shear modes. Much attention is posed on the mechanical interpretation of the deformation parameters in the modal space. It is shown that, in the modal space, it is possible to clearly distinguish bending deflections from deflections due to shearing strains, and to recover classical beam degrees of freedom and standard beam theories as special cases. The effectiveness of the proposed approach is illustrated on two typical benchmark problems.

BI-LEVEL CLASSIFICATION OF COLOR INDEXED IMAGE HISTOGRAMS FOR CONTENT BASED IMAGE RETRIEVAL

This dissertation proposes content based image classification and retrieval with Classification and Regression Tree (CART). A simple CBIR system (WH) is designed and proved to be efficient even in the presence of distorted and noisy images. WH exhibits good performance in terms of precision, without using any intensive image processing feature extraction techniques. Unique indexed color histogram and wavelet decomposition based horizontal, vertical and diagonal image attributes have been chosen as the primary attributes in the design of the retrieval system. The output feature vectors of the WH method serve as input to the proposed decision tree based image classification and retrieval system. The performance of the proposed content based image classification and retrieval system is evaluated with the standard SIMPLIcity dataset which has been used in several previous works. The performance of the system is measured with precision as the metric. Holdout validation and k-fold cross validation are used to validate the results. The proposed system performs obviously better than SIMPLIcity and all the other compared methods.

Dinucleotide Circular Codes

We begin here a combinatorial study of dinucleotide circular codes. A word written on a circle is called circular. A set of dinucleotides is a circular code if all circular words constructed with this set have a unique decomposition. Propositions based on a letter necklace allow to determine the 24 maximum dinucleotide circular codes (of 6 elements). A partition property is also identified with eight self-complementary maximum dinucleotide circular codes and two classes of eight maximum dinucleotide circular codes in bijective correspondence by the complementarity map.

Unique Cartan decomposition for II 1 factors arising from arbitrary actions of hyperbolic groups

Abstract We prove that for any free ergodic probability measure preserving action Γ → ( X , μ ) $\Gamma \rightarrow (X,\mu )$ of a non-elementary hyperbolic group, or a lattice in a rank one simple Lie group, the associated group measure space II 1 factor L ∞ ( X ) ⋊ Γ ${\mathord {\text{\rm L}}^\infty (X) \rtimes \Gamma }$ has L ∞ ( X ) ${\mathord {\text{\rm L}}^\infty (X)}$ as its unique Cartan subalgebra, up to unitary conjugacy.

Algebraic properties of L-fuzzy finite automata

Fuzzy automata theory on lattice-ordered monoids was introduced by Li and Pedrycz. Dropping the distributive laws, fuzzy finite automata (L-FFAs for short) based on a more generalized structure L, named a po-monoid, are presented and investigated from the view of algebra in this paper. The notions of (strong) successor and source operators, fuzzy successor and source operators which are shown to be closure operators on certain conditions are introduced and discussed in detail. Using the weak primary submachines, a unique decomposition theorem of a fuzzy finite automaton based on a lattice-ordered monoid is obtained. Taking L as a quantale, fuzzy subsystems are proved to be the same as fuzzy submachines of an L-FFA. In particular, intrinsic connections between algebraic properties of L and properties of some operators of an L-FFA are discovered. It is shown that the join-preserving property of fuzzy successor and source operators can be fully characterized by the right and left distributive laws respectively, and the idempotence of successor operator can be characterized equivalently by the nonexistence of zero divisors when L is a lattice-ordered monoid.

Type III factors with unique Cartan decomposition

We prove that for any free ergodic nonsingular nonamenable action Γ↷(X,μ) of all Γ in a large class of groups including all hyperbolic groups, the associated group measure space von Neumann algebra L∞(X)⋊Γ has L∞(X) as its unique Cartan subalgebra, up to unitary conjugacy. This generalizes the probability measure preserving case that was established in Popa and Vaes (in press) [38]. We also prove primeness and indecomposability results for such crossed products, for the corresponding orbit equivalence relations and for arbitrary amalgamated free products M1⁎BM2 over a subalgebra B of type I.

Standard Linear Combination of Incline Vectors

We prove that every finite subspace generated by the linearly ordered idempotent elements in an incline has a unique standard This leads to every finite subspace of a regular incline whose elements are all linearly ordered has a unique standard basis and thereby we disprove the result of Cao that is Every subspace of a finite incline whose idempotent elements are linearly ordered has a unique standard basis. As an application we exhibit that under certain conditions each vector in a finitely generated subspace of a vector space has a unique decomposition as a linear combination of the standard basis vectors. Keywords:incline, regular incline, distributive lattice, basis, standard basis, standard linear combination.

Unique decomposition for a polynomial of low rank

Let $F$ be a homogeneous polynomial of degree $d$ in $m+1$ variables defined over an algebraically closed field of characteristic 0 and suppose that $F$ belongs to the $s$-th secant variety of the $d$-uple Veronese embedding of $\mathbb{P}^m$ into $ \PP {{m+d\choose d}-1}$ but that its minimal decomposition as a sum of $d$-th powers of linear forms requires more than $s$ addenda. We show that if $s\leq d$ then $F$ can be uniquely written as $F=M_1^d+\cdots + M_t^d+Q$, where $M_1, \ldots, M_t$ are linear forms with $t\leq (d-1)/2$, and $Q$ a binary form such that $Q=\sum_{i=1}^q l_i^{d-d_i}m_i$ with $l_i$'s linear forms and $m_i$'s forms of degree $d_i$ such that $\sum (d_i+1)=s-t$.