Results 11 to 20 of about 21,411 (263)

On the number of weighted zero-sum subsequences

open access: yesPeriodica Mathematica Hungarica, 2023
Let $G$ be a finite additive abelian group with exponent $d^kn, d,n>1,$ and $k$ a positive integer. For $S$ a sequence over $G$ and $A=\{1,2,\ldots,d^kn-1\}\setminus\{d^kn/d^i:i\in[1,k]\}, $ we investigate the lower bound of the number $N_{A,0}(S)$, which denotes the number of $A$-weighted zero-sum subsequences of $S.$ In particular, we prove that ...
Abílio Lemos   +3 more
openaire   +2 more sources

Ranking by weighted sum [PDF]

open access: yesEconomic Theory, 2020
AbstractWhen choosing an alternative that has multiple attributes, it is common to form a weighted sum ranking. In this paper, we provide an axiomatic analysis of the weighted sum criterion using a general choice framework. We show that a preference order has aweakweighted sum representation if it satisfies three basic axioms: Monotonicity, Translation
Tapan Mitra, Kemal Ozbek
openaire   +3 more sources

Sums of Gauss sums and weights of irreducible codes

open access: yesFinite Fields and Their Applications, 2005
This paper develops a matrix approach to compute a certain sum of Gauss sums that arises in the study of weights of irreducible codes. The authors have further derived a lower bound on the minimum weight of certain irreducible codes. Though the studies made have been restricted to binary codes, however, the methods of this paper applies to codes of odd
Fitzgerald, Robert W., Yucas, Joseph L.
openaire   +1 more source

Estimating Sum by Weighted Sampling [PDF]

open access: yes, 2007
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarantees on the estimated sum. In this paper we consider various sampling methods besides uniform sampling, in particular sampling a variable with probability proportional to its ...
Rajeev Motwani 0001   +2 more
openaire   +1 more source

On weighted zero-sum sequences

open access: yesAdvances in Applied Mathematics, 2012
24 pages. Accepted version for publication in Adv.
Sukumar Das Adhikari   +2 more
openaire   +2 more sources

Complete $f$-moment convergence for weighted sums of WOD arrays with statistical applications [PDF]

open access: yes, 2023
summary:Complete $f$-moment convergence is much more general than complete convergence and complete moment convergence. In this work, we mainly investigate the complete $f$-moment convergence for weighted sums of widely orthant dependent (WOD, for short)
Chen, Xi, Tao, Xinran, Wang, Xuejun
core   +1 more source

Homogeneous weights and exponential sums

open access: yesFinite Fields and Their Applications, 2003
Let \({\mathbb F}_{q}\) be a finite field of characteristic \(p\) with \(q=p^{ \mu}\) elements, and \(W_{l}({\mathbb F}_{q})\) the ring of Witt vectors of length \(l\) over \({\mathbb F}_{q}\). The ring \(W_{l}({\mathbb F}_{q})\) is a finite local ring with \(q^{l}\) elements. The maximal ideal of \(W_{l}({\mathbb F}_{q})\) is generated by \(p\), and \(
Voloch, José Felipe, Walker, Judy L.
openaire   +2 more sources

On the sum of Ricci-curvatures for weighted graphs [PDF]

open access: yesPure and Applied Mathematics Quarterly, 2021
In this paper, we generalize Lin-Lu-Yau's Ricci curvature to weighted graphs and give a simple limit-free definition. We prove two extremal results on the sum of Ricci curvatures for weighted graph. A weighted graph $G=(V,E,d)$ is an undirected graph $G=(V,E)$ associated with a distance function $d\colon E\to [0,\infty)$.
Bai, Shuliang   +3 more
openaire   +2 more sources

Evaluations of a Weighted Average of Gauss Sums

open access: yes, 2021
In this paper, we perform a further investigation for a weighted average of Gauss sums. By making use of some properties of the cotangent function and the Bernoulli polynomials, we explicitly evaluate the weighted average of Gauss sums in terms of the ...
Wen-Kai Shao, Yuan He
core   +1 more source

Second moments of Dirichlet $L$-functions weighted by Kloosterman sums [PDF]

open access: yes, 2012
summary:For the general modulo $q\geq 3$ and a general multiplicative character $\chi $ modulo $q$, the upper bound estimate of $ |S(m, n, 1, \chi , q)| $ is a very complex and difficult problem. In most cases, the Weil type bound for $ |S(m, n, 1, \chi ,
Wang, Tingting
core   +1 more source

Home - About - Disclaimer - Privacy