Simple derivation of general Fierz-type identities

General Fierz-type identities are examined and their well-known connection with completeness relations in matrix vector spaces is shown. In particular, I derive the chiral Fierz identities in a simple and systematic way by using a chiral basis for the complex 4 X 4 matrices. Other completeness relations for the fundamental representations of SU(N) algebras can be extracted using the same reasoning. (c) 2005 American Association of Physics Teachers.

Resonant (P+RES) controller applied to voltage source inverter with minimum DC link capacitor

Voltage source inverters use large electrolytic capacitors in order to decouple the energy between the utility and the load, keeping the DC link voltage constant. Decreasing the capacitance reduces the distortion in the inverter input current but this also affects the load with low-order harmonics and generate disturbances at the input voltage. This paper applies the P+RES controller to solve the challenge of regulating the output current by means of controlling the magnitude of the current space vector, keeping it constant thus rejecting harmonic disturbances that would otherwise propagate to the load. This work presents a discussion of the switching and control strategy. © 2011 IEEE.

Improving image classification through descriptor combination

The efficiency in image classification tasks can be improved using combined information provided by several sources, such as shape, color, and texture visual properties. Although many works proposed to combine different feature vectors, we model the descriptor combination as an optimization problem to be addressed by evolutionary-based techniques, which compute distances between samples that maximize their separability in the feature space. The robustness of the proposed technique is assessed by the Optimum-Path Forest classifier. Experiments showed that the proposed methodology can outperform individual information provided by single descriptors in well-known public datasets. © 2012 IEEE.

Classificação de cônicas e quádricas

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Logarithmically smooth deformations of strict normal crossing logarithmically symplectic varieties

In this thesis we give a definition of the term logarithmically symplectic variety; to be precise, we distinguish even two types of such varieties. The general type is a triple $(f,nabla,omega)$ comprising a log smooth morphism $fcolon Xtomathrm{Spec}kappa$ of log schemes together with a flat log connection $nablacolon LtoOmega^1_fotimes L$ and a ($nabla$-closed) log symplectic form $omegainGamma(X,Omega^2_fotimes L)$. We define the functor of log Artin rings of log smooth deformations of such varieties $(f,nabla,omega)$ and calculate its obstruction theory, which turns out to be given by the vector spaces $H^i(X,B^bullet_{(f,nabla)}(omega))$, $i=0,1,2$. Here $B^bullet_{(f,nabla)}(omega)$ is the class of a certain complex of $mathcal{O}_X$-modules in the derived category $mathrm{D}(X/kappa)$ associated to the log symplectic form $omega$. The main results state that under certain conditions a log symplectic variety can, by a flat deformation, be smoothed to a symplectic variety in the usual sense. This may provide a new approach to the construction of new examples of irreducible symplectic manifolds.

On some solutions of a functional equation related to the partial sums of the Riemann zeta function

In this paper, we prove that infinite-dimensional vector spaces of α-dense curves are generated by means of the functional equations f(x)+f(2x)+⋯+f(nx)=0, with n≥2, which are related to the partial sums of the Riemann zeta function. These curves α-densify a large class of compact sets of the plane for arbitrary small α, extending the known result that this holds for the cases n=2,3. Finally, we prove the existence of a family of solutions of such functional equation which has the property of quadrature in the compact that densifies, that is, the product of the length of the curve by the nth power of the density approaches the Jordan content of the compact set which the curve densifies.

A geometrical model for the synthesis of interval covers,

"Supported by Contract AT(11-1)-2118 with the U.S. Atomic Energy Commission."

Measurement-based teleportation along quantum spin chains

We examine the teleportation of an unknown spin-1/2 quantum state along a quantum spin chain with an even number of sites. Our protocol, using a sequence of Bell measurements, may be viewed as an iterated version of the 2-qubit protocol of C. H. Bennett et al. [Phys. Rev. Lett. 70, 1895 (1993)]. A decomposition of the Hilbert space of the spin chain into 4 vector spaces, called Bell subspaces, is given. It is established that any state from a Bell subspace may be used as a channel to perform unit fidelity teleportation. The space of all spin-0 many-body states, which includes the ground states of many known antiferromagnetic systems, belongs to a common Bell subspace. A channel-dependent teleportation parameter O is introduced, and a bound on the teleportation fidelity is given in terms of O.

On the Weight Distribution of the Coset Leaders of Constacyclic Codes

Constacyclic codes with one and the same generator polynomial and distinct length are considered. We give a generalization of the previous result of the first author [4] for constacyclic codes. Suitable maps between vector spaces determined by the lengths of the codes are applied. It is proven that the weight distributions of the coset leaders don’t depend on the word length, but on generator polynomials only. In particular, we prove that every constacyclic code has the same weight distribution of the coset leaders as a suitable cyclic code.

Indice de Point Fixe pour les Morphismes de Chaînes

2000 Mathematics Subject Classification: 54H25, 55M20.

Algebraic duality theorems for infinite LP problems

In this paper we consider a primal-dual infinite linear programming problem-pair, i.e. LPs on infinite dimensional spaces with infinitely many constraints. We present two duality theorems for the problem-pair: a weak and a strong duality theorem. We do not assume any topology on the vector spaces, therefore our results are algebraic duality theorems. As an application, we consider transferable utility cooperative games with arbitrarily many players.

Combining Taxonomies using Word2vec

Taxonomies have gained a broad usage in a variety of fields due to their extensibility, as well as their use for classification and knowledge organization. Of particular interest is the digital document management domain in which their hierarchical structure can be effectively employed in order to organize documents into content-specific categories. Common or standard taxonomies (e.g., the ACM Computing Classification System) contain concepts that are too general for conceptualizing specific knowledge domains. In this paper we introduce a novel automated approach that combines sub-trees from general taxonomies with specialized seed taxonomies by using specific Natural Language Processing techniques. We provide an extensible and generalizable model for combining taxonomies in the practical context of two very large European research projects. Because the manual combination of taxonomies by domain experts is a highly time consuming task, our model measures the semantic relatedness between concept labels in CBOW or skip-gram Word2vec vector spaces. A preliminary quantitative evaluation of the resulting taxonomies is performed after applying a greedy algorithm with incremental thresholds used for matching and combining topic labels.

Comparing the orthogonal and homotopy functor calculi

Goodwillie’s homotopy functor calculus constructs a Taylor tower of approximations toF , often a functor from spaces to spaces. Weiss’s orthogonal calculus provides a Taylortower for functors from vector spaces to spaces. In particular, there is a Weiss towerassociated to the functor V ÞÑ FpSVq, where SVis the one-point compactification of V .In this paper, we give a comparison of these two towers and show that when F isanalytic the towers agree up to weak equivalence. We include two main applications, oneof which gives as a corollary the convergence of the Weiss Taylor tower of BO. We alsolift the homotopy level tower comparison to a commutative diagram of Quillen functors,relating model categories for Goodwillie calculus and model categories for the orthogonal calculus.

“Varopoulos paradigm”: Mackey property versus metrizability in topological groups.

The class of all locally quasi-convex (lqc) abelian groups contains all locally convex vector spaces (lcs) considered as topological groups. Therefore it is natural to extend classical properties of locally convex spaces to this larger class of abelian topological groups. In the present paper we consider the following well known property of lcs: “A metrizable locally convex space carries its Mackey topology ”. This claim cannot be extended to lqc-groups in the natural way, as we have recently proved with other coauthors (Außenhofer and de la Barrera Mayoral in J Pure Appl Algebra 216(6):1340–1347, 2012; Díaz Nieto and Martín Peinador in Descriptive Topology and Functional Analysis, Springer Proceedings in Mathematics and Statistics, Vol 80 doi:10.1007/978-3-319-05224-3_7, 2014; Dikranjan et al. in Forum Math 26:723–757, 2014). We say that an abelian group G satisfies the Varopoulos paradigm (VP) if any metrizable locally quasi-convex topology on G is the Mackey topology. In the present paper we prove that in any unbounded group there exists a lqc metrizable topology that is not Mackey. This statement (Theorem C) allows us to show that the class of groups satisfying VP coincides with the class of finite exponent groups. Thus, a property of topological nature characterizes an algebraic feature of abelian groups.

Development of unsupervised learning methods with applications to life sciences data

Machine Learning makes computers capable of performing tasks typically requiring human intelligence. A domain where it is having a considerable impact is the life sciences, allowing to devise new biological analysis protocols, develop patients’ treatments efficiently and faster, and reduce healthcare costs. This Thesis work presents new Machine Learning methods and pipelines for the life sciences focusing on the unsupervised field. At a methodological level, two methods are presented. The first is an “Ab Initio Local Principal Path” and it is a revised and improved version of a pre-existing algorithm in the manifold learning realm. The second contribution is an improvement over the Import Vector Domain Description (one-class learning) through the Kullback-Leibler divergence. It hybridizes kernel methods to Deep Learning obtaining a scalable solution, an improved probabilistic model, and state-of-the-art performances. Both methods are tested through several experiments, with a central focus on their relevance in life sciences. Results show that they improve the performances achieved by their previous versions. At the applicative level, two pipelines are presented. The first one is for the analysis of RNA-Seq datasets, both transcriptomic and single-cell data, and is aimed at identifying genes that may be involved in biological processes (e.g., the transition of tissues from normal to cancer). In this project, an R package is released on CRAN to make the pipeline accessible to the bioinformatic Community through high-level APIs. The second pipeline is in the drug discovery domain and is useful for identifying druggable pockets, namely regions of a protein with a high probability of accepting a small molecule (a drug). Both these pipelines achieve remarkable results. Lastly, a detour application is developed to identify the strengths/limitations of the “Principal Path” algorithm by analyzing Convolutional Neural Networks induced vector spaces. This application is conducted in the music and visual arts domains.