Related papers: A general lower bound for the asymptotic convergen…

We give a "limit-free formula" simplifying the computation of the topological entropy for topological automorphisms of totally disconnected locally compact groups. This result allows us to extend several basic properties of the topological…

Let F_q be the finite field of q elements. Let H be a multiplicative subgroup of F_q^*. For a positive integer k and element b\in F_q, we give a sharp estimate for the number of k-element subsets of H which sum to b.

We explore the use of correlation with simple functions to get lower bounds for arithmetic quantities. In particular, we apply this idea to the power moments of the error term when counting visible lattice points in large spheres.

Coulomb wave functions are difficult to compute numerically for extremely low energies, even with direct numerical integration. Hence, it is more convenient to use asymptotic formulas in this region. It is the object of this paper to derive…

We propose an entropy function for simplicial complices. Its value gives the expected cost of the optimal encoding of sequences of vertices of the complex, when any two vertices belonging to the same simplex are indistinguishable. We show…

This paper presents a new derivation method of converse bounds on the non-asymptotic achievable rate of discrete weakly symmetric memoryless channels. It is based on the finite blocklength statistics of the channel, where with the use of an…

The aim of this work is to algebraically describe the relative generalized Hamming weights of evaluation codes. We give a lower bound for these weights in terms of a footprint bound. We prove that this bound can be sharp. We compute the…

The best known method to give a lower bound for the Noether number of a given finite group is to use the fact that it is greater than or equal to the Noether number of any of the subgroups or factor groups. The results of the present paper…

In this note, we give a detailed proof of an asymptotic for averages of coefficients of a class of degree three $L$-functions which can be factorized as a product of a degree one and a degree two $L$-functions. We emphasize that we can…

Let U be a homogeneous variety over Q of a linear algebraic group. Choose an integral model and assume the existence of infinitely many integral points. Then one would like to give an asymptotic count of integral points of bounded height…

We show that the type function of a space with finite asymptotic dimension estimates its Hilbert (or any $l^p$) compression. The method allows to obtain the lower bound of the compression of the lamplighter group $Z\wr Z$, which has…

We give lower bounds on the case of worst inhomogeneous approximation.

We consider the Helmholtz equation in an angular sector partially covered by a homogeneous layer of small thickness, denoted $\varepsilon$. We propose in this work an asymptotic expansion of the solution with respect to $\varepsilon$ at any…

This paper presents compact notations for concentration inequalities and convenient results to streamline probabilistic analysis. The new expressions describe the typical sizes and tails of random variables, allowing for simple operations…

We establish asymptotic bounds for the number of partitions of $[n]$ avoiding a given partition in Klazar's sense, obtaining the correct answer to within an exponential for the block case. This technique also enables us to establish a…

Let $f$ be an arithmetic function satisfying some simple conditions. The aim of this paper is to establish an asymptotical formula for the quantity \[ S_f(x):=\sum_{n\leq x}\frac{f([x/n])}{[x/n]} \] as $x\rightarrow\infty$, where $[t]$ is…

The algebraic properties of formal power series, whose coefficients show factorial growth and admit a certain well-behaved asymptotic expansion, are discussed. It is shown that these series form a subring of $\mathbb{R}[[x]]$. This subring…

We derive asymptotic estimates at infinity for positive harmonic functions in a large class of non-smooth unbounded domains. These include domains whose sections, after rescaling, resemble a Lipschitz cylinder or a Lipschitz cone, e.g.,…

We consider the fragmentation at nodes of the L\'{e}vy continuous random tree introduced in a previous paper. In this framework we compute the asymptotic for the number of small fragments at time $\theta$. This limit is increasing in…

We prove a sharp lower bound on the curvatures of non-flat ASD connections over the cylinder.