Related papers: On Partial Sums in Cyclic Groups

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

We investigate compositional iteration of fractional order for transseries. For any large positive transseries $T$ of exponentiality 0, there is a family $T^{[s]}$ indexed by real numbers $s$ corresponding to teration of order $s$. It is…

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…

For a partition {\lambda} and a prime p, we prove a necessary and sufficient condition for there exists a composition {\delta} such that {\delta} can be obtained from {\lambda} after rearrangement and all the partial sums of {\delta} are…

By constructing suitable nonnegative exponential sums we give upper bounds on the cardinality of any set $B_q$ in cyclic groups $\ZZ_q$ such that the difference set $B_q-B_q$ avoids cubic residues modulo $q$.

In this paper we prove that the nonzero elements of a finite field with odd characteristic can be partitioned into pairs with prescribed difference (maybe, with some alternatives) in each pair. The algebraic and topological approaches to…

For any positive integer $n$, let ${\rm C}_{n}$ be the cyclic group of order $n$. We determine all possible values of the integer group determinant of ${\rm C}_{2}^{2} \rtimes C_{4}$.

We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

An \emph{indexing} of a finite set $S$ is a bijection $D : \{1,...,|S|\} \rightarrow S$. We present an indexing for the set of quadratic residues modulo $N$ that is decodable in polynomial time on the size of $N$, given the factorization of…

The partial Stirling numbers T_n(k) used here are defined as the sum over odd values of i of (n choose i) i^k. Their 2-exponents nu(T_n(k)) are important in algebraic topology. We provide many specific results, applying to all values of n,…

We say that $M$ and $S$ form a \textsl{splitting} of $G$ if every nonzero element $g$ of $G$ has a unique representation of the form $g=ms$ with $m\in M$ and $s\in S$, while $0$ has no such representation. The splitting is called {\it…

We present a survey of exact and asymptotic formulas on the number of cyclic subgroups and total number of subgroups of the groups ${\Bbb Z}_{n_1} \times \cdots \times {\Bbb Z}_{n_k}$, where $k\ge 2$ and $n_1,\ldots,n_k$ are arbitrary…

A partial group with $n+1$ elements is, when regarded as a symmetric simplicial set, of dimension at most $n$. This dimension is $n$ if and only if the partial group is a group. As a consequence of the first statement, finite partial groups…

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

We show that the spectral set conjecture by Fuglede holds in the setting of cyclic groups of order $p^n q$, where $p$, $q$ are distinct primes and $n\geq1$. This means that a subset $E$ of such a group $G$ tiles the group by translation…

Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…

A cyclic order may be thought of informally as a way to seat people around a table, perhaps for a game of chance or for dinner. Given a set of agents such as $\{A,B,C\}$, we can formalize this by defining a cyclic order as a permutation or…

In this paper, we present a novel approach for calculating the set of subgroups of a finite group, focusing on cyclic subgroups, and using it to establish the quantity of all subgroups in the direct product of two groups. Specifically, we…