Related papers: New Kochen-Specker Sets in Four Dimensions

For $v\equiv 1$ or 3 (mod 6), maximum partial triple systems on $v$ points are Steiner triple systems, STS($v$)s. The 80 non-isomorphic STS(15)s were first enumerated around 100 years ago, but the next case for Steiner triple systems was…

We show that, regardless of the dimension of the Hilbert space, there exists no set of rays revealing state-independent contextuality with less than 13 rays. This implies that the set proposed by Yu and Oh in dimension three [Phys. Rev.…

In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…

We say that a set system $\mathcal{F}$ is $k$-completely hyperseparating if for any vertex $v$, there are at most $k$ sets in $\mathcal{F}$ with intersection $\{v\}$. We determine the minimum size of such set systems on an $n$-element…

Deep networks are frequently tuned to novel tasks and continue learning from ongoing data streams. Such sequential training requires consolidation of new and past information, a challenge predominantly addressed by retaining the most…

We develop fast spectral algorithms for tensor decomposition that match the robustness guarantees of the best known polynomial-time algorithms for this problem based on the sum-of-squares (SOS) semidefinite programming hierarchy. Our…

We present a method to confirm the planetary nature of objects in systems with multiple transiting exoplanet candidates. This method involves a Fourier-Domain analysis of the deviations in the transit times from a constant period that…

The structure of on-shell and off-shell 2D, (4,4) supersymmetric scalar multiplets is investigated, in components and in superspace. We reach the surprising result that there exist eight {\underline {distinct}} on-shell versions and an even…

We prove that, for every positive integer k, there is an integer N such that every 4-connected non-planar graph with at least N vertices has a minor isomorphic to K_{4,k}, the graph obtained from a cycle of length 2k+1 by adding an edge…

It is proven that any hidden variable theory of the type proposed by Meyer [Phys. Rev. Lett. {\bf 83}, 3751 (1999)], Kent [{\em ibid.} {\bf 83}, 3755 (1999)], and Clifton and Kent [Proc. R. Soc. London, Ser. A {\bf 456}, 2101 (2000)] leads…

We present a novel coreset construction algorithm for solving classification tasks using Support Vector Machines (SVMs) in a computationally efficient manner. A coreset is a weighted subset of the original data points that provably…

We propose two novel model architectures for computing continuous vector representations of words from very large data sets. The quality of these representations is measured in a word similarity task, and the results are compared to the…

Speaker embeddings are widely used in speaker verification systems and other applications where it is useful to characterise the voice of a speaker with a fixed-length vector. These embeddings tend to be treated as "black box" encodings,…

A classical theorem of Spencer shows that any set system with n sets and n elements admits a coloring of discrepancy O(n^1/2). Recent exciting work of Bansal, Lovett and Meka shows that such colorings can be found in polynomial time. In…

Choosing an appropriate tokenization scheme is often a bottleneck in low-resource cross-lingual transfer. To understand the downstream implications of text representation choices, we perform a comparative analysis on language models having…

The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…

Counting interior-disjoint empty convex polygons in a point set is a typical Erd\H{o}s-Szekeres-type problem. We study this problem for 4-gons. Let $P$ be a set of $n$ points in the plane and in general position. A subset $Q$ of $P$, with…

Disentangling uncorrelated information in speech utterances is a crucial research topic within speech community. Different speech-related tasks focus on extracting distinct speech representations while minimizing the affects of other…

Consider an irreducible finite Coxeter system. We show that for any nonnegative integer n the sum of the nth powers of the Coxeter exponents can be written uniformly as a polynomial in four parameters: h (the Coxeter number), r (the rank),…

We obtain new bounds for (a variant of) the Furstenberg set problem for high dimensional flats over $\mathbb{R}^n$. In particular, let $F\subset \mathbb{R}^n$, $1\leq k \leq n-1$, $s\in (0,k]$, and $t\in (0,k(n-k)]$. We say that $F$ is a…