Related papers: A new factorization property of the selfdecomposab…
We apply L.~Schwartz' theory of vector valued distributions in order to simplify, unify and generalize statements about convolvability of distributions, their regularization properties and topological properties of sets of distributions.…
We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…
We prove a new automorphy lifting theorem for l-adic representations where we impose a new condition at l, which we call `potential diagonalizability'. This result allows for `change of weight' and seems to be substantially more flexible…
The notion of random self-decomposability is generalized here. Its relation to self-decomposability, Harris infinite divisibility and its connection with a stationary first order generalized autoregressive model are presented. The notion is…
It is shown that the hyperbolic functions can be associated with selfdecomposable distributions (in short: SD probability distributions or L\'evy class L probability laws). Consequently, they admit associated background driving L\'evy…
In the paper Sato (2006) there are introduced two families of improper random integrals and the corresponding two convolution semigroups of infinitely divisible laws on $\Rset^d$. Theorem 3.1 gives a relation (a factorization property)…
Let (S, B) be the log pair associated with a projective completion of a smooth quasi-projective surface V . Under the assumption that the boundary B is irreducible, we obtain an algorithm to factorize any automorphism of V into a sequence…
The notion of random self-decomposability is generalized further. The notion is then extended to non-negative integer-valued distributions.
The class of selfdecomposable distributions in free probability theory was introduced by Barndorff-Nielsen and the third named author. It constitutes a fairly large subclass of the freely infinitely divisible distributions, but so far…
The problem of factorization of a nonextensive probability distribution is discussed. It is shown that, in general, the correlation energy between the correlated subsystems in the canonical composite system can not be neglected even in the…
Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…
Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…
Let $\xi$ be a (possibly killed) subordinator with Laplace exponent $\phi$ and denote by $I_{\phi}=\int_0^{\infty}\mathrm{e}^{-\xi_s}\,\mathrm{d}s$, the so-called exponential functional. Consider the positive random variable $I_{\psi_1}$…
Theory of matrix factorizations is useful to study hypersurfaces in commutative algebra. To study noncommutative hypersurfaces, which are important objects of study in noncommutative algebraic geometry, we introduce a notion of…
We introduce a class of distributions originating from an exponential family and having a property related to the strict stability property. A characteristic function representation for this family is obtained and its properties are…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
For nonstationary, strongly mixing sequences of random variables taking their values in a finite-dimensional Euclidean space, with the partial sums being normalized via matrix multiplication, with certain standard conditions being met, the…
Let $\mathcal{P}$ be a property of function $\mathbb{F}_p^n \to \{0,1\}$ for a fixed prime $p$. An algorithm is called a tester for $\mathcal{P}$ if, given a query access to the input function $f$, with high probability, it accepts when $f$…
A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…
In the paper we look for an elegant proof of the characterization of relatively compact families in $L^p-$spaces. At first glance, the suggested approach may seem convoluted and lengthy, but we spare no effort to argue that our proof is in…