Results 21 to 30 of about 1,716,432 (375)
The Maximal Complexity of Quasiperiodic Infinite Words
Axioms, 2021 A quasiperiod of a finite or infinite string is a word whose occurrences cover every part of the string. An infinite string is referred to as quasiperiodic if it has a quasiperiod.
Ludwig Staiger
doaj +1 more source
Matrix of Polynomials Model based Polynomial Dictionary Learning Method for Acoustic Impulse Response Modeling [PDF]
, 2017 We study the problem of dictionary learning for signals that can be represented as polynomials or polynomial matrices, such as convolutive signals with time delays or acoustic impulse responses.
Dong, Jing +4 more
core +2 more sources
An Explanation of Mellin’s 1921 Paper
Известия Иркутского государственного университета: Серия "Математика", 2023 In 1921 Mellin published a Comptes Rendu paper computing the principal solution of a polynomial using generalized hypergeometric functions of its coefficients. He used an integral transform nowadays bearing his name.
W. M. Lawton
doaj +1 more source
, 2018 In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly convex, or ...
Ahmadi, Amir Ali +2 more
core +2 more sources
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials [PDF]
Electron. Notes Discret. Math., 2016 We show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs.
V. Patel, Guus Regts
semanticscholar +1 more source
Polynomial Cohomology and Polynomial Maps on Nilpotent Groups [PDF]
, 2019 We introduce a refined version of group cohomology and relate it to the space of polynomials on the group in question. We show that the polynomial cohomology with trivial coefficients admits a description in terms of ordinary cohomology with polynomial ...
Kyed, David, Petersen, Henrik Densing
core +2 more sources
Polynomial selections and separation by polynomials [PDF]
Studia Mathematica, 1996 Necessary and sufficient conditions under which two real functions defined on the real interval can be separated by a polynomial are given. An immediate consequence of the main result is the existence of the polynomial separation of convex functions of higher order. Another application is some Hyers-Ulam-stability-type result.
openaire +3 more sources
Mathematics, 2021 Let p(z) be a polynomial of degree n having no zeros in |z|
Kshetrimayum Krishnadas +2 more
doaj +1 more source
A Penrose polynomial for embedded graphs [PDF]
, 2011 We extend the Penrose polynomial, originally defined only for plane graphs, to graphs embedded in arbitrary surfaces. Considering this Penrose polynomial of embedded graphs leads to new identities and relations for the Penrose polynomial which can not be
Aigner +22 more
core +4 more sources
Chain polynomials and Tutte polynomials [PDF]
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source