By OpenAISourceGitHub

Manuscripts from openai/math

Fork
Clone
git clone https://openversions.com/git/index/openai-math.git
Cite
Version link
https://openversions.com/index/openai-math/commit/dfd8c46870b48511e697cbb43a3c8c91d375fa2f
Version identifier (commit hash)
dfd8c46870b48511e697cbb43a3c8c91d375fa2f

Fork to create your own copy with credit to the source. Clone to get a Git copy on your computer.

All papers

Claims

Findings

The circulant Hadamard conjecture

For a positive integer nn, a real circulant Hadamard matrix of order nn exists if and only if n∈{1,4}n \in \{1, 4\}.

For an integer n>1n > 1, a Barker sequence of length nn exists if and only if n∈{2,3,4,5,7,11,13}n \in \{2, 3, 4, 5, 7, 11, 13\}.

If a real circulant Hadamard matrix has order n>1n > 1, then n=4u2n = 4u^2 for an odd positive integer uu.

Let pp be a prime, η\eta a primitive LL-th root of unity with p∤Lp \nmid L (L=1L=1 allowed), and AA the localization of Z[η]\mathbb{Z}[\eta] at a maximal ideal containing pp. For k≥1k \ge 1 and ξ\xi a primitive pkp^k-th root of unity, A[ξ]A[\xi] is free over AA with basis 1,ξ,…,ξD−11, \xi, \dots, \xi^{D-1} (D=(p−1)pk−1D = (p-1)p^{k-1}), local with maximal ideal (ξ−1)(\xi-1), and for every integer ℓ≥0\ell \ge 0 and z=∑j=0D−1rjξj∈A[ξ]z = \sum_{j=0}^{D-1} r_j \xi^j \in A[\xi], v(z)≥ℓ  ⟺  z∈pℓA[ξ]  ⟺  rj∈pℓAv(z) \ge \ell \iff z \in p^\ell A[\xi] \iff r_j \in p^\ell A for every jj.

Let AA be as in Lemma 2.1, e≥1e \ge 1, and F,K∈A[Cpe]F, K \in A[C_{p^e}] with FK=pebFK = p^e b for b∈A×b \in A^\times. For a primitive pp-th root of unity ρ\rho, both ratios F(ρ)/F(1)F(\rho)/F(1) and K(ρ)/K(1)K(\rho)/K(1) are units in A[ρ]A[\rho] with residue 11 at its maximal ideal.

Suppose x∈Z[i][P]x \in \mathbb{Z}[i][P] satisfies xx∗=u2xx^* = u^2, where u>1u > 1 is odd, P=Cu2P = C_{u^2}, and II is the set of primes dividing uu. Then the alternating product Δ(x)=∏S⊆IxS(−1)∣S∣\Delta(x) = \prod_{S \subseteq I} x_S^{(-1)^{|S|}} belongs to B=Z[i,{ρp:p∈I}]B = \mathbb{Z}[i, \{\rho_p : p \in I\}] and is a root of unity whose order is a power of pp for each p∈Ip \in I (in particular, odd order; and Δ(x)=1\Delta(x) = 1 if uu has at least two distinct prime divisors).

Let OO be a local domain with maximal ideal n\mathfrak{n}, k=O/nk = O/\mathfrak{n}, and 0≠t∈n0 \neq t \in \mathfrak{n}. Then 1+tO1 + tO is a subgroup of O×O^\times, and λt:1+tO→(k,+)\lambda_t : 1 + tO \to (k, +), λt(1+tL)=L mod n\lambda_t(1 + tL) = L \bmod \mathfrak{n}, is a group homomorphism.

Methods

Group-ring descent at the prime 2 using cyclotomic divisibility in localizations of cyclotomic integer rings to rule out powers of 2 larger than 4 in circulant Hadamard orders.

Source excerpts

“The descent below is a group-ring version of Turyn’s argument for the 2-primary coefficients [17, Lemma 6 through Theorem 8 and its Corollary, pp. 334–336].” · Show in paper

“We apply the coefficient statement in Lemma 2.1 to the 2-primary projection of the row.” · Show in paper

Alternating character products Delta(x) over subsets of prime divisors of u, combined with local character comparison (Lemma 3.1) and Kronecker's criterion (Lemma 3.3), to produce roots of unity of odd order.

Source excerpts

“This product combines comparisons between pairs of characters.” · Show in paper

“The comparison supplies control at the primes dividing u. The norm identity supplies both the remaining local control and the complex absolute values.” · Show in paper

First-order residue homomorphism lambda_t : 1 + tO -> (O/n, +) at a maximal ideal above 2 to compare binary coefficient congruences of normalized partial evaluations c, d, g.

Source excerpts

“The following elementary map records the first-order term of a unit 1 + tL and turns products into sums in the residue field. Its common target will let us compare the two divisibilities supplied by the sign array.” · Show in paper