Related papers: On Searching for Small Kochen-Specker Vector Syste…
It is shown how the 300 rays associated with the antipodal pairs of vertices of a 120-cell (a four-dimensional regular polytope) can be used to give numerous "parity proofs" of the Kochen-Specker theorem ruling out the existence of…
We introduce a new class of algorithms for finding a short vector in lattices defined by codes of co-dimension $k$ over $\mathbb{Z}_P^d$, where $P$ is prime. The co-dimension $1$ case is solved by exploiting the packing properties of the…
Given a set $X$, a collection $\mathcal{F}\subseteq\mathcal{P}(X)$ is said to be $k$-Sperner if it does not contain a chain of length $k+1$ under set inclusion and it is saturated if it is maximal with respect to this property. Gerbner et…
The Wiener index of a graph is the sum of all pairwise shortest-path distances between its vertices. In this paper we study the novel problem of finding a minimum Wiener connector: given a connected graph $G=(V,E)$ and a set $Q\subseteq V$…
Given a set $X$, a collection $\mathcal{F} \subset \mathcal{P}(X)$ is said to be $k$-Sperner if it does not contain a chain of length $k+1$ under set inclusion and it is saturated if it is maximal with respect to this probability. Gerbner…
The existence of Steiner triple systems STS(n) of order n containing no nontrivial subsystem is well known for every admissible n. We generalize this result in two ways. First we define the expander property of 3-uniform hypergraphs and…
In a recent work, Jungnickel, Magliveras, Tonchev, and Wassermann derived an overexponential lower bound on the number of nonisomorphic resolvable Steiner triple systems (STS) of order $v$, where $v=3^k$, and $3$-rank $v-k$. We develop an…
The paper deals with the Feedback Vertex Set problem parameterized by the solution size. Given a graph $G$ and a parameter $k$, one has to decide if there is a set $S$ of at most $k$ vertices such that $G-S$ is acyclic. Assuming the…
Quantum contextuality, as proved by Kochen and Specker, and also by Bell, should manifest itself in any state in any system with more than two distinguishable states and recently has been experimentally verified on various physical systems.…
The Directed Feedback Vertex Set (DFVS) problem takes as input a directed graph~$G$ and seeks a smallest vertex set~$S$ that hits all cycles in $G$. This is one of Karp's 21 $\mathsf{NP}$-complete problems. Resolving the parameterized…
A vector space partition of $\mathbb{F}_q^v$ is a collection of subspaces such that every non-zero vector is contained in a unique element. We improve a lower bound of Heden, in a subcase, on the number of elements of the smallest occurring…
The Kochen-Specker theorem has been discussed intensely ever since its original proof in 1967. It is one of the central no-go theorems of quantum theory, showing the non-existence of a certain kind of hidden states models. In this paper, we…
A diagrammatic representation is given of the 24 rays of Peres that makes it easy to pick out all the 512 parity proofs of the Kochen-Specker theorem contained in them. The origin of this representation in the four-dimensional geometry of…
Let $\crs(K_n)$ be the minimum number of crossings over all rectilinear drawings of the complete graph on $n$ vertices on the plane. In this paper we prove that $\crs(K_n) < 0.380473\binom{n}{4}+\Theta(n^3)$; improving thus on the previous…
Density Functional Theory's Kohn-Sham (KS) potential emerges as the minimizing effective potential in an unconstrained variational scheme that does not involve fixing the unknown single-electron density. The physical content behind the…
In this paper we attempt to discuss what has Kochen-Specker (KS) theorem to say about physical invariance and quantum individuality. In particular, we will discuss the impossibility of making reference to objective physical properties…
An essential ingredient in many examples of the conflict between quantum theory and noncontextual hidden variables (e.g., the proof of the Kochen-Specker theorem and Hardy's proof of Bell's theorem) is a set of atomic propositions about the…
Iosevich and Senger (2008) showed that if a subset of the d-dimensional vector space over a finite field is large enough, then it contains many k-tuples of mutually orthogonal vectors. In this note, we provide a graph theoretic proof of…
The various ways to reduce number of vectors describing condition of particles for high energy physics problems are presented. In particular decomposition of any vector with respect to the basis, consisting of any four linearly independent…
In a graph $G = (V,E)$, a k-ruling set $S$ is one in which all vertices $V$ \ $S$ are at most $k$ distance from $S$. Finding a minimum k-ruling set is intrinsically linked to the minimum dominating set problem and maximal independent set…