# Search results

Archiv der Mathematik > 2017 > 109 > 2 > 123-131

*p*be a nonconstant form in $${\mathbb {R}}[x_1,\ldots ,x_n]$$ R [ x 1 , … , x n ] with $$p(1,\ldots ,1)>0$$ p ( 1 , … , 1 ) > 0 . If $$p^m$$ p m has strictly positive coefficients for some integer $$m\ge 1$$ m ≥ 1 , we show that $$p^m$$ p m has strictly positive coefficients for all sufficiently large

*m*. More generally, for any such...

Research in Number Theory > 2019 > 5 > 4 > 1-8

*m*shifted inequality $$\begin{aligned} p(a) \, p(b) \ge p(a+b+m-1) \end{aligned}$$ p(a)p(b)≥p(a+b+m-1) where

*p*(

*n*) is the

*n*th partition number, and $$a,b,m \in \mathbb {N}_0$$ a,b,m∈N0 with

*a*,

*b*positive. The inequality was first studied by Bessenrodt–Ono for $$m=1$$ m=1 . We finally suggest...

International Journal of Control, Automation and Systems > 2019 > 17 > 10 > 2490-2499

Mathematics in Computer Science > 2019 > 13 > 3 > 449-457

Aequationes mathematicae > 2019 > 93 > 5 > 985-1007

The Journal of Analysis > 2019 > 27 > 4 > 1163-1177

Lithuanian Mathematical Journal > 2019 > 59 > 1 > 24-38

*Q*

_{1}

*, . . . , Q*

_{t}∈

*ℝ*[

*x*] be polynomials with no constant term for which each linear combination

*m*

_{1}

*Q*

_{1}(

*x*) +

*· · ·*+

*m*

_{t}

*Q*

_{t}(

*x*) with

*m*

_{1}

*, . . . , m*

_{t}∈

*ℤ*and not all 0 always has an irrational coefficient. Let

*I*

_{1}

*, . . . , I*

_{t}be sets included in the interval [0

*,*1), each being a union of finitely many subintervals of [0

*,*1). Furthermore, let T $$ \mathcal{T} $$ be the set of positive integers

*n*for which...

Advances in Applied Clifford Algebras > 2019 > 29 > 1 > 1-16

Computational Methods and Function Theory > 2019 > 19 > 1 > 173-182

*B*, there is an injective analytic map $$\varphi :{\mathbb {D}}\rightarrow {\mathbb {C}}$$ φ : D → C and a polynomial

*p*of the same degree as

*B*such that $$B=p\circ \varphi $$ B = p ∘ φ on $${\mathbb {D}}$$ D . Several proofs of this result have been given over the past several years, using fundamentally different methods. However, even for low-degree...

Computational Methods and Function Theory > 2019 > 19 > 1 > 157-172

Rendiconti del Circolo Matematico di Palermo Series 00002 > 2019 > 68 > 3 > 579-588

Journal of Mathematical Analysis and Applications > 2018 > 466 > 2 > 1486-1498

Neuroscience Letters > 2018 > 683 > C > 138-143

Constructive Approximation > 2019 > 49 > 1 > 29-58

*t*-designs from single Grassmannians to unions. We derive their characterization...

Numerical Algorithms > 2019 > 81 > 2 > 719-740

Fundamenta Informaticae > 2018 > Vol. 161, nr 1/2 > 135--161

^{R}T of the low complexity description logic SROEL(⊓, x), which underlies the OWL EL ontology language. The extension involves a typicality operator T, whose semantics is based on Lehmann and Magidor’s ranked models and allows for the definition of defeasible inclusions. We consider both rational entailment and minimal entailment. We show that deciding...

Journal of Symbolic Computation > 2018 > 87 > C > 238-241