English
Related papers

Related papers: Realizations and Factorizations of Positive Defini…

200 papers

We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…

Functional Analysis · Mathematics 2026-02-16 Mohsen Kian

In this paper we prove the global in time solvability of the continuous growth--fragmentation--coagulation equation with unbounded coagulation kernels, in spaces of functions having finite moments of sufficiently high order. The main tool…

Analysis of PDEs · Mathematics 2021-04-28 Jacek Banasiak , Wilson Lamb

We study kernel functions, and associated reproducing kernel Hilbert spaces $\mathscr{H}$ over infinite, discrete and countable sets $V$. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding…

Functional Analysis · Mathematics 2015-08-17 Palle Jorgensen , Feng Tian

Behavioural metrics have been shown to be an effective mechanism for constructing representations in reinforcement learning. We present a novel perspective on behavioural metrics for Markov decision processes via the use of positive…

Machine Learning · Computer Science 2023-11-01 Pablo Samuel Castro , Tyler Kastner , Prakash Panangaden , Mark Rowland

Given a reproducing kernel Hilbert space H of real-valued functions and a suitable measure mu over the source space D (subset of R), we decompose H as the sum of a subspace of centered functions for mu and its orthogonal in H. This…

Machine Learning · Statistics 2012-12-10 Nicolas Durrande , David Ginsbourger , Olivier Roustant , Laurent Carraro

We prove: if the (\'etale or de Rham) realization functor is conservative on the category $DM_{gm}$ of Voevodsky motives with rational coefficients then motivic zeta functions of arbitrary varieties are rational and numerical motives are…

Algebraic Geometry · Mathematics 2018-11-29 Mikhail V. Bondarko

We propose and investigate bounds on quantum process fidelity of quantum filters, i.e. probabilistic quantum operations represented by a single Kraus operator K. These bounds generalize the Hofmann bounds on quantum process fidelity of…

Quantum Physics · Physics 2016-08-08 Michal Sedlak , Jaromír Fiurášek

Let $X$ be a Banach space, $\Sigma$ be a $\sigma$-algebra, and $m:\Sigma\to X$ be a (countably additive) vector measure. It is a well known consequence of the Davis-Figiel-Johnson-Pelcz\'{y}nski factorization procedure that there exist a…

Functional Analysis · Mathematics 2020-08-04 Olav Nygaard , José Rodríguez

In this paper we investigate the following questions. Let $\mu, \nu$ be two regular Borel measures of finite total variation. When do we have a constant $C$ satisfying $$\int f d\nu \le C \int f d\mu$$ whenever $f$ is a continuous…

Functional Analysis · Mathematics 2019-04-22 Marcell Gaál , Szilárd Gy. Révész

It has been recently shown that if $K$ is a sesqui-analytic scalar valued non-negative definite kernel on a domain $\Omega$ in $\mathbb C^m$, then the function $\big(K^2\partial_i\bar{\partial}_j\log K\big )_{i,j=1}^ m,$ is also a…

Functional Analysis · Mathematics 2022-02-08 Soumitra Ghara , Gadadhar Misra

In this paper we propose a family of tractable kernels that is dense in the family of bounded positive semi-definite functions (i.e. can approximate any bounded kernel with arbitrary precision). We start by discussing the case of stationary…

Machine Learning · Statistics 2015-10-13 Yves-Laurent Kom Samo , Stephen Roberts

For a homomorphism f: A --> B of commutative rings, let D(A,B) denote Ker[Pic(A) --> Pic(B)]. Let k be a field and assume that A is a f.g. k-algebra. We prove a number of finiteness results for D(A,B). Here are four of them. 1: Suppose B is…

alg-geom · Mathematics 2008-02-03 Robert Guralnick , David Jaffe , Wayne Raskind , Roger Wiegand

The main result of this paper is that determinantal point processes on the real line corresponding to projection operators with integrable kernels are quasi-invariant, in the continuous case, under the group of diffeomorphisms with compact…

Probability · Mathematics 2016-12-01 Alexander I. Bufetov

We describe a flexible construction that produces triples of finitely generated, residually finite groups $M\hookrightarrow P \hookrightarrow \Gamma$, where the maps induce isomorphisms of profinite completions…

Group Theory · Mathematics 2024-12-18 Martin R. Bridson

We consider iterated function systems (finite or countable), together with linear and continuous operators on Hilbert spaces, which enable us to construct Markov-type operators. Under suitable conditions, these Markov-type operators have…

Classical Analysis and ODEs · Mathematics 2017-01-30 Ion Chiţescu , Loredana Ioana , Radu Miculescu , Lucian Niţă

Let $S=K[x_1,...,x_n]$ or $S=K[[x_1,...,x_n]]$ be either a polynomial or a formal power series ring in a finite number of variables over a field $K$ of characteristic $p > 0$ with $[K:K^p] < \infty$. Let $R$ be the hypersurface $S/fS$ where…

Commutative Algebra · Mathematics 2018-04-23 Khaled Alhazmy

Based on direct integrals, a framework allowing to integrate a parametrised family of reproducing kernels with respect to some measure on the parameter space is developed. By pointwise integration, one obtains again a reproducing kernel…

Functional Analysis · Mathematics 2012-02-21 Thomas Hotz , Fabian J. E. Telschow

We investigate the interaction between the existence of reproducing kernels on infinite-dimensional Hermitian vector bundles and the positivity properties of the corresponding bundles. The positivity refers to the curvature form of certain…

Functional Analysis · Mathematics 2014-02-04 Daniel Beltita , José E. Galé

We show how combinatorial star products can be used to obtain strict deformation quantizations of polynomial Poisson structures on $\mathbb R^d$, generalizing known results for constant and linear Poisson structures to polynomial Poisson…

Quantum Algebra · Mathematics 2023-03-27 Severin Barmeier , Philipp Schmitt

Kernelization is a formalization of efficient preprocessing for NP-hard problems using the framework of parameterized complexity. Among open problems in kernelization it has been asked many times whether there are deterministic polynomial…

Computational Complexity · Computer Science 2015-07-14 Michael Etscheid , Stefan Kratsch , Matthias Mnich , Heiko Röglin