Search results for "FACTORIZATION"
showing 10 items of 221 documents
Varieties of Codes and Kraft Inequality
2005
Decipherability conditions for codes are investigated by using the approach of Guzman, who introduced in [7] the notion of variety of codes and established a connection between classes of codes and varieties of monoids. The class of Uniquely Decipherable (UD) codes is a special case of variety of codes, corresponding to the variety of all monoids. It is well known that the Kraft inequality is a necessary condition for UD codes, but it is not sufficient, in the sense that there exist codes that are not UD and that satisfy the Kraft inequality. The main result of the present paper states that, given a variety $\mathcal{V}$ of codes, if all the elements of $\mathcal{V}$ satisfy the Kraft inequ…
Representation and factorization theorems for almost-Lp-spaces
2019
The first and fourth authors gratefully acknowledge the support of Ministerio de Ciencia, Innovacibn y Universidades (Spain), Agencia Estatal de Investigaciones, and FEDER, under projects MTM2014-53009-P (J.M. Calabuig) and MTM2016-77054-C2-1-P (E.A. Sanchez Perez).
Factorization of absolutely continuous polynomials
2013
In this paper we study the ideal of dominated (p,s)-continuous polynomials, that extend the nowadays well known ideal of p-dominated polynomials to the more general setting of the interpolated ideals of polynomials. We give the polynomial version of Pietsch s factorization Theorem for this new ideal. Our factorization theorem requires new techniques inspired in the theory of Banach lattices.
Factorization of (q,p)-summing polynomials through Lorentz spaces
2017
[EN] We present a vector valued duality between factorable (q,p)-summing polynomials and (q,p)-summing linear operators on symmetric tensor products of Banach spaces. Several applications are provided. First, we prove a polynomial characterization of cotype of Banach spaces. We also give a variant of Pisier's factorization through Lorentz spaces of factorable (q,p)-summing polynomials from C(K)-spaces. Finally, we show a coincidence result for (q,p)-concave polynomials.(c) 2016 Elsevier Inc. All rights reserved.
Domination spaces and factorization of linear and multilinear summing operators
2015
[EN] It is well known that not every summability property for multilinear operators leads to a factorization theorem. In this paper we undertake a detailed study of factorization schemes for summing linear and nonlinear operators. Our aim is to integrate under the same theory a wide family of classes of mappings for which a Pietsch type factorization theorem holds. Our construction includes the cases of absolutely p-summing linear operators, (p, sigma)-absolutely continuous linear operators, factorable strongly p-summing multilinear operators, (p(1), ... , p(n))-dominated multilinear operators and dominated (p(1), ... , p(n); sigma)-continuous multilinear operators.
Pietsch's factorization theorem for dominated polynomials
2007
Abstract We prove that, like in the linear case, there is a canonical prototype of a p -dominated homogeneous polynomial through which every p -dominated polynomial between Banach spaces factors.
Multialternating graded polynomials and growth of polynomial identities
2012
Let G be a finite group and A a finite dimensional G-graded algebra over a field of characteristic zero. When A is simple as a G-graded algebra, by mean of Regev central polynomials we construct multialternating graded polynomials of arbitrarily large degree non vanishing on A. As a consequence we compute the exponential rate of growth of the sequence of graded codimensions of an arbitrary G-graded algebra satisfying an ordinary polynomial identity. In particular we show it is an integer. The result was proviously known in case G is abelian.
A Periodicity Theorem on Words and Applications
1995
We prove a periodicity theorem on words that has strong analogies with the Critical Factorization theorem and we show three applications of it.
Matching factorization theorems with an inverse-error weighting
2018
We propose a new fast method to match factorization theorems applicable in different kinematical regions, such as the transverse-momentum-dependent and the collinear factorization theorems in Quantum Chromodynamics. At variance with well-known approaches relying on their simple addition and subsequent subtraction of double-counted contributions, ours simply builds on their weighting using the theory uncertainties deduced from the factorization theorems themselves. This allows us to estimate the unknown complete matched cross section from an inverse-error-weighted average. The method is simple and provides an evaluation of the theoretical uncertainty of the matched cross section associated w…
Erratum to: DYTurbo: fast predictions for Drell–Yan processes
2020
The European physical journal / C 80(5), 440 (2020). doi:10.1140/epjc/s10052-020-7972-0