Related papers: A Note on Minimal zero-sum sequences over ${\mathb…

Let $S=(a_1)\cdots(a_k)$ be a minimal zero-sum sequence over a finite cyclic group $G$. The index conjecture states that if $k=4$ and $\gcd(|G|,6)=1$, then $S$ has index 1. In this note we study the index conjecture and connect it to a…

Negative avoiding sequences of span $n$ are periodic sequences of elements from $\mathbb{Z}_k$ for some $k$ with the property that no $n$-tuple occurs more than once in a period and if an $n$-tuple does occur then its negative does not.…

A set of sequences is said to converge simultaneously if there exists an infinite subset $H$ of the index set $\omega$ such that all sequences converge when restricted to $H$. We discuss simultaneous convergence of sequences in the same or…

We consider restricted sumsets over field $F$. Let\begin{align*}C=\{a_1+\cdots+a_n:a_1\in A_1,\ldots,a_n\in A_n, a_i-a_j\notin S_{ij}\ \text{if}\ i\not=j\},\end{align*} where $S_{ij}(1\leqslant i\not=j\leqslant n)$ are finite subsets of $F$…

Assume that a convergent series of real numbers $\sum\limits_{n=1}^\infty a_n$ has the property that there exists a set $A\subseteq \N$ such that the series $\sum\limits_{n \in A} a_n$ is conditionally convergent. We prove that for a given…

An inner model M is MINIMAL if there is a class A such that <M,A> is amenable yet has no transitive proper elementary submodel. We study minimal universes in the context of 0#. For example we prove: If 0# exists then there is an inner model…

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

A $k$-positive matrix is a matrix where all minors of order $k$ or less are positive. Computing all such minors to test for $k$-positivity is inefficient, as there are $\sum_{\ell=1}^k \binom{n}{\ell}^2$ of them in an $n\times n$ matrix.…

Using the polynomial method in additive number theory, this article establishes a new addition theorem for the set of subsums of a set satisfying $A\cap(-A)=\emptyset$ in $\mathbb{Z}/p\mathbb{Z}$:…

A set A of positive integers is called a h-bais of [0,n] if each integer in [0,n]is a sum of no more than h members of A. In this paper, we will give a new construction for h-basis.

For a sequence $\{a_n\}_{n\geq 0}$ of real numbers and for a parameter $0<p<1$, we define the sequence of its arithmetic means $\{a^*_n\}_{n\geq 0}$ and the sequence of its $p$-binomial means $\{a^p_n\}_{n\geq 0}$ as \begin{align*}…

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

In this paper, we study the minimal number of elements of maximal order within a zero-sumfree sequence in a finite Abelian p-group. For this purpose, in the general context of finite Abelian groups, we introduce a new number, for which…

A sequence $\Big(u_n\Big)_{n=0}^{\infty}$ is said to be convex if it satisfies the following inequality $$ 2u_n\leq u_{n-1}+u_{n+1}\qquad \mbox{for all}\qquad n\in\mathbb{N}. $$ We present several characterizations of convex sequences and…

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

Zero-schemes on smooth complex projective varieties, forcing all elements of ample and free linear systems to be reducible are studied. Relationships among the minimal length of such zero-schemes, the positivity of the line bundle…

A $k$-configuration is a collection of $k$ distinct integers $x_1,\ldots,x_k$ together with their pairwise arithmetic means $\frac{x_i+x_j}{2}$ for $1 \leq i < j \leq k$. Building on recent work of Filmus, Hatami, Hosseini and Kelman on…

The discrepancy of a binary string is the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. In this note we determine the minimal discrepancy that a…

Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…

The results of Bergelson-Host-Kra and Leibman say that a multiple polynomial correlation sequence can be decomposed into a sum of a nilsequence (a sequence defined by evaluating a continuous function along an orbit in a nilsystem) and a…