69 problems
Classification conjecture. The only possibilities for are
Let be a prime, let be the cyclic group of order , and let denote the set of minimal zero-sum sequences over this group. A set…
Let be a positive integer, let be a sequence of length over the cyclic group , and call a subsequence of index one when its index is one. Lemke-Kleitm…
Let be the cyclic group of order , and let be a minimal zero-sum sequence over of length . The index is the smallest number in … where…
For an integer , let denote the smallest prime number that does not divide . For the cyclic group , let de…
Let be a prime, and let . An ordering of is valid if its partial sums … are pairwise distinct. Graham's conjectur…
Let ) be prime and let be distinct nonzero elements of . A set of elements is rearrangeable if its elements can be ordered so that all partial…
The high-density conjecture. There are arithmetic progressions , all having a common difference, such that
Let be the cyclic group of order , and let be -free, meaning that no has all of in . Cy…
Cyclic cube-free density conjecture. If , then
Generalized Maximum Modulus Principle. There exists , independent of , such that for every ,
Divisibility conjecture for n-circular bayonet codes. For any -cbc and any prime to , the set is an -cbc.
Bajnok's limit conjecture. The value of
Let . An ordering of the elements of is simple when its partial sums are all distinct and non-zero. Graham–Archdeacon conjecture. The set…
Let satisfy … An ordering of the elements of is simple when its partial sums are all distinct and non-zero. Alspach's conjecture. Every…
Let be a cyclic group of order . Let and be positive integers satisfying … with and for . Equal-su…
Fix positive integers , and let be distinct primes. A saturated transfer system on a finite group is a transfer system satisfying the two-out-of-th…
Przytycki–Vojtěchovský conjecture.
Let be even and be odd with … Set … Write for the subgroup generated by in the relevant cyclic group. Sharpness conjecture. If…
Line-intersection bound conjecture. For every ,
Fiberedness conjecture. For every there exists such that either or is -fibered in the direction. In particular, if has…
Three-prime-factor reduction conjecture. The answers to Questions -slab (both versions) and -obstruction are affirmative when has at most distinct prime factors.
Let be a positive integer, let be the cyclic group of order , and let . For a subset , write . Small-d…
Let , , and be positive integers with , and suppose … For a prime dividing , write for the multiplicative order of modulo…
Let , , and be positive integers, and let be a finite cyclic group of order . Suppose … A subset is a direct factor of…