Related papers: Generalized parity proofs of the Kochen-Specker th…
Every ordered collection of sets in Euclidean space can be associated to a combinatorial code, which records the regions cut out by the sets in space. Given two ordered collections of sets, one can form a third collection in which the…
We consider generalizations of parity polytopes whose variables, in addition to a parity constraint, satisfy certain ordering constraints. More precisely, the variable domain is partitioned into $k$ contiguous groups, and within each group,…
We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…
We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…
Generalized Product (GPC) Codes, an unification of Product Codes and Integrated Interleaved (II) Codes, are presented. Applications for approaches requiring local and global parities are described. The more general problem of extending…
Theorem provers are tools that help users to write machine readable proofs. Some of this tools are also interactive. The need of such softwares is increasing since they provide proofs that are more certified than the hand written ones. Agda…
Speech separation has been extensively explored to tackle the cocktail party problem. However, these studies are still far from having enough generalization capabilities for real scenarios. In this work, we raise a common strategy named…
Mermin's simple "pentagram" proof of the Kochen-Specker theorem is examined from various perspectives. We emphasise the many mathematical structures intimately related to Kochen-Specker proofs, ranging through functional analysis, sheaf…
A set of quantum measurements exhibits quantum contextuality when any consistent value assignment to the measurement outcomes leads to a contradiction with quantum theory. In the original Kochen-Specker-type of argument the measurement…
While model checking has often been considered as a practical alternative to building formal proofs, we argue here that the theory of sequent calculus proofs can be used to provide an appealing foundation for model checking. Since the…
Generalised polynomials are maps constructed by applying the floor function, addition, and multiplication to polynomials. Despite superficial similarity, generalised polynomials exhibit many phenomena which are impossible for polynomials.…
It has been argued that any test of quantum contextuality is nullified by the fact that perfect orthogonality and perfect compatibility cannot be achieved in finite precision experiments. We introduce experimentally testable two-qutrit…
Every set (finite or infinite) of quantum vectors (states) satisfies generalized orthoarguesian equations ($n$OA). We consider two 3-dim Kochen-Specker (KS) sets of vectors and show how each of them should be represented by means of a Hasse…
The equivalence test is a main part in any classification problem. It helps to prove bounds for the main parameters of the considered combinatorial structures and to study their properties. In this paper, we present algorithms for…
For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belongs to the fixed class of languages. Secondly, the separation…
The paper is devoted to construction of some closed inductive sequence of models of the generalized second-order Dedekind theory of real numbers with exponentially increasing powers. These models are not isomorphic whereas all models of the…
Out-of-distribution generalization capabilities of sequence-to-sequence models can be studied from the lens of two crucial forms of generalization: length generalization -- the ability to generalize to longer sequences than ones seen during…
We give a triplet of short proofs, each of which answers a question raised by Erd\H{o}s. The first concerns the small prime factors of $\binom{n}{k}$, the second concerns whether an additive basis $A$ can always be split into pieces $A_1$…
Maximum composite likelihood estimation is a useful alternative to maximum likelihood estimation when data arise from data generating processes (DGPs) that do not admit tractable joint specification. We demonstrate that generic composite…
The idea of counting the number of satisfying truth assignments (models) of a formula by adding random parity constraints can be traced back to the seminal work of Valiant and Vazirani, showing that NP is as easy as detecting unique…