Related papers: Singer difference sets and the projective norm gra…

The projective norm graphs $\text{NG}(q,t)$ provide tight constructions for the Tur\'an number of complete bipartite graphs $K_{t,s}$ with $s>(t-1)!$. In this paper we determine their automorphism group and explore their small subgraphs. To…

We study finite groups $G$ having a subgroup $H$ and $D \subset G \setminus H$ such that the multiset $\{ xy^{-1}:x,y \in D\}$ has every non-identity element occur the same number of times (such a $D$ is called a {\it difference set}). We…

Erd\H{o}s Problem 30 asks for sharp asymptotics of the Sidon extremal function $h(N)$, and Singer's construction is the classical source of lower-bound examples matching the main term. We present a Lean 4 formalization of Singer's Sidon set…

We answer a number of open problems in frame theory concerning the decomposition of frames into linearly independent and/or spanning sets. We prove that in finite dimensional Hilbert spaces, Parseval frames with norms bounded away from 1…

We present a systematic, algorithmic method to compute the preimage of elements under the Singer algebraic transfer. Using the lambda algebra and the invariant-theoretic formula of P.H. Chon and L.M. Ha [5], we formulate the preimage search…

We confirm a conjecture of Cun Sheng Ding~\cite{Ding-Discrete} claiming that the punctured value-sets of a list of eleven trinomials over odd-degree extensions of the binary field give rise to difference sets with Singer parameters. In the…

We prove the Singer conjecture for extended graph manifolds and pure complex-hyperbolic higher graph manifolds with residually finite fundamental groups. In real dimension three, where a result of Hempel ensures that the fundamental group…

Let $q=p^f$ be a prime power, $H \leq \mathrm{GL}_d(q)$ a subgroup containing a genuine Singer cycle $s$ of order $q^d-1$, and $W$ an $\mathbb{F}_q H$-module whose scalar extension restricts to an untwisted polynomial tensor representation…

Given a graph $H$ on vertex set $\{1,2,\cdots, n\}$ and a function $f:[0,1]^2 \rightarrow \mathbb{R}$, define \begin{align*} \|f\|_{H}:=\left\vert\int \prod_{ij\in E(H)}f(x_i,x_j)d\mu^{|V(H)|}\right\vert^{1/|E(H)|}, \end{align*} where $\mu$…

Let $R_s M$ denote the Singer construction on an unstable module $M$ over the Steenrod algebra $A$ at the prime two; $R_s M$ is canonically a subobject of $P_s\otimes M$, where $P_s$ is the polynomial algebra on s generators of degree one.…

We give an identification between the planar algebra of the subgroup-subfactor $R \rtimes H \subset R \rtimes G$ and the $G$-invariant planar subalgebra of the planar algebra of the bipartite graph $\star_n$, where $n = [G : H]$. The…

Let $A$ be the Steenrod algebra over the finite field $k := \mathbb Z_2$ and $G(q)$ be the general linear group of rank $q$ over $k.$ A well-known open problem in algebraic topology is the explicit determination of the cohomology groups of…

A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general…

If $N \subset P,Q \subset M$ are type II_1 factors with $N' \cap M = C id$ and $[M:N]$ finite we show that restrictions on the standard invariants of the elementary inclusions $N \subset P$, $N \subset Q$, $P \subset M$ and $Q \subset M$…

We consider a natural generalization of Vertex Cover: the Subset Vertex Cover problem, which is to decide for a graph $G=(V,E)$, a subset $T\subseteq V$ and integer $k$, if $V$ has a subset $S$ of size at most $k$, such that $S$ contains at…

Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e. for every graph $F$, the number of homomorphisms from $F$ to $G$ equals the number…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Given a hypergraph $H$, the Planar Support problem asks whether there is a planar graph $G$ on the same vertex set as $H$ such that each hyperedge induces a connected subgraph of $G$. Planar Support is motivated by applications in graph…

We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph. To this end, define the "underlying treewidth" of a graph class…

First, let $K \subset B(0,1) \subset \mathbb{R}^{2}$ be a set with $\mathcal{H}_{\infty}^{1}(K) \sim 1$, and write $\pi_{e}(K)$ for the orthogonal projection of $K$ into the line spanned by $e \in S^{1}$. For $1/2 \leq s < 1$, write $$E_{s}…