Related papers: Decomposition results for multiplicative actions a…
The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem.…
We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain $D$. This theorem is relative to any element of $D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a recursive…
We prove that multiple-recurrence and polynomial-recurrence of invertible infinite measure preserving transformations are both properties which pass to extensions.
In this note, we consider the resultant of systems of homogeneous multivariate polynomials which are equivariant under the action of direct product of two symmetric groups. We establish a decomposition formula for the resultant of such…
We use Grothendieck theorem to prove a structure theorem for multicorrelation sequences of length two, associated with two (not necessarily commuting) measure preserving actions on a probability space. We use this to deduce a multiple…
In this paper, we establish continuous bilinear decompositions that arise in the study of products between elements in martingale Hardy spaces $ H^p\ (0<p\leqslant 1) $ and functions in their dual spaces. Our decompositions are based on…
Iterating Newton's method symbolically for the general quadratic yields a rational function, the numerator and denominator of which are polynomials with highly composite coefficients.
In this paper, we prove two results related to the solutions of norm form equations. Firstly, we give a finiteness result for sums of terms of linear recurrence sequences appearing in the coordinates of solutions of norm form equations.…
The study of images of noncommutative polynomials on algebras has attracted considerable attention. We investigate polynomial images and the additive structures they generate in associative algebras, focusing on sums and products of values.…
We show that certain determinantal functions of multiple matrices, when summed over the symmetries of the cube, decompose into functions of the original matrices. These are shown to be true in complete generality; that is, no properties of…
Some concepts, such as non-compactness measure and condensing operators, defined on metric spaces are extended to uniform spaces. Such extensions allow us to locate, in the context of uniform spaces, some classical results existing in…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…
Many practical reinforcement learning environments have a discrete factored action space that induces a large combinatorial set of actions, thereby posing significant challenges. Existing approaches leverage the regular structure of the…
We develop a new setting for the exponential principle in the context of multisort species, where indecomposable objects are generated intrinsically instead of being given in advance. Our approach uses the language of functors and natural…
This paper is concerned with the asymptotic behavior of sums of terms which are a test function f evaluated at successive increments of a discretely sampled semimartingale. Typically the test function is a power function (when the power is…
Ergodic and combinatorial results obtained in [10] involved measure preserving actions of the affine group ${\mathcal A}_K$ of a countable field $K$. In this paper we develop a new approach based on ultrafilter limits which allows one to…
We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, and also implicitly when objects can be broken…
The main object of this work is to show how some rather elementary techniques based upon certain inverse pairs of symbolic operators would lead us easily to several decomposition formulas associated with confluent hypergeometric functions…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…