相关论文: An improvement of the asymptotic Elias bound for n…

Proof of the Froissart theorem is reconsidered in a different way to extract its necessary conditions. Two physical inputs, unitarity and absence of massless intermediate hadrons, are indisputable. Also important are mathematical properties…

This work revisits the constant stepsize stochastic approximation algorithm for tracking a slowly moving target and obtains a bound for the tracking error that is valid for the entire time axis, using the Alekseev non-linear variation of…

We give asymptotic lower bounds of the value for Bruss' optimal stopping problem with multiple stopping chances. It interestingly consists of the asymptotic threshold values in the optimal multiple stopping strategy. Another interesting…

We design an algorithm which finds an $\epsilon$-approximate stationary point (with $\|\nabla F(x)\|\le \epsilon$) using $O(\epsilon^{-3})$ stochastic gradient and Hessian-vector products, matching guarantees that were previously available…

Boundaries in gauge theory and gravity give rise to symmetries and charges at both finite and asymptotic distance. Due to their structural similarities, it is often held that soft modes are some kind of asymptotic limit of edge modes. Here,…

We derive a nonparametric higher-order asymptotic expansion for small-time changes of conditional characteristic functions of It\^o semimartingale increments. The asymptotics setup is of joint type: both the length of the time interval of…

We derive an asymptotic lower bound on the Shannon entropy $H$ of sums of $N$ arbitrary iid discrete random variables. The derived bound $H \geq \frac{r(X)}{2}\log(N) + {\it cst}$ is given in terms of the incommensurability rank $r(X)$ of…

We obtain non-symmetric upper and lower bounds on the rate of convergence of general monotone approximation/numerical schemes for parabolic Hamilton Jacobi Bellman Equations by introducing a new notion of consistency. We apply our general…

Disjunct matrices, also known as cover-free families and superimposed codes, are combinatorial arrays widely used in group testing. Among their variants, those that satisfy an additional combinatorial property called inclusiveness form a…

In this paper, we study the enumerative and asymptotic properties related to Hermitian $\ell$-complementary codes on the unitary space over $\F_{q^2}$. We provide some closed form expressions for the counting formulas of Hermitian…

The asymptotic spectrum of graphs, introduced by Zuiddam (arXiv:1807.00169, 2018), is the space of graph parameters that are additive under disjoint union, multiplicative under the strong product, normalized and monotone under homomorphisms…

The resurgence and asymptotic resurgence of an ideal in a polynomial ring are two statistics which measure the relationship between its regular and symbolic powers. We address two aspects of resurgence which can be studied via asymptotic…

We derive the local and central limit theorems for the Stirling numbers of the second kind by elementary means, obtaining as corollaries effective asymptotic estimates for the Bell numbers and for the moments of the distribution. We also…

This work comprises a detailed theoretical and computational study of the boundary value problem for transversely isotropic linear elastic bodies. General conditions for well-posedness are derived in terms of the material parameters. The…

In this paper we study the asymptotic behavior of minimal energy solutions to the Lane-Emden system $-\Delta u = v^p$ and $-\Delta v = u^q$ on bounded domains as the index $(p,q)$ approaches to the critical hyperbola from below. Precisely,…

We are concerned with minimax signal detection. In this setting, we discuss non-asymptotic and asymptotic approaches through a unified treatment. In particular, we consider a Gaussian sequence model that contains classical models as special…

We derive new and improved non-asymptotic deviation inequalities for the sample average approximation (SAA) of an optimization problem. Our results give strong error probability bounds that are "sub-Gaussian"~even when the randomness of the…

It is well known that high energy data alone do not discriminate between asymptotic $\ln s$ and $\ln^2s$ behavior of $pp$ and $\bar pp$ cross sections. By exploiting high quality low energy data, analyticity resolves this ambiguity in favor…

Consider the problem of packing Hamming balls of a given relative radius subject to the constraint that they cover any point of the ambient Hamming space with multiplicity at most $L$. For odd $L\ge 3$ an asymptotic upper bound on the rate…

New non-asymptotic random coding theorems (with error probability $\epsilon$ and finite block length $n$) based on Gallager parity check ensemble and Shannon random code ensemble with a fixed codeword type are established for discrete input…