{'fraction_non_alphanumeric': 0.036237471087124135, 'fraction_numerical': 0.010023130300693909, 'mean_word_length': 4.0310077519379846, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Sign rank, VC dimension and spectral gaps

We study the maximum possible sign rank of N×N sign matrices with a given VC dimension d. For d = 1, this maximum is 3. For d = 2, this maximum is Θ(N1/2). Similar (slightly less accurate) statements hold for d > 2 as well. We discuss the tightness of our methods, and describe connections to combinatorics, communication complexity and learning theory. We also provide explicit examples of matrices with low VC dimension and high sign rank. Let A be the N × N point-hyperplane incidence matrix of a finite projective geometry with order n ≥ 3 and dimension d ≥ 2. The VC dimension of A is d, and we prove that its sign rank is larger than N 1 2 − 1 2d . The large sign rank of A demonstrates yet another difference between finite and real geometries. To analyse the sign rank of A, we introduce a connection between sign rank and spectral gaps, which may be of independent interest. Consider the N × N adjacency matrix of a ∆ regular graph with a second eigenvalue in absolute value λ and ∆ ≤ N/2. We show that the sign rank of the signed version of this matrix is at least ∆/λ. A similar statement holds for all regular (not necessarily symmetric) sign matrices. We also describe limitations of this approach, in the spirit of the Alon-Boppana theorem.