相关论文: Coloring the rational quantum sphere and the Koche…
K\"onig's edge coloring theorem says that a bipartite graph with maximal degree $n$ has an edge coloring with no more than $n$ colors. We explore the computability theory and Reverse Mathematics aspects of this theorem. Computable bipartite…
M. Kontsevich proposed a topological construction for an invariant Z of rational homology 3-spheres using configuration space integrals. G. Kuperberg and D. Thurston proved that Z is a universal real finite type invariant for integral…
Kent's conclusion that ``non-contextual hidden variable theories cannot be excluded by theoretical arguments of the Kochen-Specker type once the imprecision in real world experiments is taken into account'' [Phys. Rev. Lett. 83, 3755…
Let $X$ be a smooth cubic hypersurface of dimension $n \ge 1$ over the rationals. It is well-known that new rational points may be obtained from old ones by secant and tangent constructions. In view of the Mordell--Weil theorem for $n=1$,…
We give an elementary proof of a recent result by Fishman, Kleinbock, Merrill and Simmons about rational points on quadratic surfaces.
This thesis consists of four parts. In the first part it is shown that optimal universal cloning of photons can be realized with the help of stimulated emission. Possible schemes based on three-level systems and on parametric…
We introduce a logic modelling some aspects of the behaviour of the measurement process, in such a way that no direct mention of quantum states is made, thus avoiding the problems associated to this rather evasive notion. We then study some…
In 1967 Herbert Scarf suggested a new proof of Brouwer fixed point theorem based on a surprising analogue of Sperner's lemma. This analogue was motivated by Scarf's work in game theory and mathematical economics. Moreover, Scarf proved a…
In this paper, we prove an extension theorem for spheres of square radii in $\mathbb{F}_q^d$, which improves a result obtained by Iosevich and Koh (2010). Our main tool is a new point-hyperplane incidence bound which will be derived via a…
A facial unique-maximum coloring of a plane graph is a proper vertex coloring by natural numbers where on each face $\alpha$ the maximal color appears exactly once on the vertices of $\alpha$. Fabrici and G\"oring proved that six colors are…
An old question in Ramsey theory asks whether any finite coloring of the natural numbers admits a monochromatic pair $\{x+y,xy\}$. We answer this question affirmatively in a strong sense by exhibiting a large new class of non-linear…
The conflict between classical and quantum physics can be identified through a series of yes-no tests on quantum systems, without it being necessary that these systems be in special quantum states. Kochen-Specker (KS) sets of yes-no tests…
The paper surveys some questions concerning \emph{coloring axioms} which grew out of the discussions the author had with his PhD advisor Ken Kunen.
The 1-2-3 Conjecture, posed by Karo\'{n}ski, {\L}uczak and Thomason, asked whether every connected graph $G$ different from $K_2$ can be 3-edge-weighted so that every two adjacent vertices of $G$ get distinct sums of incident weights. The…
Quantum mechanics implies that not all physical properties can be simultaneously well defined, such as the momentum and position due to Heisenberg uncertainty principle. Some alternative theories have been explored, notably the…
A simply colored coalgebra is a coassociative counital coalgebra $C$ over an arbitrary ring $R$, which can be decomposed into a direct sum of two $R$-modules: one generated by set-like elements and another consisting of conilpotent…
We correct some errors and omissions primarily in a paper [Albertson&Hutchinson2004], discovered by R.B. Richter, and also some in a proof of [Thomassen1993] and of [Yu1997]. We give a short proof of Thomassen's theorem that every…
There is an extensive history of scholarship into what constitutes a "basic" color term, as well as a broadly attested acquisition sequence of basic color terms across many languages, as articulated in the seminal work of Berlin and Kay…
We examine $t$-colourings of oriented graphs in which, for a fixed integer $k \geq 1$, vertices joined by a directed path of length at most $k$ must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the…
If noncontextuality is defined as the robustness of a system's response to a measurement against other simultaneous measurements, then the Kochen-Specker arguments do not provide an algebraic proof for quantum contextuality. Namely, for the…