English
Related papers

Related papers: Polynomial diffusions on compact quadric sets

200 papers

A polynomial is a direct sum if it can be written as a sum of two non-zero polynomials in some distinct sets of variables, up to a linear change of variables. We analyze criteria for a homogeneous polynomial to be decomposable as a direct…

Algebraic Geometry · Mathematics 2015-02-25 Weronika Buczyńska , Jarosław Buczyński , Johannes Kleppe , Zach Teitler

For a class of stochastic differential equations with reflection for which a certain ${\mathbb{L}}^p$ continuity condition holds with $p>1$, it is shown that any weak solution that is a strong Markov process can be decomposed into the sum…

Probability · Mathematics 2010-10-12 Weining Kang , Kavita Ramanan

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

Discrete Mathematics · Computer Science 2015-10-02 Jarkko Kari , Michal Szabados

A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…

Algebraic Geometry · Mathematics 2026-02-03 Carlos Agrinsoni , Heeralal Janwa , Moises Delgado

We show that existence of a global polynomial Lyapunov function for a homogeneous polynomial vector field or a planar polynomial vector field (under a mild condition) implies existence of a polynomial Lyapunov function that is a sum of…

Optimization and Control · Mathematics 2018-08-10 Amir Ali Ahmadi , Pablo A. Parrilo

We present an algebraic characterization of perfect graphs, i.e., graphs for which the clique number and the chromatic number coincide for every induced subgraph. We show that a graph is perfect if and only if certain nonnegative…

Optimization and Control · Mathematics 2023-05-03 Amir Ali Ahmadi , Cemil Dibek

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

Number Theory · Mathematics 2010-11-16 Eduardo Duenez , Steven J. Miller , Howard Straubing , Amitabha Roy

We refine and extend quantitative bounds, on the fraction of nonnegative polynomials that are sums of squares, to the multihomogenous case.

Algebraic Geometry · Mathematics 2018-06-11 Alperen Ergur

Generative diffusions are a powerful class of Monte Carlo samplers that leverage bridging Markov processes to approximate complex, high-dimensional distributions, such as those found in image processing and language models. Despite their…

Machine Learning · Statistics 2025-02-20 Zheng Zhao , Ziwei Luo , Jens Sjölund , Thomas B. Schön

We consider the class of multiple Fourier series associated with functions in the Dirichlet space of the polydisc. We prove that every such series is summable with respect to unrestricted rectangular partial sums, everywhere except for a…

Classical Analysis and ODEs · Mathematics 2020-07-01 Karl-Mikael Perfekt

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

Combinatorics · Mathematics 2007-05-23 H. A. Verrill

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

Dynamical Systems · Mathematics 2025-03-17 Ziyad AlSharawi , Jose S. Cánovas , Sadok Kallel

A polynomial $f$ of degree $d$ and coefficients in an algebraically closed field $k$ defines a morphism $f:\mathbb{P}^1_k\longrightarrow\mathbb{P}^1_k$ which, if char$(k)\nmid d$, is unramified outside a finite set of points in the image:…

Number Theory · Mathematics 2025-02-20 Francesco Naccarato

The dynamics of many systems from physics, economics, chemistry, and biology can be modelled through polynomial functions. In this paper, we provide a computational means to find positively invariant sets of polynomial dynamical systems by…

Dynamical Systems · Mathematics 2022-08-25 Elias August , Mauricio Barahona

Unitary transformations and density matrices are central objects in quantum physics and various tasks require to introduce them in a parameterized form. In the present article we present a parameterization of the unitary group…

Quantum Physics · Physics 2010-08-18 Christoph Spengler , Marcus Huber , Beatrix C. Hiesmayr

We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…

Data Structures and Algorithms · Computer Science 2016-10-07 Tengyu Ma , Jonathan Shi , David Steurer

We study the decomposition of multivariate polynomials as sums of powers of linear forms. We give a randomized algorithm for the following problem: If a homogeneous polynomial $f \in K[x_1 , . . . , x_n]$ (where $K \subseteq \mathbb{C}$) of…

Computational Complexity · Computer Science 2021-10-12 Pascal Koiran , Subhayan Saha

This paper presents a novel algorithm for constructing a sum-of-squares (SOS) decomposition for positive semi-definite polynomials with rational coefficients. Unlike previous methods that typically yield SOS decompositions with…

Symbolic Computation · Computer Science 2025-10-06 Zhenbing Zeng , Yong Huang , Lu Yang , Yongsheng Rao

We prove that Misiurewicz parameters with prescribed combinatorics and hyperbolic parameters with (d - 1) distinct attracting cycles with given multipliers are equidistributed with respect to the bifurcation measure in the moduli space of…

Dynamical Systems · Mathematics 2013-02-05 Charles Favre , Thomas Gauthier

Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich , J. Maurice Rojas