English
Related papers

Related papers: Arithmetic-Progression-Weighted Subsequence Sums

200 papers

Sequence partition problems arise in many fields, such as sequential data analysis, information transmission, and parallel computing. In this paper, we study the following partition problem variant: given a sequence of $n$ items…

Data Structures and Algorithms · Computer Science 2022-10-12 Kai Jin , Danna Zhang , Canhui Zhang

Let $t\geq 1$, let $A$ and $B$ be finite, nonempty subsets of an abelian group $G$, and let $A\pp{i} B$ denote all the elements $c$ with at least $i$ representations of the form $c=a+b$, with $a\in A$ and $b\in B$. For $|A|, |B|\geq t$, we…

Number Theory · Mathematics 2008-03-19 David J. Grynkiewicz

The subset sum problem is one of the simplest and most fundamental NP-hard problems in combinatorial optimization. We consider two extensions of this problem: The subset sum problem with digraph constraint (SSG) and subset sum problem with…

Discrete Mathematics · Computer Science 2020-06-24 Frank Gurski , Dominique Komander , Carolin Rehs

A subset of an abelian group is {\em sequenceable} if there is an ordering $(x_1, \ldots, x_k)$ of its elements such that the partial sums $(y_0, y_1, \ldots, y_k)$, given by $y_0 = 0$ and $y_i = \sum_{j=1}^i x_i$ for $1 \leq i \leq k$, are…

Combinatorics · Mathematics 2022-04-04 Simone Costa , Stefano Della Fiore , M. A. Ollis , Sarah Z. Rovner-Frydman

We study for bounded multiplicative functions $f$ sums of the form \begin{align*} \sum_{\substack{n\leq x \atop n\equiv a\pmod q}}f(n), \end{align*} establishing that their variance over residue classes $a \pmod q$ is small as soon as…

Number Theory · Mathematics 2023-08-24 Oleksiy Klurman , Alexander P. Mangerel , Joni Teräväinen

Let $\mathcal S$ be a multiset of integers. We say $\mathcal S$ is a $\textit{zero-sum sequence}$ if the sum of its elements is 0. We study zero-sum sequences whose elements lie in the interval $[-k,k]$ such that no subsequence of length…

Number Theory · Mathematics 2018-08-24 Aaron Berger

A pair of non-empty subsets $(W,W')$ in an abelian group $G$ is an additive complement pair if $W+W'=G$. $W'$ is said to be minimal to $W$ if $W+(W'\setminus \{w'\}) \neq G, \forall \,w'\in W'$. In general, given an arbitrary subset in a…

Combinatorics · Mathematics 2021-06-24 Arindam Biswas , Jyoti Prakash Saha

Simple, or Kleinian, singularities are classified by Dynkin diagrams of type ADE. Let g be the corresponding finite-dimensional Lie algebra, and W its Weyl group. The set of g-invariants in the basic representation of the affine Kac-Moody…

Quantum Algebra · Mathematics 2019-02-20 Bojko Bakalov , Todor Milanov

Let $G$ be a finite abelian group and $s$ be a positive integer. A subset $A$ of $G$ is called a {\em perfect $s$-basis of $G$} if each element of $G$ can be written uniquely as the sum of at most $s$ (not-necessarily-distinct) elements of…

Number Theory · Mathematics 2022-11-28 Bela Bajnok , Connor Berson , Hoang Anh Just

This paper offers two elementary yet precise derivations of an exact formula \[ W(n) = \sum_{i=1} ^{n} \lceil \lg i \rceil = n \lceil \lg n \rceil - 2^{\lceil \lg n \rceil} + 1 \] for the maximum number $ W(n) $ of comparisons of keys…

Data Structures and Algorithms · Computer Science 2017-03-01 Marek A. Suchenek

The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…

Formal Languages and Automata Theory · Computer Science 2022-05-20 S Akshay , Supratik Chakraborty , Debtanu Pal

Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…

Group Theory · Mathematics 2013-12-19 Michael Larsen , Pham Huu Tiep

We prove that if $d \ge 2$ is an integer, $G$ is a finite abelian group, $Z_0$ is a subset of $G$ not contained in any strict coset in $G$, and $E_1,\dots,E_d$ are dense subsets of $G^n$ such that the sumset $E_1+\dots+E_d$ avoids $Z_0^n$…

Combinatorics · Mathematics 2024-11-22 Thomas Karam , Peter Keevash

This paper studies the asymptotic properties of weighted sums of the form $Z_n=\sum_{i=1}^n a_i X_i$, in which $X_1, X_2, \ldots, X_n$ are i.i.d.~random variables and $a_1, a_2, \ldots, a_n$ correspond to either eigenvalues or singular…

Probability · Mathematics 2022-09-26 Angel Chavez , Jacob Waldor

Let G be any abelian group and {a_sG_s}_{s=1}^k be a finite system of cosets of subgroups G_1,...,G_k. We show that if {a_sG_s}_{s=1}^k covers all the elements of G at least m times with the coset a_tG_t irredundant then [G:G_t]\le 2^{k-m}…

Group Theory · Mathematics 2008-03-11 Günter Lettl , Zhi-Wei Sun

If $G$ is a finite Abelian group, define $s_{k}(G)$ to be the minimal $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. Recently Bitz et al. proved that if $n = exp(G)$, then…

Combinatorics · Mathematics 2017-12-07 Jesse Geneson

Let $p$ be any odd prime number. Let $k$ be any positive integer such that $2\leq k\leq [\frac{p+1}3]+1$. Let $S = (a_1,a_2,...,a_{2p-k})$ be any sequence in ${\Bbb Z}_p$ such that there is no subsequence of length $p$ of $S$ whose sum is…

Combinatorics · Mathematics 2007-05-23 W D Gao , A Panigrahi , R Thangadurai

Given a finite subset A of an abelian group G, we study the set k \wedge A of all sums of k distinct elements of A. In this paper, we prove that |k \wedge A| >= |A| for all k in {2,...,|A|-2}, unless k is in {2,|A|-2} and A is a coset of an…

Combinatorics · Mathematics 2012-06-27 Benjamin Girard , Simon Griffiths , Yahya Ould Hamidoune

Let $G$ be an infinite abelian group with $|2G|=|G|$. We show that if $G$ is not the direct sum of a group of exponent 3 and the group of order 2, then $G$ possesses a perfect additive basis; that is, there is a subset $S\subseteq G$ such…

Number Theory · Mathematics 2009-01-13 Sergei V. Konyagin , Vsevolod F. Lev

Let $G$ be a finite cyclic group. Every sequence $S$ of length $l$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be…

Combinatorics · Mathematics 2013-03-08 Jiangtao Peng , Yuanlin Li
‹ Prev 1 4 5 6 7 8 10 Next ›