English
Related papers

Related papers: A Note on an Upper-Bound for the Sum of a Class K …

200 papers

We consider the problem of deriving upper bounds on the parameters of sum-rank-metric codes, with focus on their dimension and block length. The sum-rank metric is a combination of the Hamming and the rank metric, and most of the available…

Combinatorics · Mathematics 2023-10-30 Aida Abiad , Antonina P. Khramova , Alberto Ravagnani

This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all polynomial-bounded functions that can be obtained by…

Computational Complexity · Computer Science 2016-11-22 Sergey Volkov

We consider a class of stationary processes exhibiting both long-range dependence and heavy tails. Separate limit theorems for sums and for extremes have been established recently in literature with novel objects appearing in the limits. In…

Probability · Mathematics 2023-09-12 Shuyang Bai , He Tang

We examine exponential sums of the form $\sum_{n \le X} w(n) e^{2\pi i\alpha n^k}$, for $k=1,2$, where $\alpha$ satisfies a generalized Diophantine approximation and where $w$ are different arithmetic functions that might be multiplicative,…

Number Theory · Mathematics 2024-12-31 Anji Dong , Nicolas Robles , Alexandru Zaharescu , Dirk Zeindler

In this paper we provide in $\bFp$ expanding lower bounds for two variables functions $f(x,y)$ in connection with the product set or the sumset. The sum-product problem has been hugely studied in the recent past. A typical result in…

Number Theory · Mathematics 2016-03-27 Norbert Hegyvári , François Hennecart

Expansion of higher transcendental functions in a small parameter are needed in many areas of science. For certain classes of functions this can be achieved by algebraic means. These algebraic tools are based on nested sums and can be…

High Energy Physics - Phenomenology · Physics 2015-06-25 Sven Moch , Peter Uwer , Stefan Weinzierl

Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problems in mathematical logic, model-checking, program analysis and…

Logic in Computer Science · Computer Science 2015-03-19 Yang Cai , Ting Zhang

We provide estimates on the fat-shattering dimension of aggregation rules of real-valued function classes. The latter consists of all ways of choosing $k$ functions, one from each of the $k$ classes, and computing a pointwise function of…

Functional Analysis · Mathematics 2023-09-12 Idan Attias , Aryeh Kontorovich

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

Number Theory · Mathematics 2026-03-09 Artyom Radomskii

We study the variance of sums of the $k$-fold divisor function $d_k(n)$ over sparse arithmetic progressions, with averaging over both residue classes and moduli. In a restricted range, we confirm an averaged version of a recent conjecture…

Number Theory · Mathematics 2019-08-26 Brad Rodgers , Kannan Soundararajan

Various product and sum relationships are established using special functions, specifically involving Special functions. These relationships are derived from formulas inspired by the finite sum that incorporates the Hurwitz-Lerch zeta…

Number Theory · Mathematics 2023-05-25 Robert Reynolds

We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…

Number Theory · Mathematics 2014-02-26 Xuancheng Shao

In this note we generalize the trace inequality derived by [1] to the case where the number of terms of the sum (denoted by K) is arbitrary.

Functional Analysis · Mathematics 2010-11-30 E. V. Belmega , M. Jungers , S. Lasaulce

We compute the variances of sums in arithmetic progressions of arithmetic functions associated with certain $L$-functions of degree two and higher in $\mathbb{F}_q[t]$, in the limit as $q\to\infty$. This is achieved by establishing…

Number Theory · Mathematics 2017-03-28 Chris Hall , Jonathan P. Keating , Edva Roditty-Gershon

Using two results of Garkavi, Medvedev and Khavinson, we give sufficient conditions for proximinality of sums of two ridge functions with bounded and continuous summands in the spaces of bounded and continuous multivariate functions…

Classical Analysis and ODEs · Mathematics 2007-08-30 Vugar Ismailov

This note deals with the relationship between the total number of $k$-walks in a graph, and the sum of the $k$-th powers of its vertex degrees. In particular, it is shown that the the number of all $k$-walks is upper bounded by the sum of…

Combinatorics · Mathematics 2012-06-06 M. A. Fiol , E. Garriga

From two q-summation formulas we deduce certain series expansion formulas involving the q-gamma function. With these formulas we can give q-analogues of series expansions for certain constants.

Number Theory · Mathematics 2018-09-18 Bing He , Hongcun Zhai

We prove the inequality sum_{k=1}^infty (-1)^{k+1} r^k cos(k*phi) (k+2)^{-1} < sum_{k=1}^infty(-1)^{k+1} r^k (k+2)^{-1} for 0 < r <= 1 and 0 < phi < pi. For the case r = 1 we give two proofs. The first one is by means of a general numerical…

Classical Analysis and ODEs · Mathematics 2014-03-25 Juan Arias-de-Reyna , Jan van de Lune

This note investigates the relation between squeezing function and its generalizations. Using the relation obtained, we present an alternate method to find expression of generalized squeezing function of unit ball corresponding to the…

Complex Variables · Mathematics 2022-11-30 Naveen Gupta , Sanjay Kumar Pant

This paper proposes an easy-to-compute upper bound for the overlap index between two probability distributions without requiring any knowledge of the distribution models. The computation of our bound is time-efficient and memory-efficient…

Machine Learning · Computer Science 2024-12-02 Hao Fu , Prashanth Krishnamurthy , Siddharth Garg , Farshad Khorrami