Related papers: A logical implication between two conjectures on m…
In the consistent histories formulation of quantum theory, the probabilistic predictions and retrodictions made from observed data depend on the choice of a consistent set. We show that this freedom allows the formalism to retrodict…
In this note, we consider quantum correlations of bipartite systems having a slight interaction, and reinterpret Tsirelson's problem (and hence Kirchberg's and Connes's conjectures) in terms of finite-dimensional asymptotically commuting…
The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…
Following the work of Gao and Xie in [2], we state some properties of the inverse Kazhdan-Lusztig polynomial of a matroid. We also give partial answers to a conjecture that states that regular connected matroids are non-degenerate. We link…
Many types of categorical structure obey the following principle: the natural notion of equivalence is generated, as an equivalence relation, by identifying $A$ with $B$ when there exists a strictly structure-preserving map $A \to B$ that…
We show that the infinite matroid intersection conjecture of Nash-Williams implies the infinite Menger theorem proved recently by Aharoni and Berger. We prove that this conjecture is true whenever one matroid is nearly finitary and the…
We prove that if nonlinear complex polynomials of the same degree have orbits with infinite intersection, then the polynomials have a common iterate. We also prove a special case of a conjectured dynamical analogue of the Mordell-Lang…
We discuss an extension of the almost Hadamard matrix formalism, to the case of complex matrices. Quite surprisingly, the situation here is very different from the one in the real case, and our conjectural conclusion is that there should be…
The Serre conjecture II predicts that every torsor under a semisimple, simply connected, algebraic group over a field of cohomological dimension at most 2 and of degree of imperfection at most 1 has a rational point. We generalize this…
Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These can be used to provide counterexamples against the natural extension of the Well-quasi-ordering-Conjecture to infinite matroids and to show that…
We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…
Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…
Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.
We provide various counter-examples to the long-standing so-called "Omnibus Conjecture" in Rational Homotopy Theory. That is, we show that a space with finite dimensional even-degree rational cohomology and finite dimensional spherical…
Pseudo-effect algebras are partial algebraic structures, that were introduced as a non-commutative generalization of effect algebras. In the present paper, lattice ordered pseudo-effect algebras are considered as possible algebraic…
We interpret part of the experimental results of Shwartz-Ziv and Tishby [2017]. Inspired by these results, we established a conjecture of the dynamics of the machinary of deep neural network. This conjecture can be used to explain the…
Based on a less-known result, we prove a recent conjecture concerning the determinant of a certain Sylvester-Kac type matrix and consider an extension of it.
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…