Related papers: Long $n$-zero-free sequences in finite cyclic grou…

This paper studies infinite acyclic complexes of finitely generated free modules over a commutative noetherian local ring $(R,m)$ with $m^3=0$. Conclusive results are obtained on the growth of the ranks of the modules in acyclic complexes,…

Let $n$ be a large number. A subset $A$ of $Z_n$ is complete if $S_A = Z_n$, where $S_A$ is the collection of the subset sums of $A$. Olson proved that if $n$ is a prime and $|A|> 2n^{1/2} $, then $S_A$ is complete. We show that a similar…

A finite subset $A$ of an abelian group $G$ is said to be zero-free if the identity element of $G$ cannot be written as a sum of distinct elements from $A$. In this article we study the structure of zero-free subsets of $Z/pZ$ the…

Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…

For a finite abelian group $G$ and a positive integer $k$, let $s_{k}(G)$ denote the smallest integer $\ell\in\mathbb{N}$ such that any sequence $S$ of elements of $G$ of length $|S|\geq\ell$ has a zero-sum subsequence with length $k$. The…

Let $G$ be a multiplicative finite group and $S=a_1\cdot\ldots\cdot a_k$ a sequence over $G$. We call $S$ a product-one sequence if $1=\prod_{i=1}^ka_{\tau(i)}$ holds for some permutation $\tau$ of $\{1,\ldots,k\}$. The small Davenport…

An $(n,R)$-covering sequence is a cyclic sequence whose consecutive $n$-tuples form a code of length $n$ and covering radius $R$. Using several construction methods improvements of the upper bounds on the length of such sequences for $n…

A finite group $G$ is called a Schur group if any $S$-ring over $G$ is associated in a natural way with a subgroup of $Sym(G)$ that contains all right translations. We prove that the groups $\mathbb{Z}_3\times \mathbb{Z}_{3^n}$, where…

Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes. In this paper we discuss this conjectures and their relations…

A (d-parameter) basic nilsequence is a sequence of the form \psi(n)=f(a^{n}x), n \in Z^{d}, where x is a point of a compact nilmanifold X, a is a translation on X, and f is a continuous function on X; a nilsequence is a uniform limit of…

In [J. Algebra 452 (2016), 372-389], we characterise when the sequence of free subgroup numbers of a finitely generated virtually free group $\Gamma$ is ultimately periodic modulo a given prime power. Here, we show that, in the remaining…

Let $(R, \mathfrak m)$ be a Noetherian local ring. In this work we use the notion of (FC)-sequences, as defined in \cite{perez-bedregal1}, to present some results concerning reductions and the positivity of mixed multiplicities of a finite…

A length $n$ cosine sum is an expression of the form $\cos a_1\theta + \cdots + \cos a_n\theta$ where $a_1 < \cdots < a_n$ are positive integers, and a length $n$ Newman polynomial is an expression of the form $z^{a_1} + \cdots + z^{a_n}$…

A set of elements of a finite abelian group is called sum-free if it contains no Schur triple, i.e., no triple of elements $x,y,z$ with $x+y=z$. The study of how large the largest sum-free subset of a given abelian group is had started more…

We prove certain polynomial relations between the values of complex irreducible characters of general finite symmetric groups. We use it to find some sets of conjugacy classes such that no finite symmetric group has a complex irreducible…

We survey properties of the set of possible exponents of subsets of $\Z_n$ (equivalently, exponents of primitive circulant digraphs on $n$ vertices). Let $E_n$ denote this exponent set. We point out that $E_n$ contains the positive integers…

A sequence $D=(d_1,d_2,\ldots,d_n)$ of non-negative integers is called a graphic sequence if there is a simple graph with vertices $v_1,v_2,\ldots,v_n$ such that the degree of $v_i$ is $d_i$ for $1\leq i\leq n$. Given a graph theoretical…

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

For a finite (not necessarily Abelian) group $(\Gamma,\cdot)$, let $n(\Gamma) \in \mathbb{N}$ denote the smallest positive integer $n$ such that for every labelling of the arcs of the complete digraph of order $n$ using elements from…

The set of all $\ell$-zero-sumfree subsets of $\mathbb{Z}/n\mathbb{Z}$ is a simplicial complex denoted by $\Delta_{n,\ell}$ We create an algorithm via defining a set of integer partitions we call $(n,\ell)$-congruent partitions in order to…