Skip to content

Commit 5f8b963

Browse files
committed
2 parents b178ecd + a0ed187 commit 5f8b963

File tree

5 files changed

+270
-13
lines changed

5 files changed

+270
-13
lines changed

.gitignore

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1 +1,2 @@
11
/drafts
2+
.DS_store

README.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -78,6 +78,8 @@ We are arbitrarily numbering the constants as $C_{1}$, $C_{2}$, etc., mostly bas
7878
| [50](https://teorth.github.io/optimizationproblems/constants/50a.html) | Approximation ratio for quantum Max Cut | 0.611 | $<1$ (0.5 for product states) |
7979
| [51](https://teorth.github.io/optimizationproblems/constants/51a.html) | Erdős maximum term problem | 0.58507 | $\frac{2}{\pi}\approx 0.63662$ |
8080
| [52](https://teorth.github.io/optimizationproblems/constants/52a.html) | Satisfiability threshold for random 3-SAT | 3.52 | 4.490 |
81+
| [53](https://teorth.github.io/optimizationproblems/constants/53a.html) | Davenport constant for $C_n^3$ | 3 | 20369 |
82+
| [54](https://teorth.github.io/optimizationproblems/constants/54a.html) | Beurling–Ahlfors transform constant | 1 | 1.575 |
8183

8284

8385
## Recent progress

constants/52a.md

Lines changed: 19 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -2,22 +2,28 @@
22

33
## Description of constant
44

5-
Let $m,n$ be positive integers and let $V$ be a set of $n$ Boolean variables. By a random formula of density $r= m/n$, we mean a collection of $m$ clauses selected u.a.r. with replacement from the set of $8{{n}\choose{3}}$ clauses on three distinct variables from $V$. For linguistic convenience, formulas with variables from $V$ will be called $n$-formulas.
5+
Let $m,n$ be positive integers and let $V$ be a set of $n$ Boolean variables. By a random formula of density $r = m/n$, we mean a collection of $m$ clauses selected u.a.r. with replacement from the set of $8\binom{n}{3}$ clauses on three distinct variables from $V$. For linguistic convenience, formulas with variables from $V$ will be called $n$-formulas.
66

77
It is conjectured, and corroborated by experimental results (see e.g. [LT1992]) and non-rigorous considerations of Statistical Physics (see e.g. [MZ1997]), that there is a constant $r_3 \approx 4.2$, here to be denoted also by $C_{52}$, such that for any constant $r$:
8-
$$\text{if } r > r_3, \text{ then } \lim_{n \rightarrow \infty}\Pr[\text{an } n\text{-formula with density } r \text{ is satisfiable}] =0,$$
8+
$$
9+
\text{if } r > r_3, \text{ then } \lim_{n \to \infty}\Pr\!\left[\text{an } n\text{-formula with density } r \text{ is satisfiable}\right] = 0,
10+
$$
911
whereas
10-
$$\text{if } r < r_3, \text{ then } \lim_{n \rightarrow \infty}\Pr[\text{an } n\text{-formula with density } r \text{ is satisfiable}] =1.$$
11-
12-
It has been proved by Friedgut [F1999] that there is a sequence $r_{3,n}, n=1, \dots$ such that for any $\epsilon>0$
13-
$$\lim_{n \rightarrow \infty}\Pr[
14-
\text{an } n\text{-formula with density } \geq (r_{3,n} + \epsilon) \text{ is satisfiable}] =0,$$
12+
$$
13+
\text{if } r < r_3, \text{ then } \lim_{n \to \infty}\Pr\!\left[\text{an } n\text{-formula with density } r \text{ is satisfiable}\right] = 1.
14+
$$
15+
16+
It has been proved by Friedgut [F1999] that there is a sequence $r_{3,n}, n = 1, \dots$ such that for any $\epsilon > 0$
17+
$$
18+
\lim_{n \to \infty}\Pr\!\left[\text{an } n\text{-formula with density } \ge (r_{3,n} + \epsilon) \text{ is satisfiable}\right] = 0,
19+
$$
1520
whereas
16-
$$\lim_{n \rightarrow \infty}\Pr[
17-
\text{an } n\text{-formula with density } \leq (r_{3,n} -\epsilon) \text{ is satisfiable}] =1.$$
21+
$$
22+
\lim_{n \to \infty}\Pr\!\left[\text{an } n\text{-formula with density } \le (r_{3,n} - \epsilon) \text{ is satisfiable}\right] = 1.
23+
$$
1824

19-
Below we give the rigorously proved upper bounds for $\limsup_{n \rightarrow \infty} r_{3,n}$ and the rigorously proved lower bounds for
20-
$\liminf_{n \rightarrow \infty} r_{3,n}.$
25+
Below we give the rigorously proved upper bounds for $\limsup_{n \to \infty} r_{3,n}$ and the rigorously proved lower bounds for
26+
$\liminf_{n \to \infty} r_{3,n}$.
2127

2228
## Known upper bounds
2329

@@ -81,11 +87,11 @@ satisfiability threshold conjecture, *Random Structures & Algorithms* 7(1), 59-
8187

8288
- [MS2008] E. Maneva, and A. Sinclair, On the satisfiability threshold and clustering of solutions of random 3-SAT formulas, *Theoretical Computer Science* 407(1-3), 359-369, 2008.
8389

84-
- [DKMP2009] J. D�az, L. Kirousis, D. Mitsche, and X. P�rez-Gim�nez, On the satisfiability threshold of formulas with three literals per clause, *Theoretical Computer Science* 410(30-32), 2920-2934, 2009.
90+
- [DKMP2009] J. Díaz, L. Kirousis, D. Mitsche, and X. Pérez-Giménez, On the satisfiability threshold of formulas with three literals per clause, *Theoretical Computer Science* 410(30-32), 2920-2934, 2009.
8591

8692
- [CF1986] M-T. Chao, and J. Franco, Probabilistic analysis of two heuristics for the 3-satisfiability problem, *SIAM Journal on Computing* 15(4), 1106-1118, 1986.
8793

88-
- [CR1992] V. Chv�tal, and B. Reed, Mick gets some (the odds are on his side), *Proceedings, 33rd Annual Symposium on Foundations of Computer Science*, IEEE Computer Society, 620-627, 1992.
94+
- [CR1992] V. Chvátal, and B. Reed, Mick gets some (the odds are on his side), *Proceedings, 33rd Annual Symposium on Foundations of Computer Science*, IEEE Computer Society, 620-627, 1992.
8995

9096
- [BFU1993] A.Z. Broder, A.M. Frieze, and E. Upfal, On the satisfiability and maximum satisfiability of random 3-CNF formulas. In *SODA '93*, 322-330, 1993.
9197

constants/53a.md

Lines changed: 133 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,133 @@
1+
# Davenport constant for $C_n^3$
2+
3+
## Description of constant
4+
5+
In zero-sum theory, the **Davenport constant** $D(G)$ of a finite abelian group $G$ is defined as the smallest integer $l\in\mathbb{N}$ such that every sequence $S$ over $G$ of length $\lvert S\rvert\ge l$ has a non-empty zero-sum subsequence.
6+
<a href="#GG2006-def-D">[GG2006-def-D]</a>
7+
8+
For $n\ge 2$, let $C_n$ denote the cyclic group of order $n$, and write
9+
10+
$$
11+
C_n^3\ :=\ C_n\oplus C_n\oplus C_n.
12+
$$
13+
14+
<a href="#GG2006-def-Cn">[GG2006-def-Cn]</a>
15+
16+
We define
17+
18+
$$
19+
C_{53a}\ :=\ \sup_{n\ge 2}\ \frac{D(C_n^3)-1}{n-1},
20+
$$
21+
22+
the maximal normalized Davenport constant among the rank-$3$ groups $C_n^3$.
23+
24+
The best general bounds currently available in this setting include the explicit uniform inequality
25+
26+
$$
27+
3(n-1)+1\ \le\ D(C_n^3)\ \le\ \min\{20369,\ 3^{\omega(n)}\}(n-1)+1
28+
\qquad (n\ge 2),
29+
$$
30+
31+
where $\omega(n)$ is the number of distinct prime factors of $n$.
32+
<a href="#Zak2019-omega-def">[Zak2019-omega-def]</a> <a href="#Zak2019-cor3.11">[Zak2019-cor3.11]</a>
33+
34+
Here, the $3^{\omega(n)}$ term is inherited from earlier published work, while the uniform numeric constant $20369$ is the new explicit contribution in <a href="#Zak2019">[Zak2019]</a>.
35+
<a href="#Zak2019-prev-3omega">[Zak2019-prev-3omega]</a> <a href="#CMMPT2012">[CMMPT2012]</a>
36+
37+
In particular,
38+
39+
$$
40+
3\ \le\ C_{53a}\ \le\ 20369.
41+
$$
42+
43+
<a href="#Zak2019-cor3.11">[Zak2019-cor3.11]</a>
44+
45+
A long-standing conjecture (in a stronger, pointwise form) predicts that for all $n\ge 2$ one has
46+
47+
$$
48+
D(C_n^3)\ =\ 3(n-1)+1,
49+
$$
50+
51+
equivalently $C_{53a}=3$.
52+
<a href="#GG2006-conj3.5">[GG2006-conj3.5]</a> <a href="#GG2006-D-equals-1-plus-d">[GG2006-D-equals-1-plus-d]</a> <a href="#GG2006-def-dstar">[GG2006-def-dstar]</a>
53+
54+
One unconditional family of exact evaluations is given by prime powers: if $n$ is a prime power, then $C_n^3$ is a $p$-group, and Theorem 3.1 implies $d(C_n^3)=d^*(C_n^3)=3(n-1)$ and hence $D(C_n^3)=3(n-1)+1$.
55+
<a href="#GG2006-thm3.1">[GG2006-thm3.1]</a> <a href="#GG2006-D-equals-1-plus-d">[GG2006-D-equals-1-plus-d]</a> <a href="#GG2006-def-dstar">[GG2006-def-dstar]</a>
56+
57+
The general determination of $D(G)$ for rank-$3$ groups (and in particular the pointwise determination of $D(C_n^3)$ for all $n$) remains open.
58+
<a href="#Zak2019-open-rank3">[Zak2019-open-rank3]</a>
59+
60+
Published work before the 2019 preprint includes Gao (2000) on rank-$3$ groups and Chintamani--Moriya--Gao--Paul--Thangadurai (2012), which gives the bound $D(C_n^3)\le 3^{\omega(n)}(n-1)+1$ used in Corollary 3.11.
61+
<a href="#Zak2019-ref-Gao2000">[Zak2019-ref-Gao2000]</a> <a href="#Zak2019-prev-3omega">[Zak2019-prev-3omega]</a> <a href="#CMMPT2012">[CMMPT2012]</a> <a href="#Gao2000">[Gao2000]</a>
62+
63+
## Known upper bounds
64+
65+
| Bound | Reference | Comments |
66+
| ----- | --------- | -------- |
67+
| $20369$ | <a href="#Zak2019">[Zak2019]</a> | From Corollary 3.11: $D(C_n^3)\le 20369(n-1)+1$ for all $n\ge 2$, hence $C_{53a}\le 20369$. <a href="#Zak2019-cor3.11">[Zak2019-cor3.11]</a> |
68+
69+
## Known lower bounds
70+
71+
| Bound | Reference | Comments |
72+
| ----- | --------- | -------- |
73+
| $3$ | <a href="#GG2006">[GG2006]</a> | Using $d(C_n^3)\ge d^*(C_n^3)=3(n-1)$ and $D(G)=1+d(G)$ gives $D(C_n^3)\ge 3(n-1)+1$, hence $C_{53a}\ge 3$. <a href="#GG2006-d-ge-dstar">[GG2006-d-ge-dstar]</a> <a href="#GG2006-D-equals-1-plus-d">[GG2006-D-equals-1-plus-d]</a> <a href="#GG2006-def-dstar">[GG2006-def-dstar]</a> |
74+
75+
## Additional comments and links
76+
77+
- **Zero-sumfree reformulation.** If $d(G)$ denotes the maximal length of a zero-sumfree sequence over $G$, then $D(G)=1+d(G) (Definition 2.1 in <a href="#GG2006">[GG2006]</a>). In these terms, the conjecture for $C_n^3$ is $d(C_n^3)=3(n-1)$.
78+
<a href="#GG2006-D-equals-1-plus-d">[GG2006-D-equals-1-plus-d]</a> <a href="#GG2006-conj3.5">[GG2006-conj3.5]</a>
79+
80+
- **Trivial lower bound.** For $G\cong C_{n_1}\oplus\cdots\oplus C_{n_r}$ with $1<n_1\mid\cdots\mid n_r$, the quantity $d^*(G)=\sum_{i=1}^r(n_i-1)$ is the standard lower bound for $d(G)$; for $C_n^3$ this gives $d^*(C_n^3)=3(n-1)$ and $D^*(C_n^3)=3(n-1)+1$.
81+
<a href="#GG2006-def-dstar">[GG2006-def-dstar]</a>
82+
83+
- [Wikipedia page on the Davenport constant](https://en.wikipedia.org/wiki/Davenport_constant)
84+
85+
## References
86+
87+
- <a id="GG2006"></a>**[GG2006]** Gao, Weidong; Geroldinger, Alfred. *Zero-sum problems in finite abelian groups: A survey.* Expositiones Mathematicae **24** (2006), 337–369. DOI: https://doi.org/10.1016/j.exmath.2006.07.002. [Publisher entry (DOI)](https://doi.org/10.1016/j.exmath.2006.07.002). [Mirror PDF](https://cfc.nankai.edu.cn/_upload/article/files/c6/e1/a2c52bf04b1896f59003b5993582/5c9e49ea-af5b-44ac-b153-5dbb6d8ae9a3.pdf). [Google Scholar](https://scholar.google.com/scholar?q=Gao+Geroldinger+Zero-sum+problems+in+finite+abelian+groups%3A+a+survey+Expositiones+Mathematicae+24+2006+337%E2%80%93369)
88+
- <a id="GG2006-def-Cn"></a>**[GG2006-def-Cn]**
89+
**loc:** Expositiones Mathematicae PDF p.2, Section 2 “Preliminaries”
90+
**quote:** “For $n\in\mathbb{N}$, let $C_n$ denote a cyclic group with $n$ elements.”
91+
- <a id="GG2006-def-dstar"></a>**[GG2006-def-dstar]**
92+
**loc:** Expositiones Mathematicae PDF p.2, Section 2 “Preliminaries”
93+
**quote:** “$d^*(G)=\sum_{i=1}^r (n_i-1)$.”
94+
- <a id="GG2006-def-D"></a>**[GG2006-def-D]**
95+
**loc:** Expositiones Mathematicae PDF p.4, Definition 2.1
96+
**quote:** “the smallest integer $l\in\mathbb{N}$ such that every sequence $S$ over $G$ of length $|S|\ge l$ has a non-empty zero-sum subsequence.”
97+
- <a id="GG2006-D-equals-1-plus-d"></a>**[GG2006-D-equals-1-plus-d]**
98+
**loc:** Expositiones Mathematicae PDF p.4, Definition 2.1
99+
**quote:** “$1+d(G)=D(G)$.”
100+
- <a id="GG2006-thm3.1"></a>**[GG2006-thm3.1]**
101+
**loc:** Expositiones Mathematicae PDF p.5, Theorem 3.1
102+
**quote:** “If $G$ is a $p$-group or $r(G)\le 2$, then $d(G)=d^*(G)$.”
103+
- <a id="GG2006-d-ge-dstar"></a>**[GG2006-d-ge-dstar]**
104+
**loc:** Expositiones Mathematicae PDF p.5, Section 3, just before Theorem 3.1
105+
**quote:** “the crucial inequality $d(G)\ge d^*(G)$.”
106+
- <a id="GG2006-conj3.5"></a>**[GG2006-conj3.5]**
107+
**loc:** Expositiones Mathematicae PDF p.5, Section 3, Conjecture 3.5
108+
**quote:** “If $G=C_n^r$, where $n,r\in\mathbb{N}_{\ge 3}$, or $r(G)=3$, then $d(G)=d^*(G)$.”
109+
110+
- <a id="Zak2019"></a>**[Zak2019]** Zakarczemny, Maciej. *Note on the Davenport’s constant for finite abelian groups with rank three.* (2019). PDF: https://arxiv.org/pdf/1910.10984. DOI: https://doi.org/10.48550/arXiv.1910.10984. [Google Scholar](https://scholar.google.com/scholar?q=Zakarczemny+Note+on+the+Davenport%E2%80%99s+constant+for+finite+abelian+groups+with+rank+three)
111+
- <a id="Zak2019-open-rank3"></a>**[Zak2019-open-rank3]**
112+
**loc:** arXiv v1 PDF p.1, Introduction
113+
**quote:** “The exact value of the Davenport constant for groups of rank three is still unknown and this is an open and well-studied problem.”
114+
- <a id="Zak2019-omega-def"></a>**[Zak2019-omega-def]**
115+
**loc:** arXiv v1 PDF p.5, Corollary 3.11
116+
**quote:** “let $\omega(n)$ denote the number of distinct prime factors of $n$.”
117+
- <a id="Zak2019-cor3.11"></a>**[Zak2019-cor3.11]**
118+
**loc:** arXiv v1 PDF p.5, Corollary 3.11 (Eq. (17))
119+
**quote:** “$3(n-1)+1\le D(C_n^3)\le \min\{20369,3^{\omega(n)}\}(n-1)+1$.”
120+
- <a id="Zak2019-prev-3omega"></a>**[Zak2019-prev-3omega]**
121+
**loc:** arXiv v1 PDF p.5, proof of Corollary 3.11
122+
**quote:** “By [3, Theorem 1.2], we get $D(C_n^3)\le 3^{\omega(n)}(n-1)+1$.”
123+
- <a id="Zak2019-ref-Gao2000"></a>**[Zak2019-ref-Gao2000]**
124+
**loc:** arXiv v1 PDF p.7, References [9]
125+
**quote:** “[9] W. D. Gao, On Davenport's constant of finite abelian groups with rank three, Discrete Mathematics 222 (2000), pages 111-124.”
126+
127+
- <a id="CMMPT2012"></a>**[CMMPT2012]** Chintamani, M. N.; Moriya, B. K.; Gao, W. D.; Paul, P.; Thangadurai, R. *New upper bounds for the Davenport and for the Erdős--Ginzburg--Ziv constants.* Archiv der Mathematik **98** (2012), no. 2, 133–142. DOI: https://doi.org/10.1007/s00013-011-0345-z. [Google Scholar](https://scholar.google.com/scholar?q=New+upper+bounds+for+the+Davenport+and+for+the+Erd%C5%91s-Ginzburg-Ziv+constants)
128+
129+
- <a id="Gao2000"></a>**[Gao2000]** Gao, W. D. *On Davenport's constant of finite abelian groups with rank three.* Discrete Mathematics **222** (2000), no. 1--3, 111–124. DOI: https://doi.org/10.1016/S0012-365X(00)00010-8. [Google Scholar](https://scholar.google.com/scholar?q=On+Davenport%27s+constant+of+finite+abelian+groups+with+rank+three)
130+
131+
## Contribution notes
132+
133+
Prepared with assistance from ChatGPT 5.2 Pro.

0 commit comments

Comments
 (0)