Related papers: Adams Operations on Matrix Factorizations
The extension problem asks whether positive semi-definite functions on a symmetric unital subset of a discrete group can be extended to positive semi-definite functions on the whole group. It has been known at least since the work of Rudin…
In this paper, we study uniqueness problems for an entire function that shares small functions of finite order with their difference operators. In particular, we give a generalization of results in [2,3,13].
We extend a factorization due to Krein to arbitrary analytic functions from the upper half-plane to itself. The factorization represents every such function as a product of fractional linear factors times a function which, generally, has…
We show that the factorization problem $\theta (z)=\theta_2(z)\theta_1(z)$ is solvable in the class of Hilbert space operator-valued functions holomorphic on some neighbourhood of $z=0$ in $\nspace{C}{N}$ and having a zero at $z=0$ (here…
We give a new algorithm for the construction of the unique superoptimal analytic approximant of a given continuous matrix-valued function on the unit circle, making use of exterior powers of operators in preference to spectral or {\em…
We prove a number of p-adic congruences for the coefficients of powers of a multivariate polynomial f(x) with coefficients in a ring R of characteristic zero. If the Hasse--Witt operation is invertible, our congruences yield p-adic limit…
In this paper we construct a GL-equivariant complex of Schur modules over a ring of positive characteristic that can be used to deduce classical alternating sum identities for Schur polynomials. This complex globalizes to a complex of…
In this work, we propose a new algorithm for finding a zero in the sum of two monotone operators where one is assumed to be single-valued and Lipschitz continuous. This algorithm naturally arises from a non-standard discretization of a…
Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity…
We prove a plethora of boundedness property of the Adams type for bilinear fractional integral operators of the form $$B_{\alpha}(f,g)(x)=\int_{\mathbb{R}^{n}}\frac{f(x-y)g(x+y)}{|y|^{n-\alpha}}dy,\qquad 0<\alpha<n.$$ For $1<t\leq…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
We introduce generalizations of powers and factor complexity via orbits of group actions. These generalizations include concepts like abelian powers and abelian complexity. It is shown that this notion of factor complexity cannot be used to…
We develop a search algorithm for systems of $q$-difference equations satisfied by Andrews-Gordon type double series. We then couple the search algorithm with Euler's algorithm for finding infinite products to narrow the search space. We…
In this note, firstly we give an easy proof of the factorization of symmetric matrices (see [Mos] math-ph/0203023), then we use it to prove the well-known fact that the automorphism group of a non-degenerate symmetric bilinear form acts…
The primary goal of this paper is to introduce and investigate generalized incomplete exponential functions with matrix parameters. Integral representation, differential formula, addition formula, multiplication formula, and recurrence…
In this paper, we study the consequences of the fundamental theorem of calculus from an algebraic point of view. For functions with singularities, this leads to a generalized notion of evaluation. We investigate properties of such…
We study the problem of invariance of indices of thematic factorizations. Such factorizations were introduced in [PY1] for studying superoptimal approximation by bounded analytic matrix functions. As shown in [PY1], the indices may depend…
Branes and defects in topological Landau-Ginzburg models are described by matrix factorisations. We revisit the problem of deforming them and discuss various deformation methods as well as their relations. We have implemented these…
In previous work we have shown that classical approximation theory provides methods for the systematic construction of inverse-closed smooth subalgebras. Now we extend this work to treat inverse-closed subalgebras of ultradifferentiable…
Consider two agents, Alice and Bob, each of whom takes a quantum input, operates on a shared quantum system $K$, and produces a quantum output. Alice and Bob's operations may commute, in the sense that the joint input-output behaviour is…