Related papers: Bounds for the total variation distance between se…

A polynomial of degree $n$ in two variables is shown to be uniquely determined by its Radon projections taken over $[n/2]+1$ parallel lines in each of the $(2[(n+1)/2]+1)$ equidistant directions along the unit circle.

We study wildness of automorphisms of a polynomial ring in three variables in detail using the Shestakov-Umirbaev theory and its generalization.

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

Let $\{X_{i}, i\in J\}$ be a family of locally dependent non-negative integer-valued random variables with finite expectations and variances. We consider the sum $W=\sum_{i\in J}X_i$ and use Stein's method to establish general upper error…

Let Y be a random variable such that the moment generating function of Y exists in a neighborhood of the origin. The aim of this paper is to study probabilistic versions of the derangement polynomials, the derangement polynomials of type 2…

We derive two related novel bounds on single-variable marginal probability distributions in factor graphs with discrete variables. The first method propagates bounds over a subtree of the factor graph rooted in the variable, and the second…

In this paper, we study the fluctuations of sums of random variables with distribution defined as a mixture of light-tail and truncated heavy-tail distributions. We focus on the case when both the mixing coefficient and the truncation level…

Let $K$ be a convex body in $\mathbb{R}^d$. Let $X_K$ be a $d$-dimensional random vector distributed according to the Hadwiger-Wills density $\mu_K$ associated with $K$, defined as $\mu_K(x)=ce^{-\pi {\rm dist}^2(x,K)}$, $x\in…

The purpose of the present paper is to establish moderate deviation principles for a rather general class of random variables fulfilling certain bounds of the cumulants. We apply a celebrated lemma of the theory of large deviations…

Consider an $n\times n$ matrix polynomial $P(\lambda)$ and a set $\Sigma$ consisting of $k \le n$ distinct complex numbers. In this paper, a (weighted) spectral norm distance from $P(\lambda)$ to the matrix polynomials whose spectra include…

Analysing statistical properties of the normal forms of random braids, we observe that, except for an initial and a final region whose lengths are uniformly bounded (that is, the bound is independent of the length of the braid), the…

We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary…

We derive upper bounds on the tail conditional expectation of binomial and Poisson random variables. Those upper bounds are subsequently employed to the problem of obtaining non-asymptotic lower bounds on the probability that the…

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

Consider the general scalar balance law $\partial_t u + \Div f(t, x,u) = F(t,x,u)$ in several space dimensions. The aim of this note is to estimate the dependence of its solutions from the flow $f$ and from the source $F$. To this aim, a…

In this paper, we establish a fundamental connection between binomial parameters and means of bounded random variables. Such connection finds applications in statistical inference of means of bounded variables.

We present methods for computing the distance from a Boolean polynomial on $m$ variables of degree $m-3$ (i.e., a member of the Reed-Muller code $RM(m-3,m)$) to the space of lower-degree polynomials ($RM(m-4,m)$). The methods give…

In a graph, nodes can be characterized locally (with their degree $k$) or globally (e.g. with their average length path $\xi$ to other nodes). Here we investigate how $\xi$ depends on $k$. Our earlier algorithm of the construction of the…

In this paper, we derive formulas for the analytical calculation of the moments of the distance between two uniformly and independently distributed random points in an $n$-sided regular polygon. A number of closed form expressions is…

We define a notion of r-generalized column distances for the j-truncation of a convolutional code. Taking the limit as j tends to infinity allows us to define r-generalized column distances of a convolutional code. We establish some…