Buscar
Mostrando ítems 1-10 de 126
Jack Polynomials with Prescribed Symmetry and Some of Their Clustering Properties
(2015)
We study Jack polynomials in N variables, with parameter alpha, and having a prescribed symmetry with respect to two disjoint subsets of variables. For instance, these polynomials can exhibit a symmetry of type AS, which ...
Algunos aspectos algebraicos y computacionales en anillos polinomiales torcidos multivariables = Some algebraic and computational aspects in multivariate skew polynomial rings.
(Universidad de Concepción.Facultad de Ciencias Físicas y Matemáticas, 2022)
Skew polynomial rings F[x; σ, δ] with coefficients over a division ring F (Definition 1.1.6),
were introduced in [27] by Oystein Ore (1933), as a non-commutative generalization of
the conventional polynomial rings. The ...
On the complexity of the {k}-packing function problem
(Blackwell Publishers, 2017-01)
Given a positive integer k, the “ {k} -packing function problem” ({k} PF) is to find in a given graph G, a function f that assigns a nonnegative integer to the vertices of G in such a way that the sum of {k} over each ...
Emergence of power law distributions for odd and even lifetimes
(American Physical Society, 2020-12-24)
Avalanche lifetime distributions have been related to first-return random walk processes. In this sense, the theory for random walks can be employed to understand, for instance, the origin of power law distributions in ...
Polynomials and holomorphic functions on A-compact sets in Banach spaces
(Academic Press Inc Elsevier Science, 2018-07)
In this paper we study the behavior of holomorphic mappings on A-compact sets. Motivated by the recent work of Aron, Çalişkan, García and Maestre (2016), we give several conditions (on the holomorphic mappings and on the ...
Linear type global centers of linear systems with cubic homogeneous nonlinearities
(Rendiconti del Circolo Matematico di Palermo Series 2, 2021)
Breaking symmetries to rescue sum of squares in the case of makespan scheduling
(Springer, 2020)
The sum of squares (SoS) hierarchy gives an automatized technique to create a family of increasingly tight convex relaxations for binary programs. There are several problems for which a constant number of rounds of this ...