Skip to content
Preprint

Character and Multiplier Obstructions for Circulant Weighing Matrices

Aug 2026 · 0 citations · 9 references
Mathematics

Abstract

We prove the nonexistence of eight circulant weighing matrices from the remaining table of orders at most $200$ and weights at most $100$. The proofs combine contraction, character evaluation on the kernel of a contraction, multiplier methods, and exact finite computations. For $CW(105,36)$, the contracted matrix is unique up to equivalence. Applying a nonprincipal character of the $C_3$ kernel gives an element over the Eisenstein integers; reduction modulo $1-\omega$ gives a word in a ternary cyclic code of length $35$, and exact enumeration rules out every required Eisenstein-unit lift. For $CW(140,36)$, the real-valued character $Y\mapsto-1$ of the $C_4$ kernel is incompatible with the same contracted class. For weight $64$, the faithful character $Y\mapsto i$ of a $C_4$ kernel first gives an element of $\mathbb{Z}[i][C_m]$; a generalized multiplier then forces constancy on multiplication-by-$2$ orbits, and exact correlation calculations eliminate orders $140$, $180$, and $196$. The three weight-$49$ cases are settled by the ordinary prime-power multiplier, with contraction where needed. Consequently none of $CW(105,36)$, $CW(140,36)$, $CW(116,49)$, $CW(120,49)$, $CW(192,49)$, $CW(140,64)$, $CW(180,64)$, and $CW(196,64)$ exists.

View source

Similar papers

Preprint Sep 2026

Efficient Computation and Congruences for Colored Partition Functions

For a positive integer $\alpha$, let $p_\alpha(n)$ denote the number of $\alpha$-colored partitions of $n$. The Rademacher-type expansion of Iskander, Jain, and Talvola is valid for every real $\alpha>0$, but when $\alpha>24$ it involves several polar terms and a two-parameter family of exponential sums $A_k^{(\alpha)}...

Jean Carlos Villegas-Morales · 0 citations
Preprint Oct 2026

An Explicit Polynomial Counterexample to Connes'Embedding Conjecture

We construct an explicit Hermitian polynomial in six selfadjoint variables, $f=-1+\omega+\omega^*+M\sum_{j=1}^{15}(2-u_j-u_j^*)$, with integer coefficients, degree $72$, and exactly $33$ monomials. Here $\omega,u_1,\ldots,u_{15}$ are specified words, $*$ reverses words, and $M$ is a specified positive integer. Its norm...

Jia-Qi Wang, Li-Hong Zhi · 1 citation
Preprint Sep 2026

The additive-square-free spectrum below 139

For a finite real alphabet $T$, let $g(T)$ be the supremum of the lengths of words over $T$ containing no two adjacent nonempty blocks of equal length and equal sum. We classify all four-element alphabets with $g(T)<139$. Up to affine equivalence, these are the known endpoint-sum family and seven isolated classes. Exha...

En-Kai Zhang · 1 citation
Preprint Sep 2026

Finite-orbit obstructions for multipliers on the polydisk

We study the closed spans of finitely many joint orbits of holomorphic multipliers on the Hardy space $H^2(\mathbb D^d)$ of the polydisk. If fewer than $d$ symbols are used, every such span has infinite codimension. The symbols may be unbounded, provided that all orbit vectors belong to the Hardy space. We give two ele...

I. Krishtal, Javad Mashreghi, P. K. Vishwakarma · 0 citations
Preprint Aug 2026

A Mayer-Vietoris calculus for regular denominators

Let $A$ be a commutative ring and let $I$ be an ideal. An element $a\in A$ is a regular denominator for $I$ when multiplication by $a$ on $A/I$ is injective; we denote the set of all such elements by $S_I$. We study how the common regular denominators for two ideals $I$ and $J$ are related to $I\cap J$ and $I+J$. This...

Elena Caviglia, Amartya Goswami · 0 citations
Preprint Oct 2026

Weak and genuine A_n-formality for number fields

We introduce weak $A_n$-formality for Galois cochain algebras and, for profinite groups whose mod-$p$ cohomology is concentrated in degrees at most two, characterise weak and genuine $A_n$-formality through finite embedding problems and the projective system they form. We then study $A_n$-formality for number fields. L...

Ambrus Pál, Gereon Quick · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.