Orthogonal and unitary tensor decomposition from an algebraic perspective

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention from theoretical computer science and scientific computing. We complement this existing body of literature with an algebro-geometric analysis of the set of orthogonally decomposable tensors.More specifically, we prove that they form a real-algebraic variety defined by polynomials of degree at most four. The exact degrees, and the corresponding polynomials, are different in each of three times two scenarios: ordinary, symmetric, or alternating tensors; and real-orthogonal versus complex-unitary. A key feature of our approach is a surprising connection between orthogonally decomposable tensors and semisimple algebras—associative in the ordinary and symmetric settings and of compact Lie type in the alternating setting.     

Approximation by Shepard type pseudo-linear operators and applications to Image Processing

Recently, it has been shown that sum and product are not the only operations that can be used in order to define concrete approximation operators. Several other operations provided by fuzzy sets theory can be used. In the present paper, pseudo-linear approximation operators are investigated from the practical point of view in Image Processing. We study max–min, max–product Shepard type approximation operators together with Shepard operators based on pseudo-operations generated by an increasing continuous generator. It is shown that in several cases these outperform classical approximation operators based on sum and product operations.     

On Incidence Algebras of Combinatorial Inverse Monoids

We study the incidence algebra of the reduced standard division category of a combinatorial bisimple inverse monoid [with (E(S), ≤) locally finite], and we describe semigroups of poset type (i.e., a combinatorial inverse semigroup for which the corresponding Möbius category is a poset) as being combinatorial strict inverse semigroups. Up to isomorphism, the only Möbius-division categories are the reduced standard division categories of combinatorial inverse monoids.     

Designing of dipeptide‐based oligoconjugates as potential carrier for drug delivery. Pyroglutamil‐S‐glutamic acid bisoligo‐3‐hydroxybutyrates

In the present article, we describe the synthesis and characterization of conjugates based on pyroglutamyl‐S‐glutamic acid and bisoligo‐[R,S]‐3‐hydroxybutyrates (PyGlu‐S_‐Glu_bisOHB) using anionic ring opening polymerization of β‐butyrolactone with a dipeptide bearing two carboxylate groups as potassium salt. The results indicated that the above‐mentioned reaction is accompanied of oligomerization of β‐butyrolactone yielding (3‐hydroxybutyrates) oligomers with crotonate and carboxyl end groups. We report also the end group analysis of the synthesized conjugates using electrospray ionization tandem mass spectrometry (ESI‐MS), the latter confirmed the presence of a mixture of dipeptide conjugate with β‐butyrolactone oligomer chain and β‐butyrolactone homopolymer. © 2008 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 46: 4103–4111, 2008     

Predicting air quality: Improvements through advanced methods to integrate models and measurements

Air quality prediction plays an important role in the management of our environment. Computational power and efficiencies have advanced to the point where chemical transport models can predict pollution in an urban air shed with spatial resolution less than a kilometer, and cover the globe with a horizontal resolution of less than 50 km. Predicting air quality remains a challenge due to the complexity of the governing processes and the strong coupling across scales. While air quality prediction is closely aligned with weather prediction, there are important differences, including the role of pollution emissions and their associated large uncertainties. Improvements in air quality prediction require a close integration of observations. As more atmospheric chemical observations become available chemical data assimilation is expected to play an essential role in air quality forecasting. In this paper advances in air quality forecasting are discussed with an emphasis on data assimilation. Applications of the four-dimensional variational method (4D-Var) and the ensemble Kalman filter (EnKF) approach are presented and the computation challenges are discussed.     

On graded nil clean rings

In this paper we introduce and study the notion of a graded (strongly) nil clean ring which is group graded. We also deal with extensions of graded (strongly) nil clean rings to graded matrix rings and to graded group rings. The question of when nil cleanness of the component, which corresponds to the neutral element of a group, implies graded nil cleanness of the whole graded ring is examined. Similar question is discussed in the case of groupoid graded rings as well.     

A converse to the Eidelheit theorem in real Hilbert spaces

We establish the following converse to the Eidelheit theorem: an unbounded closed and convex set of a real Hilbert space may be separated by a closed hyperplane from every other disjoint closed and convex set, if and only if it has a finite codimension and a non-empty interior with respect to its affine hull.     

Lattices on simplicial partitions

In this paper, (d+1)-pencil lattices on simplicial partitions in R^d are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition, providing a continuous piecewise polynomial interpolant over the extended lattice. The number of degrees of freedom is equal to the number of vertices of the simplicial partition. The constructive proof of this fact leads to an efficient computer algorithm for the design of a lattice.     

Classification of Sol lattices

Sol geometry is one of the eight homogeneous Thurston 3-geometries $${\bf E}^{3}, {\bf S}^{3}, {\bf H}^{3}, {\bf S}^{2}\times{\bf R}, {\bf H}^{2}\times{\bf R}, \widetilde{{\bf SL}_{2}{\bf R}}, {\bf Nil}, {\bf Sol}.$$ In [13] the densest lattice-like translation ball packings to a type (type I/1 in this paper) of Sol lattices has been determined. Some basic concept of Sol were defined by Scott in [10], in general. In our present work we shall classify Sol lattices in an algorithmic way into 17 (seventeen) types, in analogy of the 14 Bravais types of the Euclidean 3-lattices, but infinitely many Sol affine equivalence classes, in each type. Then the discrete isometry groups of compact fundamental domain (crystallographic groups) can also be classified into infinitely many classes but finitely many types, left to other publication. To this we shall study relations between Sol lattices and lattices of the pseudoeuclidean (or here rather called Minkowskian) plane [1]. Moreover, we introduce the notion of Sol parallelepiped to every lattice type. From our new results we emphasize Theorems 3?C6. In this paper we shall use the affine model of Sol space through affine-projective homogeneous coordinates [6] which gives a unified way of investigating and visualizing homogeneous spaces, in general.