Skip to content
Preprint

A Four-by-Four Obstruction to Polynomial Removal for Ordered Binary Matrices

Oct 2026 · 0 citations · 6 references
Computer Science Mathematics

Abstract

We exhibit a fixed $4\times 4$ binary matrix with no polynomial induced ordered removal bound. At depth $h\geq 1$, let $m=2^h$. Our explicit host has order $(14h+2)m$, exactly $2m^6+\frac{1}{2}(m-2)m^5$ induced copies, and exact editing distance $m^2$ cells. Its normalized editing distance is $\Theta(h^{-2})$, while its induced-copy density is $\Theta(4^{-h}h^{-8})$. The lower bound holds against arbitrary cell edits through an injective family of $m^2$ protected selections. An exhaustive arithmetic classification identifies every induced copy and proves that a matching canonical repair creates none. The original-copy transversal number is exactly $m$, yielding an unbounded gap between hitting existing copies and eliminating all copies. The identities and the obstruction at every depth are formalized in Lean, with verification sources included as ancillary files.

View source

Similar papers

Preprint Sep 2026

A planar algebraic Zarankiewicz theorem over prime fields

We prove an incidence bound for bipartite graphs on finite subsets of $\mathbb{F}^2\times \mathbb{F}^2$ defined by Boolean combinations of polynomial equations of bounded degree. If such a graph is $K_{k,k}$-free and its vertex classes have sizes $m$ and $n$, then it has $O_{t,k}((mn)^{2/3}+m+n+mn/p)$ edges, where $t$...

Le Quang-Ham · 0 citations
Sep 2026

Certificate Complexity of Elementary Symmetric Boolean Functions of Arbitrary Degree

Let $\sigma_{n,d}$ denote the elementary symmetric Boolean function of $n$ variables and degree $d$. Previous work determined $C(\sigma_{n,d})$ when $d$ is odd or a power of two, but the general even non-power-of-two case remained open. We determine the certificate complexity for every degree $1\le d\le n$, thereby com...

Jing Zhang, Yuan Li · 3 citations
Preprint Sep 2026

Optimally pseudorandom $K_4$-free graphs

We show that optimally pseudorandom $K_4$-free graphs of order $n$ and degree $d = \Theta(n^{4/5})$ exist by constructing a graph in the split Cayley hexagon, matching the known upper bound. This resolves the first open case for $K_k$-free graphs after $k=3$ for which Alon gave a tight construction in 1994. This has a...

Jie Han, F. Ihringer, H. Van Maldeghem · 2 citations
Preprint Nov 2026

Explicit permutations of $(\mathbb{Z}/4\mathbb{Z})^m$ with uniformly bounded differential uniformity

Symmetric primitives over Galois rings need nonlinear components whose differentials with respect to ring addition are controlled. Let $R=\mathrm{GR}(4,m)$ and $q=2^m$, so that $(R,+)\cong(\mathbb{Z}/4\mathbb{Z})^m$ has order $N=q^2$. For every $m\ge1$ we construct an explicit permutation $G_c$ of $R$ all of whose diff...

Hiroki Fukui · 0 citations
Preprint Oct 2026

Low-rank matrices with three prescribed off-diagonal values over $\mathbb{F}_p$

For every prime $p$ and every three-element set $L\subseteq\mathbb{F}_p$, we prove that, for every integer $n\geq1$, there exists a symmetric $n\times n$ matrix over $\mathbb{F}_p$ with zero diagonal, off-diagonal entries in $L$, and rank $O_{p,L}(n^{1/3})$. This answers a question of Bukh. When $0\notin L$, a standard...

F. Rakhmonov, Chi-Hoi Yip · 0 citations
Preprint Oct 2026

Triangle-free Rank--Ramsey graphs from ordered incidence lifts

For a graph $G$ with adjacency matrix $A_G$ and a coefficient field $\mathbb K$, put $\rho_{\mathbb K}(G)=\operatorname{rank}_{\mathbb K}(A_G+I)$. We answer the triangle-free Rank--Ramsey existence question of Beniamini, Linial and Shraibman. For every order $n$, we construct a triangle-free graph $H_n$ such that, simu...

Yong Lu, Qi Wu, Qian-Nan Zhou · 0 citations

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