Symmetric tensor decomposition

We present an algorithm for decomposing a symmetric tensor, of dimension n and order d as a sum of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for binary forms. We recall the correspondence between the decomposition of a homogeneous polynomial in n variables of total degree d as a sum of powers of linear forms (Waring's problem), incidence properties on secant varieties of the Veronese Variety and the representation of linear forms as a linear combination of evaluations at distinct points. Then we reformulate Sylvester's approach from the dual point of view. Exploiting this duality, we propose necessary and sufficient conditions for the existence of such a decomposition of a given rank, using the properties of Hankel (and quasi-Hankel) matrices, derived from multivariate polynomials and normal form computations. This leads to the resolution of polynomial equations of small degree in non-generic cases. We propose a new algorithm for symmetric tensor decomposition, based on this characterization and on linear algebra computations with these Hankel matrices. The impact of this contribution is two-fold. First it permits an efficient computation of the decomposition of any tensor of sub-generic rank, as opposed to widely used iterative algorithms with unproved global convergence (e.g. Alternate Least Squares or gradient descents). Second, it gives tools for understanding uniqueness conditions, and for detecting the rank

The BCS-Bose Crossover Theory

We contrast {\it four} distinct versions of the BCS-Bose statistical crossover theory according to the form assumed for the electron-number equation that accompanies the BCS gap equation. The four versions correspond to explicitly accounting for two-hole-(2h) as well as two-electron-(2e) Cooper pairs (CPs), or both in equal proportions, or only either kind. This follows from a recent generalization of the Bose-Einstein condensation (GBEC) statistical theory that includes not boson-boson interactions but rather 2e- and also (without loss of generality) 2h-CPs interacting with unpaired electrons and holes in a single-band model that is easily converted into a two-band model. The GBEC theory is essentially an extension of the Friedberg-T.D. Lee 1989 BEC theory of superconductors that excludes 2h-CPs. It can thus recover, when the numbers of 2h- and 2e-CPs in both BE-condensed and noncondensed states are separately equal, the BCS gap equation for all temperatures and couplings as well as the zero-temperature BCS (rigorous-upper-bound) condensation energy for all couplings. But ignoring either 2h- {\it or} 2e-CPs it can do neither. In particular, only {\it half} the BCS condensation energy is obtained in the two crossover versions ignoring either kind of CPs. We show how critical temperatures $T_{c}$ from the original BCS-Bose crossover theory in 2D require unphysically large couplings for the Cooper/BCS model interaction to differ significantly from the $T_{c}$s of ordinary BCS theory (where the number equation is substituted by the assumption that the chemical potential equals the Fermi energy).Comment: thirteen pages including two figures. Physica C (in press, 2007

On Commutation and Conjugacy of Rational Languages and the Fixed Point Method

The research on language equations has been active during last decades. Compared to the equations on words the equations on languages are much more difficult to solve. Even very simple equations that are easy to solve for words can be very hard for languages. In this thesis we study two of such equations, namely commutation and conjugacy equations. We study these equations on some limited special cases and compare some of these results to the solutions of corresponding equations on words. For both equations we study the maximal solutions, the centralizer and the conjugator. We present a fixed point method that we can use to search these maximal solutions and analyze the reasons why this method is not successful for all languages. We give also several examples to illustrate the behaviour of this method.Siirretty Doriast

Combinatorics on Words. New Aspects on Avoidability, Defect Effect, Equations and Palindromes

In this thesis we examine four well-known and traditional concepts of combinatorics on words. However the contexts in which these topics are treated are not the traditional ones. More precisely, the question of avoidability is asked, for example, in terms of k-abelian squares. Two words are said to be k-abelian equivalent if they have the same number of occurrences of each factor up to length k. Consequently, k-abelian equivalence can be seen as a sharpening of abelian equivalence. This fairly new concept is discussed broader than the other topics of this thesis. The second main subject concerns the defect property. The defect theorem is a well-known result for words. We will analyze the property, for example, among the sets of 2-dimensional words, i.e., polyominoes composed of labelled unit squares. From the defect effect we move to equations. We will use a special way to define a product operation for words and then solve a few basic equations over constructed partial semigroup. We will also consider the satisfiability question and the compactness property with respect to this kind of equations. The final topic of the thesis deals with palindromes. Some finite words, including all binary words, are uniquely determined up to word isomorphism by the position and length of some of its palindromic factors. The famous Thue-Morse word has the property that for each positive integer n, there exists a factor which cannot be generated by fewer than n palindromes. We prove that in general, every non ultimately periodic word contains a factor which cannot be generated by fewer than 3 palindromes, and we obtain a classification of those binary words each of whose factors are generated by at most 3 palindromes. Surprisingly these words are related to another much studied set of words, Sturmian words.Siirretty Doriast

Representations and Properties of Generalized ArA_r Statistics, Coherent States and Robertson Uncertainty Relations

The generalization of $A_r$ statistics, including bosonic and fermionic sectors, is performed by means of the so-called Jacobson generators. The corresponding Fock spaces are constructed. The Bargmann representations are also considered. For the bosonic $A_r$ statistics, two inequivalent Bargmann realizations are developed. The first (resp. second) realization induces, in a natural way, coherent states recognized as Gazeau-Klauder (resp. Klauder-Perelomov) ones. In the fermionic case, the Bargamnn realization leads to the Klauder-Perelomov coherent states. For each considered realization, the inner product of two analytic functions is defined in respect to a measure explicitly computed. The Jacobson generators are realized as differential operators. It is shown that the obtained coherent states minimize the Robertson-Schr\"odinger uncertainty relation.Comment: 16 pages, published in JP