Related papers: A New Factorization Property of the Selfdecomposab…
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)…
Extension of two known facts concerning subordination is made. The first fact is that, in subordination of 1-dimensional Brownian motion with drift, selfdecomposability is inherited from subordinator to subordinated. This is extended to…
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tractable, in the sense that the posterior is also decomposable and…
Multiplicative self-decomposable laws describe random variables that can be decomposed into a product of a scaled-down version of themselves and an independent residual term. Shanbhag et al.~(1977) have shown that the gamma distribution is…
We present a new kind of structural Markov property for probabilistic laws on decomposable graphs, which allows the explicit control of interactions between cliques, so is capable of encoding some interesting structure. We prove the…
Generalizing the $\omega$-categorical context, we introduce a notion, which we call the Lascar Property, that allows for a fine analysis of the topological isomorphisms between automorphism groups of countable structures satisfying this…
We the study of the monodromy of local systems with bounded ramification on a punctured disc defined over a non-archimedean valued field of characteristic zero. First, we construct the local Fourier transforms and we establish their main…
For any field $K$ and for a completely arbitrary graph $E$, we characterize the Leavitt path algebras $L_K(E)$ that are indecomposable (as a direct sum of two-sided ideals) in terms of the underlying graph. When the algebra decomposes, it…
The one-dimensional Dickman distribution arises in various stochastic models across number theory, combinatorics, physics, and biology. Recently, a definition of the multidimensional Dickman distribution has appeared in the literature,…
We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…
In this article we recover the distribution function (and possible density) of an arbitrary random variable that is subject to an additive measurement error. This problem is also known as deconvolution and has a long tradition in…
In this note we consider the Hausdorff dimension of self-affine sets with random perturbations. We extend previous work in this area by allowing the random perturbation to be distributed according to distributions with unbounded support as…
The probability distribution function for an out of equilibrium system may sometimes be approximated by a physically motivated "trial" distribution. A particularly interesting case is when a driven system (e.g., active matter) is…
We construct a theory of distributions in the setting of analysis on post-critically finite self-similar fractals, and on fractafolds and products based on such fractals. The results include basic properties of test functions and…
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…
The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…
Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…
We provide a Maltsev characterization of congruence distributive varieties by showing that a variety $\mathcal {V}$ is congruence distributive if and only if the congruence identity $\alpha \cap (\beta \circ \gamma \circ \beta ) \subseteq…
We formulate the statistics of the discrete multicomponent fragmentation event using a methodology borrowed from statistical mechanics. We generate the ensemble of all feasible distributions that can be formed when a single integer…