SearcharxivSearch

arXiv subjects

Michel Alexis

Publications and source records attributed to Michel Alexis.

13 recordsLinked to original sources

An SU(2n)-valued nonlinear Fourier transform

We define a nonlinear Fourier transform which maps sequences of contractive $n \times n$ matrices to $SU(2n)$-valued functions on the circle $\mathbb{T}$. We characterize the image of finitely supported sequences and square-summable sequences on the half-line, and construct an inverse for $SU(2n)$-valued functions whose diagonal $n \times n$ blocks are outer matrix functions. As an application, we relate this nonlinear Fourier transform with quantum signal processing over $U(2n)$ and multivariate quantum signal processing.

math.CA

One sided orthogonal polynomials and a pointwise convergence result for $SU(2)$-valued nonlinear Fourier series

We elaborate on a connection between the $SU(2)$-valued nonlinear Fourier series and sequences of left and right orthogonal polynomials for complex measures on the unit circle. We show a convergence result for the associated reproducing kernel. This is a universality type result in the vein of Mate-Nevai-Totik, which turns out to be much simpler in the $SU(2)$ case than in the $SU(1,1)$ case. We then relate a.e. pointwise convergence of the product of left and right polynomials and their squares with both behavior of their zeros as well as behavior of some local parameters for these polynomials. We conclude by proving almost everywhere convergence along lacunary sequences of the functional $(a_n ^* +b_n)(a_n - b_n ^*)$ of the partial $SU(2)$-valued nonlinear Fourier series $(a_n, b_n)$ under the assumption that the nonlinear Fourier series $(a,b)$ itself satisfies both $\|b\|_{L^{\infty} (\mathbb{T})} < 2^{- \frac 1 2}$ and $a^*$ is outer.

math.CA

Infinite quantum signal processing for arbitrary Szeg\H{o} functions

We provide a complete solution to the problem of infinite quantum signal processing for the class of Szeg\H{o} functions, which are functions that satisfy a logarithmic integrability condition and include almost any function that allows for a quantum signal processing representation. We do so by introducing a new algorithm called the Riemann-Hilbert-Weiss algorithm, which can compute any individual phase factor independent of all other phase factors. Our algorithm is also the first provably stable numerical algorithm for computing phase factors of any arbitrary Szeg\H{o} function. The proof of stability involves solving a Riemann-Hilbert factorization problem in nonlinear Fourier analysis using elements of spectral theory.

quant-ph

Quantum signal processing and nonlinear Fourier analysis

Elucidating a connection with nonlinear Fourier analysis, we extend a well known algorithm in quantum signal processing to represent measurable signals by square summable sequences. Each coefficient of the sequence is Lipschitz continuous as a function of the signal.

quant-ph

Haar basis testing

We show that for two doubling measures $\sigma$ and $\omega$ on $\mathbb{R}^{n}$ and any fixed dyadic grid $\mathcal{D}$ in $\mathbb{R}^{n}$, \[ \mathfrak{N}_{\mathbf{R}^{\lambda, n}}\left( \sigma,\omega\right) \approx\mathfrak{H}_{\mathbf{R}^{\lambda, n}}^{\mathcal{D},\operatorname*{glob}}\left( \sigma,\omega\right) +\mathfrak{H}_{\mathbf{R}^{\lambda, n}}^{\mathcal{D},\operatorname*{glob}}\left( \omega, \sigma\right) \ , \] where $\mathfrak{N}_{\mathbf{R}^{\lambda, n}} (\sigma, \omega)$ denotes the $L^2 (\sigma) \to L^2 (\omega)$ operator norm of the vector-Riesz transform $\mathbf{R}^{\lambda, n}$ of fractional order $\lambda \neq 1$, and \[ \mathfrak{H}_{\mathbf{R}^{\lambda,n}}^{\mathcal{D},\operatorname*{glob}}\left( \sigma,\omega\right) \equiv\sup_{I\in\mathcal{D}}\left\Vert \mathbf{R}^{\lambda,n} h_{I}^{\sigma}\right\Vert _{L^{2}\left( \omega\right) }\ , \] is the global Haar testing characteristic for $\mathbf{R}^{\lambda,n}$ on the grid $\mathcal{D}$, and $\left\{ h_{I}^{\sigma}\right\} _{I\in\mathcal{D}}$ is the weighted Haar orthonormal basis of $L^{2}\left( \sigma\right) $ arising in the work of Nazarov, Treil and Volberg. We also show this theorem extends more generally to weighted Alpert wavelets which replace the weighted Haar wavelets in the proofs of some recent two-weight $T1$ theorems. Finally, we briefly pose these questions in the context of orthonormal bases in arbitrary Hilbert spaces.

math.FA

The scalar $T1$ theorem for pairs of doubling measures fails for Riesz transforms when p not 2

We show that for an individual Riesz transform in the setting of doubling measures, the scalar $T1$ theorem fails when $p \neq 2$: for each $ p \in (1, \infty) \setminus \{2\}$, we construct a pair of doubling measures $(\sigma, \omega)$ on $\mathbb{R}^2$ with doubling constant close to that of Lebesgue measure that also satisfy the scalar $\mathcal{A}_p$ condition and the full scalar $L^p$-testing conditions for an individual Riesz transform $R_j$, and yet $\left ( R_j \right )_{\sigma} : L^p (\sigma) \not \to L^p (\omega)$. On the other hand, we improve upon the quadratic, or vector-valued, $T1$ theorem of Sawyer-Wick when $p \neq 2$ on pairs of doubling measures: we dispense with their vector-valued weak boundedness property to show that for pairs of doubling measures, the two-weight $L^p$ norm inequality for the vector Riesz transform is characterized by a quadratic Muckenhoupt condition $A_{p} ^{\ell^2, \operatorname{local}}$, and a quadratic testing condition. Finally, in the appendix, we use constructions of Kakaroumpas-Treil to show that the two-weight norm inequality for the maximal function cannot be characterized solely by the $A_p$ condition when the measures are doubling, contrary to reports in the literature.

math.CA

The Steklov problem and Remainder Estimates for Krein Systems generated by a Muckenhoupt weight

We show that solutions to Krein systems, the continuous frequency analogue of orthogonal polynomials on the unit circle, generated by an $A_2 (\mathbb{R})$ weight $w$ satisfying $w-1 \in L^1 (\mathbb{R}) + L^2 (\mathbb{R})$, are uniformly bounded in $L^p_{\mathrm{loc}} (w, \mathbb{R})$ for $p$ sufficiently close to $2$. This provides a positive answer to the Steklov problem for Krein systems. Furthermore, we define a "remainder" which measures the difference between the solution to a Krein system and a polynomial-like approximant, and we estimate these remainders in $L^p_w (\mathbb{R})$ for $w \in A_2 (\mathbb{R})$ satisfying some additional conditions. Such polynomial-like approximants, and hence remainder estimates, seem unique to Krein systems, with no analogue for orthogonal polynomials on the unit circle.

math.CA

Stability of Weighted Norm Inequalities

We show that while individual Riesz transforms are two weight norm stable under biLipschitz change of variables on $A_{\infty}$ weights, they are two weight norm unstable under even rotational change of variables on doubling weights. More precisely, we show that individual Riesz transforms are unstable under a set of rotations having full measure, which includes rotations arbitrarily close to the identity. This provides an operator theoretic distinction between $A_{\infty}$ weights and doubling weights. More generally, all iterated Riesz transforms of odd order are rotationally unstable on pairs of doubling weights, thus demonstrating the need for characterizations of iterated Riesz transform inequalities using testing conditions for doubling measures, as opposed to the typically stable 'bump' conditions.

math.CA

Tops of dyadic grids

We extend the notion of a dyadic grid of cubes in Euclidean space to include infinite dyadic cubes. These `tops' of a dyadic grid form a tiling of Euclidean space which is subject to the constraints similar to those arising in tiling Euclidean space by (finite) unit cubes. These tops arise in the theory of two weight norm inequalities through weighted Haar and Alpert wavelets.

math.CA

A weak to strong type T1 theorem for general smooth Calder\'on-Zygmund operators with doubling weights, II

We consider the weak to strong type problem for two weight norm inequalities for Calder\'on-Zygmund operators with doubling weights. We show that if a Calder\'on-Zygmund operator T is weak type (2,2) with doubling weights, then it is strong type (2,2) if and only if the dual cube testing condition for T^{*} holds, alternatively if and only if the dual cancellation condition of Stein holds. The testing condition can be taken with respect to either cubes or balls, and more generally, this is extended to a weak form of Tb theorem. Finally, we show that for all pairs of locally finite positive Borel measures, and all Stein elliptic Calder\'on-Zygmund operators T, the weak type (2,2) inequalities for T and and its associated maximal truncations operator T_{*} are equivalent. Thus the characterization of weak type for T_{*} in [LaSaUr1] applies to T as well.

math.CA

Continuity of weighted operators, Muckenhoupt $A_p$ weights, and Steklov problem for orthogonal polynomials

We consider weighted operators acting on $L^p(\mathbb{R}^d)$ and show that they depend continuously on the weight $w\in A_p(\mathbb{R}^d)$ in the operator topology. Then, we use this result to estimate $L^p_w(\mathbb{T})$ norm of polynomials orthogonal on the unit circle when the weight $w$ belongs to Muckenhoupt class $A_2(\mathbb{T})$ and $p>2$. The asymptotics of the polynomial entropy is obtained as an application.

math.CA

Clique-Relaxed Competitive Graph Coloring

We investigate a variation of the graph coloring game, as studied in [2]. In the original coloring game, two players, Alice and Bob, alternate coloring vertices on a graph with legal colors from a fixed color set, where a color α is legal for a vertex if said vertex has no neighbors colored α. Other variations of the game change this definition of a legal color. For a fixed color set, Alice wins the game if all vertices are colored when the game ends, while Bob wins if there is a point in the game in which a vertex cannot be assigned a legal color. The least number of colors needed for Alice to have a winning strategy on a graph G is called the game chromatic number of G, and is denoted \c{hi}g(G). A well studied variation is the d-relaxed coloring game [5] in which a legal coloring of a graph G is defined as any assignment of colors to V (G) such that the subgraph of G induced by any color class has maximum degree d. We focus on the k-clique-relaxed n-coloring game. A k-clique-relaxed n-coloring of a graph G is an n-coloring in which the subgraph of G induced by any color class has maximum clique size k or less. In other words, a k-clique-relaxed n-coloring of G is an assignment of n colors to V (G) in which there are no monochromatic (k + 1)-cliques.

math.CO