The Hadamard Product of Moment Sequences, Diagonal Positivity Preservers, and their Generators

Abstract In this work we investigate special aspects of positivity preservers and especially diagonal positivity preservers, i.e., linear maps $$T:\mathbb {R}[x_1,\dots ,x_n]\rightarrow \mathbb {R}[x_1,\dots ,x_n]$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>T</mml:mi> <mml:mo>:</mml:mo> <mml:mi>R</mml:mi> <mml:mrow> <mml:mo>[</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:mo>⋯</mml:mo> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo>]</mml:mo> </mml:mrow> <mml:mo>→</mml:mo> <mml:mi>R</mml:mi> <mml:mrow> <mml:mo>[</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:mo>⋯</mml:mo> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo>]</mml:mo> </mml:mrow> </mml:mrow> </mml:math> such that $$Tx^\alpha = t_\alpha x^\alpha $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>T</mml:mi> <mml:msup> <mml:mi>x</mml:mi> <mml:mi>α</mml:mi> </mml:msup> <mml:mo>=</mml:mo> <mml:msub> <mml:mi>t</mml:mi> <mml:mi>α</mml:mi> </mml:msub> <mml:msup> <mml:mi>x</mml:mi> <mml:mi>α</mml:mi> </mml:msup> </mml:mrow> </mml:math> for all $$\alpha \in \mathbb {N}_0^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>α</mml:mi> <mml:mo>∈</mml:mo> <mml:msubsup> <mml:mi>N</mml:mi> <mml:mn>0</mml:mn> <mml:mi>n</mml:mi> </mml:msubsup> </mml:mrow> </mml:math> with $$t_\alpha \in \mathbb {R}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>t</mml:mi> <mml:mi>α</mml:mi> </mml:msub> <mml:mo>∈</mml:mo> <mml:mi>R</mml:mi> </mml:mrow> </mml:math> and $$Tp\ge 0$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>T</mml:mi> <mml:mi>p</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> on $$\mathbb {R}^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msup> </mml:math> for all $$p\in \mathbb {R}[x_1,\dots ,x_n]$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>∈</mml:mo> <mml:mi>R</mml:mi> <mml:mo>[</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:mo>⋯</mml:mo> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo>]</mml:mo> </mml:mrow> </mml:math> with $$p\ge 0$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> on $$\mathbb {R}^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msup> </mml:math> . We discuss representations of T , give characterizations of diagonal positivity preservers, and compare these to previous (partial) results in the literature. On the side we get a characterization of linear maps preserving moment sequences and a new proof of Schur’s product formula. The tool of diagonal positivity preservers simplifies several other existing proofs in the literature. We give a full characterization of generators A of diagonal positivity preservers, i.e., $$e^{tA}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>e</mml:mi> <mml:mrow> <mml:mi>tA</mml:mi> </mml:mrow> </mml:msup> </mml:math> is a diagonal positivity preserver for all

Authors

Institutions

Publication Details

Journal
Integral Equations and Operator Theory
Published
2025-11-10
DOI
https://doi.org/10.1007/s00020-025-02815-9
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Hadamard Product of Moment Sequences, Diagonal Positivity Preservers, and their Generators

Philipp J. di Dio, Lukas M Langer
Integral Equations and Operator Theory
Coding theory and cryptography
article

The Hadamard Product of Moment Sequences, Diagonal Positivity Preservers, and their Generators

Philipp J. di Dio, Lukas M Langer
article en

Abstract

Abstract In this work we investigate special aspects of positivity preservers and especially diagonal positivity preservers, i.e., linear maps $$T:\mathbb {R}[x_1,\dots ,x_n]\rightarrow \mathbb {R}[x_1,\dots ,x_n]$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>T</mml:mi> <mml:mo>:</mml:mo> <mml:mi>R</mml:mi> <mml:mrow> <mml:mo>[</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:mo>⋯</mml:mo> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo>]</mml:mo> </mml:mrow> <mml:mo>→</mml:mo> <mml:mi>R</mml:mi> <mml:mrow> <mml:mo>[</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:mo>⋯</mml:mo> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo>]</mml:mo> </mml:mrow> </mml:mrow> </mml:math> such that $$Tx^\alpha = t_\alpha x^\alpha $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>T</mml:mi> <mml:msup> <mml:mi>x</mml:mi> <mml:mi>α</mml:mi> </mml:msup> <mml:mo>=</mml:mo> <mml:msub> <mml:mi>t</mml:mi> <mml:mi>α</mml:mi> </mml:msub> <mml:msup> <mml:mi>x</mml:mi> <mml:mi>α</mml:mi> </mml:msup> </mml:mrow> </mml:math> for all $$\alpha \in \mathbb {N}_0^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>α</mml:mi> <mml:mo>∈</mml:mo> <mml:msubsup> <mml:mi>N</mml:mi> <mml:mn>0</mml:mn> <mml:mi>n</mml:mi> </mml:msubsup> </mml:mrow> </mml:math> with $$t_\alpha \in \mathbb {R}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>t</mml:mi> <mml:mi>α</mml:mi> </mml:msub> <mml:mo>∈</mml:mo> <mml:mi>R</mml:mi> </mml:mrow> </mml:math> and $$Tp\ge 0$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>T</mml:mi> <mml:mi>p</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> on $$\mathbb {R}^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msup> </mml:math> for all $$p\in \mathbb {R}[x_1,\dots ,x_n]$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>∈</mml:mo> <mml:mi>R</mml:mi> <mml:mo>[</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:mo>⋯</mml:mo> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo>]</mml:mo> </mml:mrow> </mml:math> with $$p\ge 0$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> on $$\mathbb {R}^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msup> </mml:math> . We discuss representations of T , give characterizations of diagonal positivity preservers, and compare these to previous (partial) results in the literature. On the side we get a characterization of linear maps preserving moment sequences and a new proof of Schur’s product formula. The tool of diagonal positivity preservers simplifies several other existing proofs in the literature. We give a full characterization of generators A of diagonal positivity preservers, i.e., $$e^{tA}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>e</mml:mi> <mml:mrow> <mml:mi>tA</mml:mi> </mml:mrow> </mml:msup> </mml:math> is a diagonal positivity preserver for all

Integral Equations and Operator TheoryVol. 97(4)
University of Konstanz (DE)
Deutsche Forschungsgemeinschaft, Universität Konstanz
Openalex Percentile: Top 82%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.