Related papers: A general lower bound for the asymptotic convergen…
Asymptotic $L_p$-convergence, which resembles convergence in $L_p$, was introduced to address a question in diffusive relaxation. This note aims to compare asymptotic $L_p$-convergence with convergence in measure and in weak $L_p$ spaces.…
In this paper, we provide a rigorous derivation of asymptotic formula for the largest eigenvalues using the convergence estimation of the eigenvalues of a sequence of self-adjoint compact operators of perturbations resulting from the…
We prove an asymptotically tight lower bound on $|A+\lambda A|$ for $A\subset \mathbb{C}$ and algebraic integer $\lambda$. The proof combines strong version of Freiman's theorem, structural theorem on dense subsets of a hypercubic lattice…
We consider the proportion of zero entries in the character table of a sequence of reductive groups over a finite field. We prove an asymptotic lower bound when the reductive group is fixed and the size of the finite field increases.…
This work gives a general approach to the determination of the asymptotic behavior of the sums of functions of primes based on the distribution of primes. It refines the estimate of the remainder term of the asymptotic expansion of the sums…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
In this work, we establish an asymptotic limit of almost-lossless compression of a random, finite alphabet tensor which admits a low-rank canonical polyadic decomposition.
We define the notion of asymptotically free for locally restricted compositions, which means roughly that large parts can often be replaced by any larger parts. Two well-known examples are Carlitz and alternating compositions. We show that…
{The first version of this text was written and submitted to a journal on April, 12, 2018. This second version was submitted on April, 9, 2019.} We investigate the existence of subsets $A$ and $B$ of $\mathbb{N}:=\{0,1,2,\dots\}$ such that…
We give asymptotic approximations of the zeros of certain high degree polynomials. The zeros can be used to compute the filter coefficients in the dilation equations which define the compactly supported orthogonal Daubechies wavelets.…
In this paper, we present an improved continued fraction approximation of the Wallis ratio. This approximation is fast in comparison with the recently discovered asymptotic series. We also establish the double-side inequality related to…
We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…
The notion of Fej\'er monotonicity is instrumental in unifying the convergence proofs of many iterative methods, such as the Krasnoselskii-Mann iteration, the proximal point method, the Douglas-Rachford splitting algorithm, and many others.…
We propose a formula for finding the horizontal, oblique or curvilinear asymptote of any rational polynomial function of any positive degree, as a sum of matrix determinants formed directly from the coefficients of the terms in the given…
We construct a probability model seemingly unrelated to the considered stochastic process of coagulation and fragmentation. By proving for this model the local limit theorem, we establish the asymptotic formula for the partition function of…
We consider simple random walk on Z^d, d bigger or equal to 3. Motivated by the work of A.-S. Sznitman and the author in arXiv:1304.7477 and arXiv:1310.2177, we investigate the asymptotic behaviour of the probability that a large body gets…
Approximate Bayesian computation allows for statistical analysis in models with intractable likelihoods. In this paper we consider the asymptotic behaviour of the posterior distribution obtained by this method. We give general results on…
In this paper we continue our earlier investigations into the asymptotic behaviour of infinite systems of coupled differential equations. Under the mild assumption that the so-called characteristic function of our system is completely…
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
We establish a lower bound for the energy of a complex unit gain graph in terms of the matching number of its underlying graph, and characterize all the complex unit gain graphs whose energy reaches this bound.