Searcharxiv⌕ Search

arXiv subjects

Seth Douglas

Publications and source records attributed to Seth Douglas.

5 recordsLinked to original sources

Kaplansky's conjectures fail for torsion-free hyperbolic groups in positive characteristic

Do Kaplansky's group-ring conjectures hold for torsion-free word-hyperbolic groups? We show that all four fail in positive characteristic. For every prime $p$ there is a finitely presented, torsion-free, word-hyperbolic group $G$ with a finite two-dimensional classifying space and $a,b\in\mathbb{F}_p[G]$ with $ab=1\neq ba$. So, over every field of characteristic $p$, the group algebra of $G$ is not directly finite and has a non-trivial idempotent, zero divisor and unit, and $G$ is neither sofic nor surjunctive. For $p=2$, $G$, $a$ and $b$ come from OpenAI's random construction, and we add that $G$ is hyperbolic with probability $1-o(1)$, as are OpenAI's zero-divisor groups. For odd $p$ the groups are new: they adapt OpenAI's direct-finiteness construction with a signed cancellation, found first by S. V. Ivanov and independently by us, via an exact solution of a colour-balance problem and a Perron certificate. As far as we know, they are the first torsion-free counterexamples to direct finiteness and to the idempotent conjecture in odd characteristic. Hyperbolicity comes from one deterministic criterion: if a labelled graph is pattern-free, the group obtained by coning off its components is aspherical and has a linear isoperimetric inequality. We prove it by running OpenAI's exclusion of reduced spheres on van Kampen discs, an accounting OpenAI used for another complex. For every prime $p$, the existence of $G$, $a$ and $b$ and the failure of all four conjectures are formalized in Lean 4, including existence forms of the random-graph estimates used. In characteristic zero, where the idempotent and direct-finiteness conjectures hold for torsion-free hyperbolic groups, we show that no cancellation built into the vertex types survives the decay estimate that makes the groups torsion-free. OpenAI's characteristic-two counterexample with torsion is a CAT(0) group.

math.GR↗

The Lovász number is not alone: a continuum of Rényi points in the entanglement-assisted spectrum of graphs

Li and Zuiddam's entanglement-assisted asymptotic spectrum of graphs consists of the normalized graph parameters that are additive under disjoint unions, multiplicative under strong products and monotone under entanglement-assisted cohomomorphisms; the entanglement-assisted Shannon capacity is their pointwise minimum. To our knowledge, the Lovász number $\vartheta$ was its only known element. We find a continuum of others. Three quantities of Duan and Winter, $\log_2\vartheta$, the minimal Holevo capacity $C_{\min}$ and the logarithm of the no-signalling simulation cost $Σ$, are the smallest information radii of classical-quantum channels compatible with a graph, measured with Petz-Rényi divergences of orders $0$, $1$ and $2$. At order zero this is due to Schrijver (as credited by Dalai) and to Duan and Winter; at order one it is the min-max formula for the Holevo capacity. Interpolating in the order gives a family $\vartheta_α$, $0\leα\le2$, and we prove that every member lies in the spectrum. The main step, multiplicativity under strong products for channels that need not factor, follows from an exact nesting identity for compressions. Sandwiched Rényi radii of order $β\in[1/2,\infty]$ give the same family, at $α=2-1/β$. On the five-cycle the family takes every value in $[\sqrt5,5/2]$. A Hilbert-Schmidt inequality for the pentagon gives $C_{\min}(C_5)=\log_2(5/2)$, proving a conjecture of Duan and Winter. We also settle the two open links of their inequality chain: the graph-level no-signalling simulation rate always equals its single-letter value $\log_2Σ(G)$, and a 32-vertex graph from the Mermin-Peres magic square has $C_{\min}<\log_2Σ$, certified in exact rational arithmetic. Finally, $Σ$ never exceeds the projective rank of the complement; a rank inequality for the same square makes this strict on a 1440-vertex graph.

quant-ph↗

Amenable groups with nearly exponential sofic profile, and quantum channels that need nearly linear memory

How far from finite can an amenable group be? Every finite piece of an amenable group can be imitated by permutations of a finite set, and Cornulier's sofic profile counts how many points such an imitation needs at accuracy $1/r$. We build a finitely presented elementary amenable group with a finite piece whose profile is $\exp(r^{1+o(1)})$, close to the most our counting method can ever detect. The construction is a lamplighter with its lamps on configurations rather than on points. Houghton's group moves the points of three rays, finitely supported affine maps act on their binary configurations, and a copy of $S_3$ sits on every configuration. Then $N$ points carry $2^N$ lamps, yet any two lamps can be brought together by moves that each involve at most three points. The group embeds in Brin's group $3V$, so $3V$ too has a finite piece of nearly exponential profile. The group also gives an explicit quantum channel on $\mathbb C^{873}$ that is cheap to use once and expensive to use many times. A device that applies it $n$ times, releasing each output before the next input arrives, needs about $n/B$ qubits of memory when it may spend $B$ bits of purity, and exact devices achieve this up to polylogarithmic factors. With exchange at the optimal rate, the least memory is about $\sqrt n$, attained with purity of the same order. The channel is factorizable and lies in the closure of channels with finite maximally mixed baths, yet any such bath that imitates it to accuracy $u$ needs dimension $\exp(u^{-1+o(1)})$, although its minimal Stinespring dilation implements it exactly with a pure environment of dimension $130$. The engine is a one-round theorem: after a single use, the memory of any such device carries an approximate representation of the group.

quant-ph↗

Bath dimension and initial entropy for closed repeated use of a quantum channel

We characterize the bath resources needed to supply repeated uses of a fixed finite-dimensional quantum channel in a closed device. For each horizon $T$, one bath, one initial state and one repeated unitary are fixed before the user. Each output is returned before the next input arrives; no reset, discard, fresh ancilla or uncounted controller is available. Approximation error must vanish against arbitrary adaptive users with quantum memory and references. Writing $r=\lim \log_2(R_T)/T$ for the bath dimension rate and $s=\lim S(ω_T)/T$ for the actual initial entropy rate, we prove that the achievable region is exactly $s\ge 0$, $r+s\ge h$ and $r-s\geκ$. Here $h$ is maximum entropy exchange and $κ$ is a smoothed independent-reference extension cost, with the zero-error limit taken before the supremum over full-rank inputs. Its exact fixed-input form is an affine transform of the zero-leakage quantum privacy funnel. The minimum dimension rate is $(h+κ)/2$. The proof combines entropy converses, a bath-dimension-independent support repair, and a closed adaptive implementation of encoder-only fully quantum Slepian--Wolf recycling. All seeds, clocks, workspace and retained residues are counted. Worked examples include dephasing, pure replacement and a qubit channel with $0<κ<h$. No computability of $κ$ or efficient circuit synthesis is claimed.

quant-ph↗

The I3322 quantum value is attained spatially but not in finite dimension

Let $S$ be the common tensor-product and commuting-operator supremum of the $I_{3322}$ Bell functional in the Collins-Gisin normalization. Starting from a certified value window and Bellman/path equivalence, we prove that no finite-dimensional quantum strategy attains $S$, whereas a spatial strategy on $\ell^2(\mathbb{Z})\otimes\ell^2(\mathbb{Z})$ does. The finite-dimensional statement includes mixed states and binary POVMs. Consequently $C_q(3,3;2,2)$ is not closed and $C_{qs}(3,3;2,2)\setminus C_q(3,3;2,2)$ is nonempty. We also establish the dimension complexity $D(ε)=Θ(\log(1/ε))$: approaching $S$ requires and suffices local dimension logarithmic in inverse error. The constructive upper bound is $D(ε)\le 23.9010650\log(1/ε)$ for all sufficiently small $ε$, with natural logarithms; the lower constants are existential. The proofs use critical Bellman storage, spectral transport and normalizable orbit measures. A finite weighted-flow argument supplies the unrestricted quantitative lower bound without identifying distinct joint spectral components. This revision replaces an unsupported step in the earlier lower argument and records additional proof corrections. Prior numerical certification and independent concurrent attainment results are credited. Exact arithmetic and Lean 4 check specified numerical, scalar and finite accounting facts; the complete analytic proof is not formalized.

quant-ph↗