相关论文: An Explicit Upper Bound of Generalized Quadratic G…
The correlation properties of sequences form a focal point in the design of multiple access systems of communications. Such a system must be able to serve a number of simultaneous users while keeping interference low. A popular choice for…
Su et al. proposed several new classes of quaternary sequences of even length with optimal autocorrelation interleaved by twin-prime sequences pairs, GMW sequences pairs or binary cyclotomic sequences of order four in \cite{S1}. In this…
We present a general approach to the problem of determining tight asymptotic lower bounds for generalized central moments of the optimal alignment score of two independent sequences of i.i.d. random variables. At first, these are obtained…
We study sequential prediction of real-valued, arbitrary and unknown sequences under the squared error loss as well as the best parametric predictor out of a large, continuous class of predictors. Inspired by recent results from…
The main purpose of this paper is to study higher order moments of the generalized quadratic Gauss sums weighted by $L$-functions using estimates for character sums and analytic methods. We find asymptotic formulas for three character sums…
A quasi-complementary sequence set (QCSS) refers to a set of two-dimensional matrices with low non-trivial aperiodic auto- and cross- correlation sums. For multicarrier code-division multiple-access applications, the availability of large…
Sequences that are defined by multisums of hypergeometric terms with compact support occur frequently in enumeration problems of combinatorics, algebraic geometry and perturbative quantum field theory. The standard recipe to study the…
We prove a new generalization bound that shows for any class of linear predictors in Gaussian space, the Rademacher complexity of the class and the training error under any continuous loss $\ell$ can control the test error under all Moreau…
In this article, $q$-regular sequences in the sense of Allouche and Shallit are analysed asymptotically. It is shown that the summatory function of a regular sequence can asymptotically be decomposed as a finite sum of periodic fluctuations…
In this paper, we present explicit description on the additive characters, multiplicative characters and Gauss sums over a local ring. As an application, based on the additive characters and multiplicative characters satisfying certain…
An asymptotic expansion for the generalised quadratic Gauss sum $$S_N(x,\theta)=\sum_{j=1}^{N} \exp (\pi ixj^2+2\pi ij\theta),$$ where $x$, $\theta$ are real and $N$ is a positive integer, is obtained as $x\rightarrow 0$ and…
The Gromov-Wasserstein (GW) problem is an extension of the classical optimal transport problem to settings where the source and target distributions reside in incomparable spaces, and for which a cost function that attributes the price of…
Gaussian periods are cyclotomic integers with a long history in number theory and connections to problems in combinatorics. We investigate the asymptotic behavior of the absolute norm of a Gaussian period and provide a rate of convergence…
Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…
We investigate the problem of jointly testing multiple hypotheses and estimating a random parameter of the underlying distribution in a sequential setup. The aim is to jointly infer the true hypothesis and the true parameter while using on…
We derive the first exact, rigorous but practical, globally valid remainder terms for asymptotic expansions about saddles and contour endpoints of arbitrary order degeneracy derived from the method of steepest descents. The exact remainder…
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…
In this paper, we investigate the size of moments of quadratic character sums averaged over the family of fundamental discriminants. We obtain an asymptotic formula for all integer moments in a restricted range of parameters using a…
We derive optimal asymptotic and non-asymptotic lower bounds on the Widom factors for weighted Chebyshev and orthogonal polynomials on compact subsets of the real line. In the Chebyshev case we extend the optimal non-asymptotic lower bound…
Since the $\mathrm{Fibonacci}$ sequence has good properties, it's important in theory and applications, such as in combinatorics, cryptography, and so on. In this paper, for the generalized Fibonacci sequence…