Related papers: Finite Free Convolution: Infinitesimal Distributio…
A probability inequality is proved for n-fold convolutions of a smooth cumulative distribution function on (0,infinity)x...x(0,infinity), which is multivariate totally positive of order 2 (MTP2). This inequality is better than an inequality…
A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…
In this paper, we define finitely additive, probability and modular functions over semiring-like structures. We investigate finitely additive functions with the help of complemented elements of a semiring. We also generalize some classical…
A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that…
We introduce a theory of probability in $\lambda$-rings designed to efficiently describe random variables valued in multisets of complex numbers, varieties over a field, or other similar enriched settings. A key role is played by the…
Let $n=\prod_p p^{\nu_p(n)}$ denote the canonical factorization of $n\in \N$. The binomial convolution of arithmetical functions $f$ and $g$ is defined as $(f\circ g)(n)=\sum_{d\mid n} (\prod_p \binom{\nu_p(n)}{\nu_p(d)}) f(d)g(n/d),$ where…
The spread between two lines in rational trigonometry replaces the concept of angle, allowing the complete specification of many geometrical and dynamical situations which have traditionally been viewed approximately. This paper…
Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…
Using an approach based, amongst other things, on Proposition 1 of Kaluza (1928), Goldie (1967) and, using a different approach based especially on zeros of polynomials, Steutel (1967) have proved that each nondegenerate distribution…
We propose a random graph model with preferential attachment rule and \emph{edge-step functions} that govern the growth rate of the vertex set. We study the effect of these functions on the empirical degree distribution of these random…
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…
In two papers entitled ``Two generalizations of almost perfect nonlinearity" and ``On the vector subspaces of $\mathbb F_{2^n}$ over which the multiplicative inverse function sums to zero", the first author has introduced and studied the…
The approximation properties of the finite element method can often be substantially improved by choosing smooth high-order basis functions. It is extremely difficult to devise such basis functions for partitions consisting of arbitrarily…
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…
In this article we introduce powerful tools and techniques from invariant theory to free analysis. This enables us to study free maps with involution. These maps are free noncommutative analogs of real analytic functions of several…
The key result in the paper concerns two transformations, Phi(rho, psi) and B_t(psi) on states on the algebra of non-commutative polynomials, or equivalently on joint distributions of d-tuples of non-commuting operators. These…
We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…
Convex algebras, also called (semi)convex sets, are at the heart of modelling probabilistic systems including probabilistic automata. Abstractly, they are the Eilenberg-Moore algebras of the finitely supported distribution monad.…
The amalgamated $T$-transform of a non-commutative distribution was introduced by K.~Dykema. It provides a fundamental tool for computing distributions of random variables in Voiculescu's free probability theory. The $T$-transform…
The goal of this paper is to attract attention of the reader to a dimension-free geometric inequality that can be proved using the classical needle decomposition. This inequality allows us to derive sharp dimension-free estimates for the…